DEL-based epistemic planning: decidability and complexity

DOI10.1016/J.ARTINT.2020.103304MaRDI QIDQ2211863zbMATH OpenOpenAlexFDO

Authors Thomas Bolander, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber

Publication date 16 November 2020

Published in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

automata theoryautomated planningcomplexity theorydecision problemsdynamic epistemic logicepistemic planning

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Recommendations

• Planning using dynamic epistemic logic: correspondence and complexity
• DEL planning and some tractable cases
• Conditional epistemic planning
• Epistemic planning with attention as a bounded resource
• Dynamic term-modal logics for first-order epistemic planning

Cites work

• A general notion of uniform strategies
• A simple account of multi-agent epistemic planning
• Alternating-time temporal logic
• Automata Presenting Structures: A Survey of the Finite String Case
• Automata techniques for epistemic protocol synthesis
• Chain-monadic second order logic over regular automatic trees and epistemic planning synthesis
• Computing with SAT oracles: past, present and future
• DEL planning and some tractable cases
• Dynamic epistemic logic
• Epistemic planning for single- and multi-agent systems
• Handbook of modal logic
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1931653 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Knowledge and belief. An introduction to the logic of the two notions. Prepared by Vincent F. Hendricks and John Symons
• Merging frameworks for interaction
• Modal logic
• One hundred prisoners and a light bulb
• Relationships between nondeterministic and deterministic tape complexities
• STRIPS: A new approach to the application of theorem proving to problem solving
• The logic of public announcements, common knowledge, and private suspicions
• Understanding planning tasks. Domain complexity and heuristic decomposition
• Uniform strategies, rational relations and jumping automata

Cited in

(15)

• Epistemic planning with attention as a bounded resource
• Multi-agent conformant planning with distributed knowledge
• A lightweight epistemic logic and its application to planning
• Approximate Epistemic Planning with Postdiction as Answer-Set Programming
• Planning using dynamic epistemic logic: correspondence and complexity
• DEL planning and some tractable cases
• Planning with Perspectives -- Decomposing Epistemic Planning using Functional STRIPS
• To be announced
• Epistemic planning: perspectives on the special issue
• \textsc{delphic}: practical DEL planning via possibilities
• Efficient reasoning about knowledge and common knowledge
• Knowing how to plan
• Knowing how to plan about planning: higher-order and meta-level epistemic planning
• Complexity of multi-agent conformant planning with group knowledge
• R-Mod: minimal structural revision of \(\mathrm{S}5\) epistemic models

Describes a project that uses

Uses Software

• Hintikka's world
• MCMAS

This page was built for publication: DEL-based epistemic planning: decidability and complexity

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