Deductive Databases with Universally Quantified Conditions.
Weiling LiRajshekhar SunderramanPublished in: SBBD (Short Papers) (2011)
Keyphrases
- deductive databases
- universally quantified
- integrity constraints
- logic programming
- disjunctive deductive databases
- fixpoint
- query evaluation
- closed world assumption
- integrity checking
- existentially quantified
- semantic query optimization
- model theoretic
- situation calculus
- fixpoint semantics
- logic programs
- database systems
- database
- query answering
- high level