Nondeterminism and infinite computations in constraint programming

DOI10.1016/0304-3975(95)00047-ZMaRDI QIDQ671989zbMATH OpenOpenAlexFDO

Authors Frank S. de Boer, Alessandra Di Pierro, Catuscia Palamidessi

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00047-z

zbMATH Keywords

constraint logic programmingnondeterminism and infinite behaviorsemantics of concurrent constraint programming

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1231566
• scientific article; zbMATH DE number 683344
• Truly concurrent constraint programming
• scientific article; zbMATH DE number 1638652
• Truly concurrent constraint programming

Cites work

• scientific article; zbMATH DE number 1638652 (Why is no real title available?)
• scientific article; zbMATH DE number 3888910 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 107664 (Why is no real title available?)
• scientific article; zbMATH DE number 3635472 (Why is no real title available?)
• scientific article; zbMATH DE number 1158761 (Why is no real title available?)
• scientific article; zbMATH DE number 826300 (Why is no real title available?)
• scientific article; zbMATH DE number 3339390 (Why is no real title available?)
• Concrete domains
• Confluence in concurrent constraint programming
• Contributions to the semantics of logic perpetual processes
• Declarative modeling of the operational behavior of logic languages
• Processes and the denotational semantics of concurrency
• Semantic models for concurrent logic languages
• The Semantics of Predicate Logic as a Programming Language
• Toward a declarative semantics for infinite objects in logic programming
• Truly concurrent constraint programming

Cited in

(20)

• Unbounded Non-determinism in CSP
• scientific article; zbMATH DE number 7649937 (Why is no real title available?)
• Linear Structures for Concurrency in Probabilistic Programming Languages
• Modeling biological systems in stochastic concurrent constraint programming
• Computational Short Cuts in Infinite Domain Constraint Satisfaction
• A fully abstract semantics for concurrent constraint programming
• Maximal infinite-valued constraint languages
• Decidability of infinite-state timed CCP processes and first-order LTL
• scientific article; zbMATH DE number 7121950 (Why is no real title available?)
• Real number computation with committed choice logic programming languages
• Reasoning about distributed information with infinitely many agents
• Probabilistic confinement in a declarative framework
• Characterizing right inverses for spatial constraint systems with applications to modal logic
• Deriving inverse operators for modal logic
• Models and emerging trends of concurrent constraint programming
• Belief, knowledge, lies and other utterances in an algebra for space and extrusion
• A proof theoretic study of soft concurrent constraint programming
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• Abstract interpretation of temporal concurrent constraint programs
• scientific article; zbMATH DE number 7449993 (Why is no real title available?)

This page was built for publication: Nondeterminism and infinite computations in constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671989)