Structures for abstract rewriting

DOI10.1007/S10817-006-9065-7zbMATH Open1125.03011OpenAlexW2072206537MaRDI QIDQ2642463FDOQ2642463

Authors: Marc Aiguier, Diane Bahrami 

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

Recommendations

• scientific article; zbMATH DE number 4155899
• Reduction operators and completion of rewriting systems
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Ordered rewriting and confluence
• Abstract abstract reduction

zbMATH Keywords

axiomatizationrewrite systemabstract completion procedureabstract deduction procedureabstract rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35)

Cites Work

• Institutions: abstract model theory for specification and programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Term Rewriting and All That
• Title not available (Why is that?)
• Complete Sets of Reductions for Some Equational Theories
• Abstract canonical inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equational inference, canonical proofs, and proof orderings
• A rationale for conditional equational programming
• Refutational theorem proving using term-rewriting systems
• Title not available (Why is that?)
• Towards a foundation of completion procedures as semidecision procedures
• On word problems in Horn theories
• Completion of a Set of Rules Modulo a Set of Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Resolution of equations in algebraic structures. Volume II: Rewriting techniques
• Title not available (Why is that?)
• Free objects and equational deduction for partial conditional specifications
• Bi-rewrite systems
• Structures for abstract rewriting
• Knuth-Bendix completion for non-symmetric transitive relations
• Term rewrite systems for lattice theory
• Label algebras and exception handling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abstract canonical presentations
• On the word problem for free lattices
• Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).

Cited In (13)

• Triangulation in rewriting
• Abstract domains for reordering CLP(RLin) programs
• A theory of binding structures and applications to rewriting
• Structures for abstract rewriting
• Automata, Languages and Programming
• Some general results about proof normalization
• An abstract formulation for rewrite systems
• Topological rewriting systems applied to standard bases and syntactic algebras
• Title not available (Why is that?)
• Pullback rewriting and applications
• Finding small counterexamples for abstract rewriting properties
• Tools and Algorithms for the Construction and Analysis of Systems
• Reduction operators and completion of rewriting systems

This page was built for publication: Structures for abstract rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642463)