Confluence Modulo Equivalence in Constraint Handling Rules

DOI10.1007/978-3-319-17822-6_3zbMath1353.68048OpenAlexW832410335WikidataQ125525949 ScholiaQ125525949MaRDI QIDQ2949698

Maja H. Kirkeby, Henning Christiansen

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

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Confluence and convergence modulo equivalence in probabilistically terminating reduction systems, On proving confluence modulo equivalence for Constraint Handling Rules

Cites Work

• On theories with a combinatorial definition of 'equivalence'
• As time goes by: Constraint Handling Rules
• Observable Confluence for Constraint Handling Rules
• Constraint Handling Rules
• Worst-case Analysis of Set Union Algorithms
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Testing for the Church-Rosser Property
• Biological Sequence Analysis
• Theory and practice of constraint handling rules
• Diagrammatic confluence for Constraint Handling Rules
• Logic Programming
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm