C. Bckstrm and I. Klein "Planning in Polynomial Time: The SAS-PUBS class" Comput. Intell., Vol. 7 (3), pp 181-197, 1991.  Home/Search   Document Not in Database   Summary   Related Articles

....theory that can decide about the wellformedness, completeness and consistency of domain states and actions. The compilation phase constitutes the core contribution of this paper. During this phase, each domain model is compiled into a semantically equivalent state variable based representation [27]. In the context of current knowledge based systems, it is well known that this representation is quite suited for object centred domains [26] 28] Besides, as shown along this paper, the state variable representation facilitates the decomposition of the domain, which is another task performed ....

....these systems require a simple representation of the actions that does not overhead the expensive search process implied in the generation of a plan. Two kinds of representations have been widely adopted in current planning systems: the Strips like [30] 31] and the state variable representation [27]. In the former, domain actions are represented by means of three lists of logic propositions: precondition, delete and add lists. This representation avoids the well known frame problem [32] 33] 34] by indicating only the propositions that change after applying an action. The latter approach ....

[Article contains additional citation context not shown here]

C. Bckstrm and I. Klein "Planning in Polynomial Time: The SAS-PUBS class" Comput. Intell., Vol. 7 (3), pp 181-197, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC