On the connection between narrowing and proof by consistency
From MaRDI portal
Publication:5210767
DOI10.1007/3-540-58156-1_10zbMath1433.68557OpenAlexW1598005203MaRDI QIDQ5210767
Publication date: 21 January 2020
Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58156-1_10
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Equational classes, universal algebra in model theory (03C05) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Cites Work
- Proofs by induction in equational theories with constructors
- On completeness of narrowing strategies
- On sufficient-completeness and related properties of term rewriting systems
- Automatic proofs by induction in theories without constructors
- Basic narrowing revisited
- Semantic confluence tests and completion methods
- Narrowing directed by a graph of terms
- Proof by consistency in conditional equational theories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item