Abstract canonical presentations
From MaRDI portal
Publication:2500482
DOI10.1016/J.TCS.2006.03.012zbMATH Open1099.03047OpenAlexW2130170010MaRDI QIDQ2500482FDOQ2500482
Claude Kirchner, Nachum Dershowitz
Publication date: 16 August 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.012
Recommendations
- Abstract canonical inference
- Canonical representations
- Canonical representations
- scientific article; zbMATH DE number 2079676
- Canonical extensions and canonicity via dcpo presentations
- scientific article; zbMATH DE number 1048041
- Generalised weak presentations
- scientific article; zbMATH DE number 3845579
Proof theory in general (including proof-theoretic semantics) (03F03) Grammars and rewriting systems (68Q42) Mechanization of proofs and logical operations (03B35)
Cites Work
- Resolution theorem proving
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orderings for term-rewriting systems
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Title not available (Why is that?)
- Existence, Uniqueness, and Construction of Rewrite Systems
- Title not available (Why is that?)
- Rewriting
- Complete Sets of Reductions for Some Equational Theories
- Proving refutational completeness of theorem-proving strategies
- Abstract canonical inference
- Title not available (Why is that?)
- Theorem proving modulo
- About the rewriting systems produced by the Knuth-Bendix completion algorithm
- Paramodulation-based theorem proving
- Equational inference, canonical proofs, and proof orderings
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Proof by consistency
- Towards a foundation of completion procedures as semidecision procedures
- Theorem-proving with resolution and superposition
- Title not available (Why is that?)
- Completion of a Set of Rules Modulo a Set of Equations
- Completion of first-order clauses with equality by strict superposition
- Title not available (Why is that?)
- Pure patterns type systems
- History and basic features of the critical-pair/completion procedure
- Completion for unification
- Abstract canonical presentations
- Completion Is an Instance of Abstract Canonical System Inference
Cited In (7)
- Structures for abstract rewriting
- Some general results about proof normalization
- Canonical Ground Horn Theories
- Canonicity!
- Abstract canonical presentations
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
- Regaining cut admissibility in deduction modulo using abstract completion
This page was built for publication: Abstract canonical presentations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500482)
