Confluence modulo equivalence in Constraint Handling Rules
DOI10.1007/978-3-319-17822-6_3zbMATH Open1353.68048OpenAlexW832410335WikidataQ125525949 ScholiaQ125525949MaRDI QIDQ2949698FDOQ2949698
Authors: Henning Christiansen, Maja H. Kirkeby 
Publication date: 2 October 2015
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://rucforsk.ruc.dk/ws/files/56543837/chp_10.1007_978_3_319_17822_6_3.pdf
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Biological Sequence Analysis
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- On theories with a combinatorial definition of 'equivalence'
- Worst-case Analysis of Set Union Algorithms
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Theory and practice of constraint handling rules
- Logic Programming
- As time goes by: constraint handling rules
- Observable Confluence for Constraint Handling Rules
- Constraint Handling Rules
- Testing for the Church-Rosser Property
- Diagrammatic confluence for constraint handling rules
Cited In (5)
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
- Diagrammatic confluence for constraint handling rules
- Title not available (Why is that?)
- Observable Confluence for Constraint Handling Rules
- 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)
