Journal of Logic Programming
Positivism vs minimalism in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The extended closed world assumption and its relationship to parallel circumscription
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
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 alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generalized closed world assumption is II-complete
Information Processing Letters
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Processing indefinite deductive databases under the possible model semantics
Fundamenta Informaticae
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
On the complexity of theory curbing
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A fixpoint approach to state generation for stratifiable disjunctive deductive databases
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Degrees of exclusivity in disjunctive databases
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Processing Indefinite Deductive Databases under the Possible Model Semantics
Fundamenta Informaticae
| Hi-index | 0.00 |
The fundamental problem that arises when a ground atom in a disjunctive database is assumed false is discussed. There are basically two different approaches for inferring negative information for disjunctive databases: J. Minker's (1982) generalized closed world assumption (GCWA) and K.A. Ross and R.W. Topor's (1988) disjunctive database rule (DDR). It is argued that neither approach is satisfactory. A database semantics called PWS is proposed. It is shown that for propositional databases with no negative clauses, the problem of determining if a negative ground literal is inferred under the GCWA is co-NP-hard, while the same problem can be solved efficiently under the DDR and PWS. However, in the general case, the problem becomes co-NP-complete for the DDR and PWS. Relationships among GCWA, DDR, and PWS are highlighted. In general, disjunctive clauses are interpreted inclusively under the DDR and unpredictably under the GCWA.