DocumentCode
3321005
Title
A nonmonotonic theory of plan synthesis
Author
Hundal, Salvinder S. ; Brown, Frank M.
Author_Institution
Dept. of Comput. Sci., Kansas Univ., Lawrence, KS, USA
fYear
1991
fDate
3-5 Apr 1991
Firstpage
180
Lastpage
189
Abstract
A theory of plan synthesis is proposed that reasons about actions to solve the frame problem. The authors also reason about the plan synthesis to detect possible or impossible orderings of the actions. This theory uses the frame axiom and the modal quantificational logic Z to propagate the facts from the current situation to the next situation. The explicit results of an action are provided only, no delete list is needed. The facts are automatically added and deleted from one situation to the next by the nonmonotonic reasoning as the actions are performed. An example illustrates the plan synthesis algorithm, which is given
Keywords
formal logic; inference mechanisms; delete list; frame axiom; frame problem; modal quantificational logic Z; nonmonotonic reasoning; plan synthesis; Computer science; Equations; Logic; Mechanical factors;
fLanguage
English
Publisher
ieee
Conference_Titel
Applied Computing, 1991., [Proceedings of the 1991] Symposium on
Conference_Location
Kansas City, MO
Print_ISBN
0-8186-2136-2
Type
conf
DOI
10.1109/SOAC.1991.143872
Filename
143872
Link To Document