The following pages link to (Q5486135):
Displaying 17 items.
- Model evolution with equality -- revised and implemented (Q429586) (← links)
- Automated inference of finite unsatisfiability (Q438540) (← links)
- Fast and slow enigmas and parental guidance (Q831937) (← links)
- Computing finite models by reduction to function-free clause logic (Q1006733) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- System Description: GAPT 2.0 (Q2817928) (← links)
- Selecting the Selection (Q2817931) (← links)
- THF0 – The Core of the TPTP Language for Higher-Order Logic (Q3541725) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Planning with Effectively Propositional Logic (Q4916083) (← links)
- The Relative Power of Semantics and Unification (Q4916085) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
- Herbrand Sequent Extraction (Q5505525) (← links)
