On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Data functions, datalog and negation
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SYGRAF: Implementing Logic Programs in a Database Style
IEEE Transactions on Software Engineering
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An axiomatic approach to deciding query safety in deductive databases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
On computing restricted projections of representative instances
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Logic and Data Bases
Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New direction for uncertainty reasoning in deductive databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
On the decidability and axiomatization of query finiteness in deductive databases
Journal of the ACM (JACM)
Constraint-Based Query Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Safe Database Queries with External Functions
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Declarative semantics for active rules
Theory and Practice of Logic Programming
External sources of knowledge and value invention in logic programming
Annals of Mathematics and Artificial Intelligence
Datalog programs over infinite databases, revisited
DBPL'07 Proceedings of the 11th international conference on Database programming languages
| Hi-index | 0.00 |
A query is safe with respect to a set of constraints if for every database that satisfies the constraints the query is guaranteed to yield a finite set of answers. We study here the safety problem for Datalog programs with respect to finiteness constraints. We show that safety can be viewed as a combination of two properties: weak safety, which guarantees the finiteness of intermediate answers, and termination, which guarantees the finiteness of the evaluation. We prove that while weak safety is decidable, termination is not. We then consider monadic programs, i.e., programs in which all intensional predicates are monadic, and show that safety is decidable in polynomial time for monadic programs. While we do not settle the safety problem, we show that a closely related problem, the decision problem for safety with respect to functional dependencies, is undecidable even for monadic programs.