The following pages link to SETHEO (Q13461):
Displaying 50 items.
- (Q2723438) (← links)
- Model elimination and connection tableau procedures (Q2751380) (← links)
- (Q2766732) (← links)
- Automated deduction techniques for the management of personalized documents. (Extended abstract) (Q2767917) (← links)
- First-Order Tableaux in Applications (Extended Abstract) (Q3010356) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- Logic programming as a basis for lean automated deduction (Q3129514) (← links)
- Efficient Low-Level Connection Tableaux (Q3455764) (← links)
- (Q3491009) (← links)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
- Representing heuristic-relevant information for an automated theorem prover (Q3979280) (← links)
- (Q4217955) (← links)
- (Q4242056) (← links)
- (Q4244296) (← links)
- (Q4249897) (← links)
- (Q4261066) (← links)
- (Q4263169) (← links)
- (Q4264737) (← links)
- (Q4282502) (← links)
- (Q4282522) (← links)
- Short Conjunctive Normal Forms in Finitely Valued Logics (Q4323008) (← links)
- (Q4385443) (← links)
- (Q4409888) (← links)
- (Q4520768) (← links)
- (Q4524769) (← links)
- (Q4524776) (← links)
- (Q4530468) (← links)
- (Q4530471) (← links)
- (Q4537435) (← links)
- (Q4539595) (← links)
- (Q4539623) (← links)
- (Q4539650) (← links)
- Free variable tableaux for propositional modal logics (Q4610317) (← links)
- Ordered tableaux: Extensions and applications (Q4610325) (← links)
- Subgoal alternation in model elimination (Q4610327) (← links)
- A framework for using knowledge in tableau proofs (Q4610337) (← links)
- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison (Q4645236) (← links)
- T-string unification: Unifying prefixes in non-classical proof methods (Q4645241) (← links)
- SiCoTHEO: Simple competitive parallel theorem provers (Q4647520) (← links)
- XRay: A prolog technology theorem prover for default reasoning: A system description (Q4647525) (← links)
- Optimizing proof search in model elimination (Q4647531) (← links)
- Converting non-classical matrix proofs into sequent-style systems (Q4647538) (← links)
- Efficient model generation through compilation (Q4647539) (← links)
- (Q4705311) (← links)
- (Q4808844) (← links)
- (Q4840648) (← links)
- (Q4934144) (← links)
- (Q5020994) (← links)
- Model elimination without contrapositives (Q5210764) (← links)
- Detecting non-provable goals (Q5210774) (← links)
