Logic Programming

DOI10.1007/b99475zbMath1104.68359OpenAlexW2523427404MaRDI QIDQ5313213

Peter J. Stuckey, Gregory J. Duck, Maria Garcia de la Banda, Christian Holzbaur

Publication date: 26 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99475

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (22)

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules ⋮ Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR ⋮ The expressive power of CHR with priorities ⋮ Confluence Modulo Equivalence in Constraint Handling Rules ⋮ Exhaustive Execution of CHR Through Source-to-Source Transformation ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ Combining Forward and Backward Propagation ⋮ On proving confluence modulo equivalence for Constraint Handling Rules ⋮ Expressiveness of Multiple Heads in CHR ⋮ Welcome to Constraint Handling Rules ⋮ A Flexible Search Framework for CHR ⋮ Adaptive CHR Meets CHR ∨ ⋮ Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules ⋮ A Compositional Semantics for CHR with Propagation Rules ⋮ CHR for Imperative Host Languages ⋮ Guard Reasoning in the Refined Operational Semantics of CHR ⋮ Implementing type theory in higher order constraint logic programming ⋮ Aggregates for CHR through Program Transformation ⋮ Optimization of CHR Propagation Rules ⋮ Termination Analysis of CHR Revisited ⋮ Turing-Complete Subclasses of CHR ⋮ Models and emerging trends of concurrent constraint programming

This page was built for publication: Logic Programming