Approximate Epistemic Planning with Postdiction as Answer-Set Programming

DOI10.1007/978-3-642-40564-8_29zbMATH Open1405.68348OpenAlexW2158023579WikidataQ62623715 ScholiaQ62623715MaRDI QIDQ2851263FDOQ2851263

Authors: Manfred Eppe, Mehul Bhatt, Frank Dylla 

Publication date: 10 October 2013

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_29

Recommendations

• Approximate postdictive reasoning with answer set programming
• Epistemic answer set programming
• Epistemic planning for single- and multi-agent systems
• DEL-based epistemic planning: decidability and complexity
• A history based approximate epistemic action theory for efficient postdictive reasoning
• Planning with Incomplete Information in Quantified Answer Set Programming
• A dynamic epistemic framework for reasoning about conformant probabilistic plans
• Planning using dynamic epistemic logic: correspondence and complexity
• Logic Programming
• Answer set programming and its applications in planning and multi-agent systems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Logic in artificial intelligence (68T27) Artificial intelligence for robotics (68T40)

Cited In (7)

• A computational framework for conceptual blending
• Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\)
• Efficient Open World Reasoning for Planning
• A history based approximate epistemic action theory for efficient postdictive reasoning
• Approximate postdictive reasoning with answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming

This page was built for publication: Approximate Epistemic Planning with Postdiction as Answer-Set Programming

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