| Author | Pham Trieu Duong |
| Call Number | AIT Thesis no. CS-92-21 |
| Subject(s) | Logic programming
|
| Note | A thesis submitted in partial fulfillment of the requirement for the degree of Master of
Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | We study the problem of loop checking for near-Horn PROLOG. First, we analyse the
nature of non-termination of near Horn programs. We point out that there are in general two
possible ways for a near Horn program to run non-stop with a user's goal: the existence of an
infinite block and of infinitely many blocks in a near Horn PROLOG derivation. Especially, the
latter occurs with two possibilities: some block appears infinitely many times; none of the blocks
appears infinitely many times. Those situations are illustrated by sample programs. Second, we
propose two mechanics for loop checking for near Horn program. One is an extension of loop
checking proposed by BOL, R.L. (1991) for near Horn programs. The other is to deal with defer
head lists to prevent the case that some blocks appear infinitely many times. |
| Year | 1992 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung; |
| Examination Committee(s) | Sadananda, Ramakoti ;Huynh, Ngoc Phien
|
| Scholarship Donor(s) | The Government of Finland (FINIDA 094) ; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1992 |