A logic programming-based formalism for local closed world reasoning in planning | |
| Author | Dinh Trung Hang |
| Call Number | AIT Thesis no.CS-02-24 |
| Subject(s) | Logic programming Knowledge representation (Information theory) |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Masters of Science. School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. CS-02-24 |
| 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 Ac 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. |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. CS-02-24 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung |
| Examination Committee(s) | Vilas Wuwongse ;Haddawy, Peter |
| Scholarship Donor(s) | Vietnam MOET |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 2002 |