Decidability and expressiveness aspects of logic queries
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
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Invited talk: automata theory for database theoreticians
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraints and redundancy in datalog
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite information: defined relations, recursion and linear order
The complexity of querying indefinite information: defined relations, recursion and linear order
Irrelevance reasoning in knowledge-based systems
Irrelevance reasoning in knowledge-based systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universal finiteness and satisfiability (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantic query optimization in Datalog programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Static analysis of intensional databases in U-Datalog (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Verification of relational tranducers for electronic commerce
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A logical framework for reasoning about access control models
ACM Transactions on Information and System Security (TISSEC)
The EVE Approach: View Synchronization in Dynamic Distributed Environments
IEEE Transactions on Knowledge and Data Engineering
Static Analysis of Logical Languages with Deferred Update Semantics
IEEE Transactions on Knowledge and Data Engineering
Decidability of First-Order Logic Queries over Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Linearly Bounded Reformulations of Unary Databases
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
History-Driven View Synchronization
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Model Checking Abstract State Machines and Beyond
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
SQL4X: A Flexible Query Language for XML and Relational Databases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The Constructive Method for Query Containment Checking
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
On the decidability of the termination problem of active database systems
Theoretical Computer Science
A history-driven approach at evolving views under meta data changes
Knowledge and Information Systems
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding equivalences among conjunctive aggregate queries
Journal of the ACM (JACM)
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Exploiting irrelevance reasoning to guide problem solving
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Logical queries over views: Decidability and expressiveness
ACM Transactions on Computational Logic (TOCL)
A transformation-based approach to view updating in stratifiable deductive databases
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Capturing missing tuples and missing values
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
We consider the problems of equivalence, satisfiability and query-reachability for datalog programs with negation and dense-order constraints. These problems are important for optimizing datalog programs. We show that both query-reachability and satisfiability are decidable for programs with stratified negation provided that negation is applied only to EDB predicates or that all EDB predicates are unary. In the latter case, we show that equivalence is also decidable. The algorithms we present are also used to push constraints from a given query to the EDB predicates. Finally, we show that satisfiability is undecidable for datalog programs with unary IDB predicates, stratified negation and the interpreted predicate ≠