The following pages link to SCOTT (Q18797):
Displaying 24 items.
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- The automation of reasoning with incomplete information. From semantic foundations to efficient computation (Q1387257) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- A new methodology for query answering in default logics via structure-oriented theorem proving (Q1896370) (← links)
- Scavenger 0.1: a theorem prover based on conflict resolution (Q2405260) (← links)
- (Q2723438) (← links)
- (Q2767089) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- (Q3150303) (← links)
- Geometric Resolution: A Proof Procedure Based on Finite Model Search (Q3613415) (← links)
- A new method for automated finite model building exploiting failures and symmetries (Q4209295) (← links)
- (Q4305491) (← links)
- (Q4362927) (← links)
- (Q4385441) (← links)
- (Q4409888) (← links)
- (Q4415137) (← links)
- (Q4520770) (← links)
- (Q4531862) (← links)
- (Q4539595) (← links)
- Experiments in the heuristic use of past proof experience (Q4647545) (← links)
- (Q4783313) (← links)
- MACE4 and SEM: A Comparison of Finite Model Generators (Q4913862) (← links)
- Hammering towards QED (Q5195271) (← links)
- CODE: A powerful prover for problems of condensed detachment (Q5234708) (← links)
