Constraint logic programming with dynamic scheduling: A semantics based on closure operators

DOI10.1006/INCO.1997.2638zbMath0882.68035OpenAlexW1972712449MaRDI QIDQ1368380

Catuscia Palamidessi, Maurizio Gabbrielli, Moreno Falaschi, Kim Marriott

Publication date: 28 September 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/82f72cc269ea7f6f8af532fde126a4d1cee68220

zbMATH Keywords

Prologatom scheduling rule

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Abstract interpretation of temporal concurrent constraint programs ⋮ Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations ⋮ Closures on CPOs form complete lattices ⋮ Models and emerging trends of concurrent constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• Declarative modeling of the operational behavior of logic languages
• Negation and control in PROLOG
• The Semantics of Predicate Logic as a Programming Language
• Observable Semantics for Constraint Logic Programs

This page was built for publication: Constraint logic programming with dynamic scheduling: A semantics based on closure operators