scientific article; zbMATH DE number 3956434
From MaRDI portal
Publication:3725540
Recommendations
Cited in
(34)- Inductive proof search modulo
- Inductive completion with retracts
- Narrowing based procedures for equational disunification
- Extending Bachmair's method for proof by consistency to the final algebra
- A recursion planning analysis of inductive completion
- A strong restriction of the inductive completion procedure
- Automatic proofs by induction in theories without constructors
- Induction = I-axiomatization + first-order consistency.
- Strong forward induction
- scientific article; zbMATH DE number 3891336 (Why is no real title available?)
- scientific article; zbMATH DE number 4090851 (Why is no real title available?)
- scientific article; zbMATH DE number 44069 (Why is no real title available?)
- Completeness and decidability results for first-order clauses with indices
- scientific article; zbMATH DE number 1389652 (Why is no real title available?)
- Inductive proofs by specification transformations
- Rewriting techniques for program synthesis
- On relationship between term rewriting systems and regular tree languages
- Proving equational and inductive theorems by completion and embedding techniques
- Induction using term orderings
- Mechanizable inductive proofs for a class of \(\forall \exists\) formulas
- On the connection between narrowing and proof by consistency
- Inductive theorem proving by consistency for first-order clauses
- Conditional rewriting in focus
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation
- Proof by consistency in conditional equational theories
- Completion procedures as semidecision procedures
- The strength of sharply bounded induction requires MSP
- Term rewriting induction
- UNICOM: A refined completion based inductive theorem prover
- Higher-order proof by consistency
- Towards a foundation of completion procedures as semidecision procedures
- Testing for the ground (co-)reducibility property in term-rewriting systems
- Automating inductionless induction using test sets
- On ground-confluence of term rewriting systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725540)
