| Author | Ngo Huu Liem |
| Call Number | AIT Thesis no. CS-91-31 |
| Subject(s) | Logic programming
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | We investigate some different ways to give a logical basis for negation in disjunctive logic programs. In the first part, we consider program completion theories. The Negation-as-Finite-Failure for Disjunctive Logic Programming (DNAF) procedure, which is sound wrt Generalized Predicate Completion, is proposed. We also introduce Mixed Completion Theory and Selective Completion Theory and adapt DNAF to them. DNAF is combined with SLO-resolution to become a proof procedure for general disjunctive logic programs. In the second part, an abductive approach to disjunctive logic programming is investigated. |
| Year | 1991 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung |
| Examination Committee(s) | Huynh Ngoc Phien ;Vilas Wuwongse |
| Scholarship Donor(s) | The Government of Australia |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 1991 |