The Correspondence Between the Logical Algorithms Language and CHR

DOI10.1007/978-3-540-74610-2_15zbMATH Open1213.68175OpenAlexW2114158730MaRDI QIDQ3608656FDOQ3608656

Authors: Leslie De Koninck, Tom Schrijvers, Bart Demoen 

Publication date: 5 March 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74610-2_15

Recommendations

• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
• Logic Programming
• Theory and practice of constraint handling rules
• Constraint solving with constraint handling rules
• Welcome to Constraint Handling Rules

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Cited In (3)

• CHR: a constructive relevant natural-deduction logic
• A Flexible Search Framework for CHR
• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

This page was built for publication: The Correspondence Between the Logical Algorithms Language and CHR

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