Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

DOI10.1017/S1471068409003664zbMath1166.68312MaRDI QIDQ3621268

Leslie de Koninck

Publication date: 15 April 2009

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

complexity analysisconstraint handling ruleslogical algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (1)

A complete and terminating execution model for Constraint Handling Rules

Cites Work

• Stabilization of cooperative information agents in unpredictable environment: a logic programming approach
• The Correspondence Between the Logical Algorithms Language and CHR
• Observable Confluence for Constraint Handling Rules
• Theory and practice of constraint handling rules
• Memory Reuse for CHR
• ACD Term Rewriting
• Termination Analysis of CHR Revisited
• CHR grammars

This page was built for publication: Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities