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
Relational specifications of infinite query answers
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional deductive databases: query processing in the presence of limited function symbols
Functional deductive databases: query processing in the presence of limited function symbols
Temporal deductive databases and infinite objects
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Procedural and declarative database update languages
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)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
The logic of totally and partially ordered plans: a deductive database approach
Annals of Mathematics and Artificial Intelligence
A Deductive Database Approach to A.I. Planning
Journal of Intelligent Information Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Artificial Intelligence Review
Hi-index | 0.00 |
We study conditions guaranteeing polynomial time computability of queries in temporal deductive databases. We show that if for a given set of temporal rules, the period of its least models is bounded from the above by a polynomial in the database size, then also the time to process yes-no queries (as well as to compute finite representations of all query answers) can be polynomially bounded. We present a bottom-up query processing algorithm BT that is guaranteed to terminate in polynomial time if the periods are polynomially bounded. Polynomial periodicity is our most general criterion, however it can not be directly applied. Therefore, we exhibit two weaker criteria, defining inflationary and I-periodic sets of temporal rules. We show that it can be decided whether a set of temporal rules is inflationary. I-periodicity is undecidable (as we show), but it can be closely approximated by a syntactic notion of multi-separability.