Incremental Algorithms for Optimizing Model Computation Based on Partial Instantiation

Abstract It has been shown that mixed integer programming methods can effectively support minimal model, stable model and well-founded model semantics for ground deductive databases. Recently, a novel approach called partial instantiation has been developed which, when integrated with mixed integer programming methods, can handle non-ground logic programs. The goal of this paper is to explore how this integrated framework based on partial instantiation can be optimized. In particular, we develop an incremental algorithm that minimizes repetitive computations. We also develop several optimization techniques to further enhance the efficiency of our incremental algorithm. Experimental results indicate that our algorithm and optimization techniques can bring about very significant improvement in run-time performance.

[1]  S BoyerRoger,et al.  Ttle sharing of structure in theorem proving programs , 1972 .

[2]  H. K. Buning,et al.  Optimizing propositional calculus formulas with regard to questions of deducibility , 1989 .

[3]  Robert G. Jeroslow,et al.  Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[4]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[5]  Anil Nerode,et al.  Computing Minimal Models by Partial Instantiation , 1996, Theor. Comput. Sci..

[6]  Salvatore J. Stolfo,et al.  Incremental evaluation of rules and its relationship to parallelism , 1991, SIGMOD '91.

[7]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[8]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[9]  John V. Harrison,et al.  Maintenance of Materialized Views in a Deductive Database: An Update Propagation Approach , 1992, Workshop on Deductive Databases, JICSLP.

[10]  G. Levi,et al.  Computing Definite Logic Programs by Partial Instantiation , 1994 .

[11]  Anil Nerode,et al.  Mixed integer programming methods for computing nonmonotonic deductive databases , 1994, JACM.

[12]  Carlo Zaniolo,et al.  Design and Implementation of a Logic Based Language for Data Intensive Applications , 1988, ICLP/SLP.

[13]  John N. Hooker,et al.  Extended Horn sets in propositional logic , 1991, JACM.

[14]  Anil Nerode,et al.  Computing Definite Logic Programs by Partial Instantiation , 1994, Ann. Pure Appl. Log..

[15]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[16]  Frank Wm. Tompa,et al.  Efficiently updating materialized views , 1986, SIGMOD '86.

[17]  Per-Åke Larson,et al.  Updating derived relations: detecting irrelevant and autonomously computable updates , 1986, VLDB.

[18]  Inderpal Singh Mumick,et al.  Deriving Production Rules For Incremental View Maintenance , 1999 .

[19]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[20]  V. S. Subrahmanian,et al.  Maintaining views incrementally , 1993, SIGMOD Conference.

[21]  Anil Nerode,et al.  Implementing deductive databases by linear programming , 1992, PODS.

[22]  Alon Itai,et al.  Maintenance of views , 1984, SIGMOD '84.

[23]  Guozhu Dong,et al.  Incremental Evaluation of Datalog Queries , 1992, ICDT.