Structures for abstract rewriting

DOI10.1007/s10817-006-9065-7zbMath1125.03011OpenAlexW2072206537MaRDI QIDQ2642463

Diane Bahrami, Marc Aiguier

Publication date: 17 August 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9065-7

zbMATH Keywords

rewrite systemaxiomatizationabstract completion procedureabstract deduction procedureabstract rewriting

Mathematics Subject Classification ID

Related Items (2)

Structures for abstract rewriting ⋮ Some general results about proof normalization

Cites Work

• Towards a foundation of completion procedures as semidecision procedures
• Free objects and equational deduction for partial conditional specifications
• Bi-rewrite systems
• On word problems in Horn theories
• Refutational theorem proving using term-rewriting systems
• A rationale for conditional equational programming
• Term rewrite systems for lattice theory
• Label algebras and exception handling
• Abstract canonical presentations
• Structures for abstract rewriting
• Knuth-Bendix Completion for Non-Symmetric Transitive Relations
• Completion of a Set of Rules Modulo a Set of Equations
• Complete Sets of Reductions for Some Equational Theories
• Equational inference, canonical proofs, and proof orderings
• Institutions: abstract model theory for specification and programming
• On the word problem for free lattices
• Term Rewriting and All That
• Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
• Abstract canonical inference
• 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

This page was built for publication: Structures for abstract rewriting