ACID-Unification Is NEXPTIME-Decidable.
Siva AnantharamanPaliath NarendranMichaël RusinowitchPublished in: MFCS (2003)
Keyphrases
- datalog programs
- function symbols
- satisfiability problem
- fixpoint
- higher order
- logic programs
- first order logic
- query answering
- equational theories
- deductive databases
- answer set programming
- theorem prover
- theorem proving
- conjunctive queries
- upper bound
- data sets
- data complexity
- knuth bendix
- horn clauses
- np complete
- polynomial hierarchy
- answer sets
- transitive closure
- stable models
- logic programming
- databases