The following pages link to On word problems in Horn theories (Q757095):
Displaying 13 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Problem corner: Non-Horn problems (Q1819949) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- SGGS decision procedures (Q2096457) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- Combinatorial Problems for Horn Clauses (Q3655139) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- The problem of Horn and Tarski (Q5418516) (← links)
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover (Q6156634) (← links)