#### DMCA

## Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (Extended Abstract) (1993)

Venue: | In Proceedings of the ACM Symposium on Principles of Database Systems |

Citations: | 17 - 8 self |

### Citations

371 | Constraint query languages
- Kanellakis, Kuper, et al.
- 1995
(Show Context)
Citation Context ...ivalence is harder than them. In previous work, satisfiability was shown decidable for pure datalog programs [Shm87] and decidability for datalog with dense-order constraints follows from the work of =-=[KKR90]-=-. Query-reachability was shown decidable for datalog with dense-order constraints [LS92]. In this paper, we show that both satisfiability and query-reachability are decidable for datalog programs with... |

102 |
Undecidable Optimization Problems for Database Logic Programs
- Gaifman, Mairson, et al.
- 1993
(Show Context)
Citation Context ...ates, negation, and the interpreted predicate 6=. In contrast, note that equivalence is decidable for datalog programs with only unary IDB predicates (and neither negation nor interpreted predicates) =-=[CGKV88]-=-. In proving some of the decidability results, we use a rather powerful tool, the query-tree, which was first used in [LS92]. A query-tree is a finite structure that encodes all symbolic derivation tr... |

81 | On the equivalence of recursive and nonrecursive Datalog programs
- Chaudhuri, Vardi
- 1992
(Show Context)
Citation Context ...asted with the following results: First, containment of a recursive datalog program in a nonrecursive program, where IDB predicates are of any arity but there is neither negation nor 6=, is decidable =-=[CV92]-=-. Second, containment between two recursive datalog programs with only unary predicates (and neither negation nor 6=) is decidable [CGKV88]. Acknowledgment The authors thank Ron van der Meyden for poi... |

72 |
Decidability and expressiveness aspects of logic queries
- Shmueli
- 1987
(Show Context)
Citation Context ...one at AT&T Bell Laboratories. are approximately at the same level of difficulty, while equivalence is harder than them. In previous work, satisfiability was shown decidable for pure datalog programs =-=[Shm87]-=- and decidability for datalog with dense-order constraints follows from the work of [KKR90]. Query-reachability was shown decidable for datalog with dense-order constraints [LS92]. In this paper, we s... |

38 | Parallel complexity of logical query programs - Ullman, Gelder - 1986 |

35 | Constraints and redundancy in datalog
- Levy, Sagiv
- 1992
(Show Context)
Citation Context ...re datalog programs [Shm87] and decidability for datalog with dense-order constraints follows from the work of [KKR90]. Query-reachability was shown decidable for datalog with dense-order constraints =-=[LS92]-=-. In this paper, we show that both satisfiability and query-reachability are decidable for datalog programs with dense-order constraints and safe stratified negation provided that 1. negation is appli... |

29 |
Data functions, datalog and negation
- Abiteboul, Hull
- 1988
(Show Context)
Citation Context ...og programs with 6=, but without negation or any other interpreted predicates, if EDBs are required to satisfy some functional dependencies. 2 Proof: Follows from the above reduction and the proof of =-=[AH88]-=- that inference of functional dependencies in datalog programs is undecidable. 2 7 Conclusions We identified new classes of programs for which equivalence, query-reachability and satisfiability are ei... |

22 | Irrelevance Reasoning in Knowledge Based Systems
- Levy
- 1993
(Show Context)
Citation Context ...variable pattern. We then build a query-tree for the resulting program, and q(sX) is query-reachable if and only if some atom of q 0 appears in the resulting query-tree. For the complete details, see =-=[Levy93]-=-. As a corollary of the above theorems, we get the following: Corollary 3.2 Given a datalog program P with negated EDB subgoals, the following problems are decidable. First, testing satisfiability of ... |

20 |
Automata theory for database theoreticians
- Vardi
- 1989
(Show Context)
Citation Context ...ata techniques for the special purpose of representing symbolic derivation trees of datalog programs. The importance of tree-automata techniques for decision problems of datalog programs was shown in =-=[Var89]-=-. Conceivably the results we present could be obtained by applying tree-automata techniques directly, but doing so would be considerably more intricate. 2 Satisfiability, Query-Reachability and Equiva... |

7 | The Complexity of Querying Indefinite Information: Defined Relations Recursion and Linear Order
- Meyden
- 1992
(Show Context)
Citation Context ...esults that follow from previous and new results by applying the Lemmas and Propositions of Section 2. Results that follow trivially from previously known results are shown in small teletype font. In =-=[vdM92]-=-, van der Meyden proved an undecidability result that implies the following. First, satisfiability is undecidable for datalog programs with unary IDB predicates, 6= and negation. Second, containment o... |