On the Computation of the Disjunctive Well-Founded Semantics |
| |
Authors: | C. A. Johnson |
| |
Affiliation: | (1) Computer Science Department, University of Keele, Staffordshire, ST5 5BG, England |
| |
Abstract: | A characterization of the disjunctive well-founded semantics (DWFS) is given in terms of the Gelfond–Lifschitz transformation. This characterization is used to develop a top-down method of testing DWFS membership, employing a hyperresolution-like operator and quasi-cyclic trees to handle minimal model processing. A flexible bottom-up method of computing the DWFS is also given that admits the use of a powerful reduction operator. For finite propositional databases, all of our methods run in polynomial space. |
| |
Keywords: | disjunctive logic programs disjunctive deductive databases disjunctive well-founded semantics top-down computation bottom-up computation |
本文献已被 SpringerLink 等数据库收录! |