Modal Logic S5 Satisfiability in Answer Set Programming

DOI10.1017/S1471068421000247OpenAlexW3190660638MaRDI QIDQ5019595

Mario Alviano, George Baryannis, Sotiris Batsakis

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

modal logicKripke semanticsanswer set programmingS5

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Modal logic S5 in answer set programming with lazy creation of worlds

Uses Software

• LoTREC
• Clingo
• Spartacus
• InKreSAT

Cites Work

• Unnamed Item
• Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation
• Strategies for modal resolution: Results and problems
• A structure-preserving clause form translation
• A simple propositional \(\text{S}5\) tableau system
• A completeness theorem in modal logic
• One-Pass Tableaux for Computation Tree Logic
• Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability
• Semantics-Based Translation Methods for Modal Logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation
• A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
• InKreSAT: Modal Reasoning via Incremental Reduction to SAT
• A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• A CORRECT POLYNOMIAL TRANSLATION OF S4 INTO INTUITIONISTIC LOGIC
• Answer Set Programming
• Clausal resolution for normal modal logics
• Automated Reasoning with Analytic Tableaux and Related Methods
• Weak models of distributed computing, with connections to modal logic

This page was built for publication: Modal Logic S5 Satisfiability in Answer Set Programming