AI SearchComputing well-founded semantics of deductive databases
Call Number: AIT Thesis no.CS-90-24 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. CS-90-24Publication details: Bangkok : Asian Institute of Technology, 1990Description: 46 pSubject(s): Online resources: Dissertation note: Thesis (M.Sc.) - Asian Institute of Technology, 1990 Summary: 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 .
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.CS-90-24 (Browse shelf(Opens below)) | 3 | Available | 30050120677520 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.CS-90-24 (Browse shelf(Opens below)) | Available | 30050120373021 |
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 .
There are no comments on this title.