Turing-Complete Subclasses of CHR

DOI10.1007/978-3-540-89982-2_72zbMath1185.68144OpenAlexW168533040MaRDI QIDQ5504695

Jon Sneyers

Publication date: 22 January 2009

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/224535

Mathematics Subject Classification ID

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

Related Items (1)

The expressive power of CHR with priorities

Cites Work

• Unnamed Item
• Expressiveness of Multiple Heads in CHR
• Guard Reasoning in the Refined Operational Semantics of CHR
• Constraint Handling Rules
• Logic Programming
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Turing-Complete Subclasses of CHR