| Author | Le Hoai Nam |
| Call Number | AIT Thesis no. CS-91-23 |
| 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 | It is desirable to augment logic programming with the ability to deal with embedded implications, i.e. to allow Horn rules themselves to be goals. But theoretical properties of this kind of logic (which conforms to a subset of intuitionlstic logic) are still being explored, and yet researchers don't come to an uniform acceptable frame work. In this thesis we define two query evaluation procedures for Logic programs containing embedded implications. First we define a simple fixpoint semantics for the definite function-free logic programs with embedded implications and prove some important properties. Then we specify a top-down query answering method, which we call HOLD resolution. Then we define a bottom-up procedure. The soundness and completeness of the two methods are proved. Last, we compare the two methods and propose further work. |
| 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) | Government of Japan |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 1991 |