On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Compiling the GCWA in indefinite deductive databases
Foundations of deductive databases and logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
On the relations between stable and well-founded semantics of logic programs
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
ACM Transactions on Database Systems (TODS)
Top-down query processing in indefinite stratified databases
Data & Knowledge Engineering
On cyclic covers and perfect models
Data & Knowledge Engineering
Processing deductive databases under the disjunctive stable model semantics
Fundamenta Informaticae
Extending and implementing the stable model semantics
Artificial Intelligence
Processing indefinite deductive databases under the possible model semantics
Fundamenta Informaticae
Deduction Trees and the View Update Problem in Indefinite Deductive Databases
Journal of Automated Reasoning
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
Journal of Automated Reasoning
A general Approach to Bottom-Up Computation of Disjunctive Semantics
ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Semantics for disjunctive logic programs
Semantics for disjunctive logic programs
A survey on knowledge compilation
AI Communications
Query Compilation under the disjunctive well-founded semantics
Fundamenta Informaticae
| Hi-index | 0.00 |
A method is presented for computing minimal answers of the form $\bigvee {\cal A}$ in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), thus no non-minimal answer is generated. The method does not (necessarily) require the computation of models of the database in their entirety. A partitioning of the database into extensional and intensional components is employed in order to overcome the problems caused by the possible non-existence of disjunctive stable models, and a form of compilation is presented as a means of simplifying and improving the efficiency of the run-time computation, which then reduces to relatively trivial processing within the extensional database. In addition, the output from this compilation process has the significant advantage of being immune to updates to the extensional database. Other forms of database pre-processing are also considered, and three transformations are presented mapping a database onto an equivalent positive database, non-disjunctive database, and set of conditional facts.