Conditional narrowing modulo a set of equations

DOI10.1007/BF01202035zbMath0776.68068MaRDI QIDQ1261194

Alexander Bockmayr

Publication date: 31 August 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

functional programmingconstraint logic programmingconditional rewriting\(E\)-unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Complete symbolic reachability analysis using back-and-forth narrowing, Sentence-normalized conditional narrowing modulo in rewriting logic and Maude, Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols, Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude, Strict coherence of conditional rewriting modulo axioms

Uses Software

• REVE

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• A rationale for conditional equational programming
• Conditional rewrite rules
• Termination orderings for associative-commutative rewriting systems
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Associative-commutative reduction orderings
• Completeness results for basic narrowing
• Foundations of equational logic programming
• Completion of a Set of Rules Modulo a Set of Equations
• Proving termination with multiset orderings
• Complete Sets of Reductions for Some Equational Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item