| Author | Nguyen Viet Hai |
| Call Number | AIT Thesis no.CS-90-24 |
| Subject(s) | Programming languages (Electronic computers)--Semantics
|
| 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 | In this study we present a bottom-up procedure to compute the
well-founded semantics of a datalog program (function free logic
program) on a language with infinitely many constants. The
distinguished features of our approach are:
Our method can be applied to any program: The class of
programs for which our method can be applied is neither restricted
to the class of stratified nor locally stratified programs as in
some other methods.
There is also no restriction about the existence of a complete
well-founded model and the method can be used to compute the wellfounded partial model.
The underlying language is permitted to have infinitely many
constants . |
| Year | 1990 |
| 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 ;Sadananda, Ramakoti
|
| Scholarship Donor(s) | The Australian Government |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 1990 |