Modal logic S5 satisfiability in answer set programming

DOI10.1017/S1471068421000247MaRDI QIDQ5019595zbMATH OpenOpenAlexFDO

Authors M. Alviano, Sotiris Batsakis, George Baryannis

Publication date 10 January 2022

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.04194

zbMATH Keywords

answer set programmingmodal logicKripke semanticsS5

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On uniform equivalence of epistemic logic programs
• An assumption-based approach for solving the minimal S5-satisfiability problem
• Formulas in modal logic S4
• On relation between constraint answer set programming and satisfiability modulo theories
• Constraint programming for modelling and solving modal satisfiability

Cites work

• A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• A completeness theorem in modal logic
• A correct polynomial translation of S4 into intuitionistic logic
• A simple propositional \(\text{S}5\) tableau system
• A structure-preserving clause form translation
• A trajectory calculus for qualitative spatial reasoning using answer set programming
• Answer set programming
• Automated Reasoning with Analytic Tableaux and Related Methods
• Automated reasoning in modal and description logics via SAT encoding: the case study of \(K_m/\mathcal{ALC}\)-satisfiability
• Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation
• Clausal resolution for normal modal logics
• InKreSAT: modal reasoning via incremental reduction to SAT
• One-Pass Tableaux for Computation Tree Logic
• SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
• Semantics-Based Translation Methods for Modal Logics
• Strategies for modal resolution: Results and problems
• Tableau methods for modal and temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Weak models of distributed computing, with connections to modal logic

Cited in

(5)

• Modal Logics Between S 4 and S 5
• Modal Satisfiability via SMT Solving
• Modal trees: Correction to a decision procedure for S5 (and T)
• scientific article; zbMATH DE number 5263148 (Why is no real title available?)
• Modal logic S5 in answer set programming with lazy creation of worlds

Describes a project that uses

Uses Software

• LoTREC
• Clingo
• Spartacus
• InKreSAT

This page was built for publication: Modal logic S5 satisfiability in answer set programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019595)