Relational queries computable in polynomial time
Information and Control
Information Processing Letters
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Logic programming and parallel complexity
Foundations of deductive databases and logic programming
Boundedness is undecidable for datalog programs with a single recursive rule
Information Processing Letters
Logic programming and databases
Logic programming and databases
The expressive power of second order Horn logic
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
The parallel complexity of simple logic programs
Journal of the ACM (JACM)
Satisfiability of the smallest binary program
Information Processing Letters
Inductive logic programming and learnability
ACM SIGART Bulletin
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Descriptive Complexity and Model Checking
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Halting Problem of One Binary Horn Clause is Undecidable
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
DATALOG SIRUPs uniform boundedness is undecidable
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th 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
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Undecidability of the Horn-clause implication problem
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Datalog is a well-known database query language based on the logic programming paradigm. A general datalog program consists of a number of rules and facts. Programs containing a unique rule and possibly some facts are called single rule programs (sirups). We study both the combined and the program complexity of sirups, ie., the complexity of evaluating sirups over variable and fixed databases, respectively. Moreover, we study the descriptive complexity of sirups, i.e., their expressive power. In all cases it turns out that even very restricted classes of sirups have the same complexity and essentially the same expressive power as general datalog programs. We show that the evaluation of single clause programs is EXPTIME complete (combined complexity), and, if restricted to linear recursive rules, PSPACE complete. Moreover, sirups with one recursive rule and one additional fact capture PTIME on ordered structures, if a certain data representation is assumed and certain predefined relations are provided. Our results are obtained by a uniform product construction which maps a datalog program into a single rule by essentially maintaining its semantics. We also prove that the datalog clause implication problem, i.e., deciding whether a datalog clause implies another one, is EXPTIME complete.