MSPASS
From MaRDI portal
swMATH17667MaRDI QIDQ29522FDOQ29522
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/10722086_7
Cited In (46)
- Blocking and other enhancements for bottom-up model generation methods
- Simulation and synthesis of deduction calculi
- 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
- A subset-matching size-bounded cache for testing satisfiability in modal logics
- A foundational view on integration problems
- Implementing and evaluating provers for first-order modal logics
- Solving the \$100 modal logic challenge
- The Tableau Workbench
- TSPASS
- LoTREC
- FaCT++
- QMLTP
- GQML
- MetTeL
- pdl-tableau
- KtSeqC
- ModLeanTAP
- Spartacus
- LeoPARD
- TRP++
- HyLoRes
- TWB
- FMLtoHOL
- MleanCoP
- InKreSAT
- CTL-RP
- embed_modal
- KL-ONE
- BDDTab
- SableCC
- 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
- MOIN
- Reasoning about plan revision in BDI agent programs
- Capturing equilibrium models in modal logic
- The higher-order prover Leo-III
- MleanCoP: a connection prover for first-order modal logic
This page was built for software: MSPASS
