The following pages link to MSPASS (Q29522):
Displaying 23 items.
- Reasoning about plan revision in BDI agent programs (Q655407) (← links)
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- A new methodology for developing deduction methods (Q1037405) (← links)
- Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX 2000, St Andrews, Scotland, GB, July 3--7, 2000. Proceedings (Q1572743) (← links)
- An assumption-based approach for solving the minimal S5-satisfiability problem (Q1799062) (← links)
- The higher-order prover Leo-III (Q1799072) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- A subset-matching size-bounded cache for testing satisfiability in modal logics (Q2349812) (← links)
- Capturing equilibrium models in modal logic (Q2447178) (← links)
- Optimizing terminological reasoning for expressive description logics (Q2462645) (← links)
- A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- (Q2721185) (← links)
- HOL Based First-Order Modal Logic Provers (Q2870120) (← links)
- Simulation and Synthesis of Deduction Calculi (Q3185770) (← links)
- MleanCoP: A Connection Prover for First-Order Modal Logic (Q3192198) (← links)
- (Q3457212) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- The Tableau Workbench (Q4982114) (← links)
- A Foundational View on Integration Problems (Q5200111) (← links)
- Automated Deduction – CADE-19 (Q5900711) (← links)
