Work

A Dynamic Epistemic Framework for Conformant Planning

Year: 2016

Type: article

Abstract: In this paper, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We reduce plan verification and conformant planning to model checking problems of our logic. We show that the model checking problem of the iteration-free fragment is PSPACE-complete. By using two non-standard (but equivalent) semantics, we give novel model checking algorithms to the full language and the iteration-free language.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.215.21

Authors: Quan Yu, Yanjun Li, Yanjing Wang

Institutions: Sun Yat-sen University, University of Groningen, Peking University, Qiannan Normal College For Nationalities

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Science Foundation, China Scholarship Council

Award: G6009352648