Nondeterminism and infinite computations in constraint programming
- 13 November 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 151 (1) , 37-78
- https://doi.org/10.1016/0304-3975(95)00047-z
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Semantic models for concurrent logic languagesTheoretical Computer Science, 1991
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- The family of concurrent logic programming languagesACM Computing Surveys, 1989
- Contributions to the semantics of logic perpetual processesActa Informatica, 1988
- Toward a declarative semantics for infinite objects in logic programmingThe Journal of Logic Programming, 1988
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Power domainsJournal of Computer and System Sciences, 1978
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976