MSPASS

swMATH17667MaRDI QIDQ29522FDOQ29522

Author name not available (Why is that?)

Cited In (23)

• Blocking and other enhancements for bottom-up model generation methods
• A general tableau method for propositional interval temporal logics: theory and implementation
• A new methodology for developing deduction methods
• Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX 2000, St Andrews, Scotland, GB, July 3--7, 2000. Proceedings
• HOL Based First-Order Modal Logic Provers
• Extensional higher-order paramodulation in Leo-III
• MleanCoP: A Connection Prover for First-Order Modal Logic
• A subset-matching size-bounded cache for testing satisfiability in modal logics
• A foundational view on integration problems
• Solving the \$100 modal logic challenge
• Simulation and Synthesis of Deduction Calculi
• The Tableau Workbench
• Inst-Gen -- a modular approach to instantiation-based automated reasoning
• Optimizing terminological reasoning for expressive description logics
• An assumption-based approach for solving the minimal S5-satisfiability problem
• \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
• Title not available (Why is that?)
• Optimizing a BDD-based modal solver.
• First-order resolution methods for modal logics
• Reasoning about plan revision in BDI agent programs
• Capturing equilibrium models in modal logic
• The higher-order prover Leo-III
• Title not available (Why is that?)

This page was built for software: MSPASS