Confluence modulo equivalence in Constraint Handling Rules
From MaRDI portal
Publication:2949698
Recommendations
Cites work
- As time goes by: constraint handling rules
- Biological Sequence Analysis
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Constraint Handling Rules
- Diagrammatic confluence for constraint handling rules
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Logic Programming
- Observable Confluence for Constraint Handling Rules
- On theories with a combinatorial definition of 'equivalence'
- Testing for the Church-Rosser Property
- Theory and practice of constraint handling rules
- Worst-case Analysis of Set Union Algorithms
Cited in
(6)- Observable Confluence for Constraint Handling Rules
- Diagrammatic confluence for constraint handling rules
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
- Confluence modulo equivalence with invariants in constraint handling rules
- scientific article; zbMATH DE number 2086589 (Why is no real title available?)
- On proving confluence modulo equivalence for Constraint Handling Rules
This page was built for publication: Confluence modulo equivalence in Constraint Handling Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949698)