Pages that link to "Item:Q1610667"
From MaRDI portal
The following pages link to SAT-based decision procedures for classical modal logics (Q1610667):
Displaying 12 items.
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- SAT-based decision procedures for classical modal logics (Q2751042) (← links)
- Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability (Q2751043) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- HYPNO: Theorem Proving with Hypersequent Calculi for Non-normal Modal Logics (System Description) (Q5049016) (← links)
- Mechanizing Mathematical Reasoning (Q5717462) (← links)
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving (Q6108819) (← links)
- Resolution calculi for non-normal modal logics (Q6541160) (← links)
