Artificial Intelligence


Verifying the Validity of a Conformant Plan is co-NP-Complete

Authors: Alban Grastien, Enrico Scala

The purpose of this document is to show the complexity of verifying the validity of a deterministic conformant plan. We concentrate on a simple version of the conformant planning problem (i.e., one where there is no precondition on the actions and where all conditions are defined as sets of positive or negative facts) in order to show that the complexity does not come from solving a single such formula.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2017-05-22 19:18:05

Unique-IP document downloads: 27 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus