Diagrammatic confluence for Constraint Handling Rules
From MaRDI portal
Publication:4911146
DOI10.1017/S1471068412000270zbMath1261.68038arXiv1210.2297OpenAlexW3100181673MaRDI QIDQ4911146
Publication date: 13 March 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.2297
Related Items (2)
Confluence Modulo Equivalence in Constraint Handling Rules ⋮ On proving confluence modulo equivalence for Constraint Handling Rules
Cites Work
- Unnamed Item
- Unnamed Item
- Confluence and semantics of constraint simplification rules
- Confluence by decreasing diagrams
- On theories with a combinatorial definition of 'equivalence'
- Diagrammatic Confluence and Completion
- Constraint Handling Rules
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Unsolved problems in number theory
This page was built for publication: Diagrammatic confluence for Constraint Handling Rules