The following pages link to (Q5621960):
Displayed 13 items.
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Saturation, nonmonotonic reasoning and the closed-world assumption (Q1060864) (← links)
- Completely non-clausal theorem proving (Q1157923) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- Analytic resolution in theorem proving (Q1233325) (← links)
- The \(Q^*\) algorithm - a search strategy for a deductive question-answering system (Q1844090) (← links)
- Resolution graphs (Q2543000) (← links)
- Linear resolution with selection function (Q2551698) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- Representations of the language recognition problem for a theorem prover (Q4770508) (← links)
- The Blossom of Finite Semantic Trees (Q4916075) (← links)