We propose a new logic-based planning language, called K. Transitions between states of knowledge can be described in K, and the language is well suited for planning under incomplete knowledge. Nonetheless, K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, proving to be very flexible. A planning system supportingK is implemented on top of the disjunctive logic programming system DLV. This novel systemallows for solving hard planning problems, including secure planning under incomplete initial states, which cannot be solved at all by other logic-based planning systems such as traditional satisfiability planners.
CITATION STYLE
Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2000). Planning under incomplete knowledge. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1861, pp. 807–821). Springer Verlag. https://doi.org/10.1007/3-540-44957-4_54
Mendeley helps you to discover research relevant for your work.