02358nam a2200385 4500 20260818084704.0 280898 th eng .b10162124 AIT Thesis no.CS-90-24 Nguyen Viet Hai Computing well-founded semantics of deductive databases Bangkok : Asian Institute of Technology, 1990 46 p. Thesis ; no. CS-90-24 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Engineering and Technology Thesis (M.Sc.) - Asian Institute of Technology, 1990 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 well founded partial model. The underlying language is permitted to have infinitely many constants . Programming languages (Electronic computers) Semantics Phan, Minh Dung, Chairperson Huynh, Ngoc Phien, Examination Committee Sadananda, Ramakoti, Examination Committee The Australian Government, Scholarship Donor Asian Institute of Technology. Thesis ; no. CS-90-24 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B18301 .b10162124 mnait x 240411 2 951012 m a x 0 mnait mnarc 22 40 Barcode : 30050120677520 CREATED : 2014-11-02 RECORD # : i12761163 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050120373021 CREATED : 2016-08-06 RECORD # : i13025703 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 21497 21497 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Thesis no.CS-90-24 30050120677520 2026-08-18 08:47:04 3 2026-08-18 22 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no.CS-90-24 30050120373021 2026-08-18 08:47:04 2026-08-18 40