A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
Hing LeungDesh RanjanHéctor J. HernándezD. T. TangAgustin GonzálezPublished in: Inf. Process. Lett. (1995)
Keyphrases
- datalog programs
- query answering
- magic sets
- conjunctive queries
- deductive databases
- recursive queries
- fixpoint
- data complexity
- inconsistent databases
- query containment
- fixpoint semantics
- decision procedures
- incomplete information
- integrity constraints
- data exchange
- data integration
- description logics
- np complete
- logic programs
- databases
- data sets