A lightweight epistemic logic and its application to planning

DOI10.1016/j.artint.2020.103437OpenAlexW3118156678MaRDI QIDQ2238679

Frédéric Maris, Elise Perrotin, Pierre Régnier, Martin C. Cooper, Faustine Maffre, Andreas Herzig

Publication date: 2 November 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103437

zbMATH Keywords

epistemic logicgossip problemepistemic planningmultiagent planning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Epistemic planning: perspectives on the special issue ⋮ Efficient multi-agent epistemic planning: teaching planners about nested belief

Uses Software

• PDDL
• SMCDEL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Announcements to attentive agents
• Epistemic protocols for dynamic gossip
• Introspective forgetting
• A guide to completeness and complexity for modal logics of knowledge and belief
• The computational complexity of propositional STRIPS planning
• The epistemic gossip problem
• Observable models
• Dynamic term-modal logics for first-order epistemic planning
• DEL-based epistemic planning: decidability and complexity
• Gossips and telephones
• A Concise Introduction to Models and Methods for Automated Planning
• Epistemic planning for single- and multi-agent systems
• Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
• Seeing Is Believing: Formalising False-Belief Tasks in Dynamic Epistemic Logic
• Possible Worlds Semantics Based on Observation and Communication
• A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation
• A survey of gossiping and broadcasting in communication networks
• The Byzantine Generals Problem
• A modal extension of logic programming: modularity, beliefs and hypothetical reasoning
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• CONTINGENCY AND KNOWING WHETHER
• A Cure for the Telephone Disease
• Algorithms - ESA 2003
• Formalizing sensing actions -- a transition function based approach

This page was built for publication: A lightweight epistemic logic and its application to planning