Proof System for Plan Verification under 0-Approximation Semantics

Details Proof System for Plan Verification under 0-Approximation Semantics Proof System for Plan Verification under 0-Approximation Semantics

2011-08-30

arxiv.org/abs/1108.5943v2

Computer Science

Artificial Intelligence

22 pages

Scientific paper

In this paper a proof system is developed for plan verification problems $\{X\}c\{Y\}$ and $\{X\}c\{KW p\}$ under 0-approximation semantics for ${\mathcal A}_K$. Here, for a plan $c$, two sets $X,Y$ of fluent literals, and a literal $p$, $\{X\}c\{Y\}$ (resp. $\{X\}c\{KW p\}$) means that all literals of $Y$ become true (resp. $p$ becomes known) after executing $c$ in any initial state in which all literals in $X$ are true.Then, soundness and completeness are proved. The proof system allows verifying plans and generating plans as well.

Affiliated with

Also associated with

No associations

Rating

Proof System for Plan Verification under 0-Approximation Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proof System for Plan Verification under 0-Approximation Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof System for Plan Verification under 0-Approximation Semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729036