The following pages link to Oz (Q18874):
Displaying 50 items.
- The distribution semantics for normal programs with function symbols (Q313122) (← links)
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Search combinators (Q487659) (← links)
- On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains'' (Q704657) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- A closer look at constraints as processes (Q844200) (← links)
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (Q850456) (← links)
- Dynamic state restoration using versioning exceptions (Q853735) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- Integer optimization by local search. A domain-independent approach (Q1301506) (← links)
- GOFFIN: Higher-order functions meet concurrent constraints (Q1380128) (← links)
- Constraint-based protocols for distributed problem solving (Q1380132) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Global constraints for round robin tournament scheduling. (Q1417492) (← links)
- Solving hierarchical constraints over finite domains with local search (Q1430292) (← links)
- On modelling mobility (Q1575151) (← links)
- Computer-aided construction of finite geometric spaces: Automated verification of geometric constraints (Q1595928) (← links)
- Programming constraint services. High-level programming of standard and new constraint services (Q1600089) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
- Processing underspecified semantic representations in the constraint language for lambda structures (Q1768793) (← links)
- Constraint solving for proof planning (Q1774557) (← links)
- Autonomous dynamic reconfiguration in multi-agent systems. Improving the quality and efficiency of collaborative problem solving (Q1850463) (← links)
- Ordering constraints over feature trees expressed in second-order monadic logic. (Q1854347) (← links)
- A timed concurrent constraint language. (Q1854359) (← links)
- Dominance constraints with Boolean connectives: A model-eliminative treatment (Q1870570) (← links)
- Iterative software engineering for multiagent systems. The MASSIVE method. (Q1880434) (← links)
- Agent-oriented programming. From Prolog to guarded definite clauses. (Q1880436) (← links)
- A methodological view of constraint solving (Q1969731) (← links)
- Localizer (Q1975204) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Symbolic DNN-tuner (Q2127252) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Constraint programming: strategic directions (Q2348607) (← links)
- Some challenges for constraint programming (Q2348612) (← links)
- Lifted discriminative learning of probabilistic logic programs (Q2425249) (← links)
- JavaLog: a framework-based integration of Java and Prolog for agent-oriented programming (Q2485090) (← links)
- On the expressiveness of timed coordination models (Q2495554) (← links)
- (Q2723443) (← links)
- (Q2729761) (← links)
- Experiments with the “Oregon Trail Knapsack Problem” (Q2741262) (← links)
- (Q2743695) (← links)
- (Q2752467) (← links)
- (Q2762628) (← links)
- (Q2762633) (← links)
- (Q2762878) (← links)
- (Q2763378) (← links)
