The following pages link to (Q4331764):
Displaying 11 items.
- Group cancellation and resolution (Q817703) (← links)
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- A superposition calculus for abductive reasoning (Q2013317) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- Analogy in Automated Deduction: A Survey (Q5739522) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)
