Structures for abstract rewriting

DOI10.1007/S10817-006-9065-7MaRDI QIDQ2642463zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(13)

• Reduction operators and completion of rewriting systems
• Triangulation in rewriting
• A theory of binding structures and applications to rewriting
• Abstract domains for reordering CLP(RLin) programs
• 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
• scientific article; zbMATH DE number 1722694 (Why is no real title available?)
• Pullback rewriting and applications
• Finding small counterexamples for abstract rewriting properties
• Tools and Algorithms for the Construction and Analysis of 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)