Approximate Epistemic Planning with Postdiction as Answer-Set Programming

DOI10.1007/978-3-642-40564-8_29zbMath1405.68348OpenAlexW2158023579WikidataQ62623715 ScholiaQ62623715MaRDI QIDQ2851263

Mehul Bhatt, Frank Dylla, Manfred Eppe

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

Mathematics Subject Classification ID

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

Related Items (4)

Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) ⋮ Approximate postdictive reasoning with answer set programming ⋮ A history based approximate epistemic action theory for efficient postdictive reasoning ⋮ A computational framework for conceptual blending

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