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

DOI10.1007/978-3-031-15707-3_2OpenAlexW4293179600MaRDI QIDQ2694545

Mario Alviano, George Baryannis, Sotiris Batsakis

Publication date: 4 April 2023

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

zbMATH Keywords

modal logicanswer set programmingS5

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Uses Software

• Clingo

Cites Work

• Unnamed Item
• Belief, information acquisition, and trust in multi-agent systems -- a modal logic formulation
• A simple propositional \(\text{S}5\) tableau system
• A completeness theorem in modal logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
• Modal Logic S5 Satisfiability in Answer Set Programming
• A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
• Answer Set Programming
• An upper bound for the chromatic number of a graph and its application to timetabling problems

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