A note on succinct representations of graphs
Information and Control
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Complexity of query processing in databases with OR-objects
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of graph problems for succinctly represented graphs
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Vector language: simple description of hard instances
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
On truth-table reducibility to SAT
Information and Computation
SIAM Journal on Computing
Journal of Computer and System Sciences
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
The complexity of algorithmic problems on succinct instances
Computer science
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Computing functions with parallel queries to NP
Theoretical Computer Science
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
Succinct circuit representations and leaf language classes are basically the same concept
Information Processing Letters
ACM Transactions on Database Systems (TODS)
Languages represented by Boolean formulas
Information Processing Letters
Succinct representation, leaf languages, and projection reductions
Information and Computation
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Logic and Databases: A 20 Year Retrospective
LID '96 Proceedings of the International Workshop on Logic in Databases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
How to Encode a Logical Structure by an OBDD
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Using Support Vector Machines for feature-oriented profile-based recommendations
International Journal of Advanced Intelligence Paradigms
Manifold Answer-Set Programs for Meta-reasoning
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Manifold answer-set programs and their applications
Logic programming, knowledge representation, and nonmonotonic reasoning
| Hi-index | 0.00 |
We study the complexity of data disjunctions in disjunctive deductive databases (DDDBs). A data disjunction is a disjunctive ground clause R(c-1pt1)...R(ck),K ≥ 2, which is derived from the database such that all atoms in the clause involve the same predicate R. We consider the complexity of deciding existence and uniqueness of a minimal data disjunction, as well as actually computing one, both for propositional (data) and nonground (program) complexity of the database. Our results extend and complement previous results on the complexity of disjunctive databases, and provide newly developed tools for the analysis of the complexity of function computation.