Negation as failure: Careful closure procedure
Artificial Intelligence
Inferring negative information from disjunctive databases
Journal of Automated Reasoning
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
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 relationship between circumscription and negation as failure
Artificial Intelligence
Weak generalized closed world assumption
Journal of Automated Reasoning
Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Negation and minimality in non-horn databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics of Disjunctive Deductive Databases
ICDT '92 Proceedings of the 4th International Conference on Database Theory
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Negation and minimality in non-horn databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming
IEEE Transactions on Knowledge and Data Engineering
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
New Generation Computing
Minimal founded semantics for disjunctive logic programs and deductive databases
Theory and Practice of Logic Programming
Consistent query answering under inclusion dependencies
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper addresses complexity issues for important problems arising with disjunctive databases. In particular, the complexity of inference of a literal and a formula from a propositional disjunctive database under a variety of well-known disjunctive database semantics is investigated, as well deciding whether a disjunctive database has a model under a particular semantics. The problems are located in appropriate slots of the polynomial hierarchy.