DSpace Repository

A logic programming-based formalism for local closed world reasoning in planning

Show simple item record

dc.contributor.author Dinh Trung Hang en_US
dc.date.accessioned 2015-01-12T10:39:44Z
dc.date.available 2015-01-12T10:39:44Z
dc.identifier.other AIT Thesis no.CS-02-24 en_US
dc.identifier.uri http://www.cs.ait.ac.th/xmlui/handle/123456789/237
dc.description Bangkok : Asian Institute of Technology, 2002 en_US
dc.description 58 p. en_US
dc.description.abstract LCW mechanism is one way to handle incomplete information in planning, that was first investigated by Etzioni et. al. and later advanced by Bacchus and Petrick. This work is another approach to LCW information in planning based on logic programming. We describe how LCW information is represented and inferred under logic programming framework. We also provide a high-level action language AL to capture all properties of actions that involve LCW information. The focus of defining this language is on semantics of knowledge updating at planning time and at execution time. Our formalism is shown to be sound with respect to reasoning about knowledge and actions.
dc.relation.ispartof Thesis no. CS-02-24 en_US
dc.relation.ispartof Asian Institute of Technology. Thesis no. CS-02-24 en_US
dc.subject Logic programming en_US
dc.subject Knowledge representation (Information theory) en_US
dc.title A logic programming-based formalism for local closed world reasoning in planning en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account