Pages that link to "Item:Q4299008"
From MaRDI portal
The following pages link to Equational inference, canonical proofs, and proof orderings (Q4299008):
Displaying 18 items.
- Multi-completion with termination tools (Q352956) (← links)
- Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Natural termination (Q673622) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- Canonicity! (Q3541714) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- The Blossom of Finite Semantic Trees (Q4916075) (← links)
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01). (Q4916226) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- Termination Tools in Ordered Completion (Q5747788) (← links)
- The Maude strategy language (Q6113021) (← links)
