The following pages link to (Q4331764):
Displaying 30 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)
- Completeness results for inequality provers (Q1079960) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- Deciding the \(E^+\)-class by an a posteriori, liftable order (Q1577484) (← 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)
- Hypothesis finding based on upward refinement of residue hypotheses. (Q1874226) (← links)
- A superposition calculus for abductive reasoning (Q2013317) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Cut-elimination: syntax and semantics (Q2259012) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- Ceres in intuitionistic logic (Q2363201) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Towards a clausal analysis of cut-elimination (Q2457341) (← links)
- Mechanising first-order temporal resolution (Q2486579) (← links)
- Multimodal logic programming (Q2503328) (← links)
- Controlling witnesses (Q2566063) (← links)
- Formalization of the Resolution Calculus for First-Order Logic (Q2829269) (← links)
- Combining Instance Generation and Resolution (Q3655208) (← links)
- A Resolution-based Model Building Algorithm for a Fragment of OCC1N = (Q4916224) (← links)
- Adding Guarded Constructions to the Syllogistic (Q5015968) (← links)
- Towards an algorithmic construction of cut-elimination procedures (Q5458060) (← 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)
