SAT-based decision procedures for classical modal logics
From MaRDI portal
Publication:1610667
DOI10.1023/A:1015071400913zbMath1003.03011MaRDI QIDQ1610667
Armando Tacchella, Enrico Giunchiglia, Fausto Giunchiglia
Publication date: 20 August 2002
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items
HYPNO: Theorem Proving with Hypersequent Calculi for Non-normal Modal Logics (System Description), Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Answer set programming based on propositional satisfiability, The SAT-based approach to separation logic, Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving, Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction), Solving the \$100 modal logic challenge, SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
Uses Software
