Pages that link to "Item:Q673134"
From MaRDI portal
The following pages link to Towards a foundation of completion procedures as semidecision procedures (Q673134):
Displayed 14 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Canonicity! (Q3541714) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01). (Q4916226) (← links)