We describe in this paper a bottom-up evaluation process for Datalog programs (or logic programs) whose variables are interpreted as integers. Our initial ...
We describe in this paper a bottom-up evaluation process for Datalog pro- grams (or logic programs) whose variables are interpreted as integers. Our initial.
May 30, 2005 · We show that the least fixpoint associated with a program of this class is a linear arithmetic formula that can be generated by a refined ...
Contents. CADE-12: Proceedings of the 12th International Conference on Automated Deduction. Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints.
Bibliographic details on Bottom-Up Evaluation of Datalog Programs with Incremental Arguments and Linear Arithmetic Constraints.
We show how to optimize the bottom-up evaluation of queries for such programs using transformations based on analysis obtained using abstract interpretation.
Marcos Veloso Peixoto's 5 research works with 27 citations, including: Bottom-up evaluation of Datalog programs with arithmetic constraints.
Precise complexity analysis for efficient datalog queries Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up ...
Missing: Arithmetic | Show results with:Arithmetic
This paper proposes an e cient method for evaluating queries over constraint databases. The method is based on a combination of top-down resolution with.
We present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show that it is sound, complete, and terminating for finite-answer ...
Missing: Arithmetic | Show results with:Arithmetic