Non-classical logics in satisfiability modulo theories
From MaRDI portal
Publication:6541143
DOI10.1007/978-3-031-43513-3_2MaRDI QIDQ6541143FDOQ6541143
Authors: Clemens Eisenhofer, Michael G. Rawson, Laura Kovács 
Publication date: 17 May 2024
Cites Work
- SAT modulo intuitionistic implications
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
- Tableau methods of proof for modal logics
- Title not available (Why is that?)
- Modal Satisfiability via SMT Solving
- Title not available (Why is that?)
- An efficient SMT solver for string constraints
- Title not available (Why is that?)
- An introduction to description logic
- Theorem provers for every normal modal logic
- Foundations of Information and Knowledge Systems
- Reasoning with finite sets and cardinality constraints in SMT
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
- The axiomatic translation principle for modal logic
- Local reductions for the modal cube
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Implementing tableau calculi using BDDs: BDDTab system description
- The MET: The Art of Flexible Reasoning with Modalities
- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
- Automated reasoning in \(\mathcal{ALCQ}\) via SMT
This page was built for publication: Non-classical logics in satisfiability modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541143)
