The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
From MaRDI portal
Publication:4245932
DOI10.1016/S0743-1066(98)10002-XzbMath0920.68068OpenAlexW1814221162WikidataQ126458499 ScholiaQ126458499MaRDI QIDQ4245932
Kim Marriott, Joxan Jaffar, Peter J. Stuckey, Michael J. Maher
Publication date: 31 May 1999
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-1066(98)10002-x
Related Items (28)
A necessary condition for constructive negation in constraint logic programming ⋮ On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP ⋮ Encoding abstract syntax without fresh names ⋮ An iterative approach to precondition inference using constrained Horn clauses ⋮ Slicing concurrent constraint programs ⋮ A new generic scheme for functional logic programming with constraints ⋮ Generalization-Driven Semantic Clone Detection in CLP ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ CLP(H):Constraint logic programming for hedges ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Anti-unification in Constraint Logic Programming ⋮ Unnamed Item ⋮ Attributed Graph Constraints ⋮ Concolic Testing in CLP ⋮ A functorial framework for constraint normal logic programming ⋮ A semantics for hybrid probabilistic logic programs with function symbols ⋮ Tree dimension in verification of constrained Horn clauses ⋮ Inference in probabilistic logic programs with continuous random variables ⋮ A Transformation-based implementation for CLP with qualification and proximity ⋮ Semantics of temporal constrained objects ⋮ On quantified linear implications ⋮ Totally correct logic program transformations via well-founded annotations ⋮ HM(X) type inference is CLP(X) solving ⋮ A non-termination criterion for binary constraint logic programs ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ Selective Unification in (Constraint) Logic Programming* ⋮ Contextual equivalence for inductive definitions with binders in higher order typed functional programming ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism
This page was built for publication: The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
