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

DOI10.1007/978-3-031-15707-3_2MaRDI QIDQ2694545zbMATH OpenOpenAlexFDO

Authors M. Alviano, Sotiris Batsakis, George Baryannis

Publication date 4 April 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15707-3_2

zbMATH Keywords

answer set programmingmodal logicS5

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• A completeness theorem in modal logic
• A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• A simple propositional \(\text{S}5\) tableau system
• A trajectory calculus for qualitative spatial reasoning using answer set programming
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Answer set programming
• Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation
• Modal logic S5 satisfiability in answer set programming
• Tableau methods for modal and temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

Describes a project that uses

Uses Software

• Clingo

This page was built for publication: Modal logic S5 in answer set programming with lazy creation of worlds

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