A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters.
Laurent FribourgHans OlsénPublished in: Constraints An Int. J. (1997)
Keyphrases
- fixed point
- datalog programs
- query answering
- approximate value iteration
- fixpoint
- dynamical systems
- conjunctive queries
- temporal difference learning
- recursive queries
- sufficient conditions
- linear logic
- asymptotic properties
- magic sets
- deductive databases
- belief propagation
- database systems
- graphical models
- dynamic programming