Implementing deductive databases by mixed integer programming

Existing and past generations of Prolog compilers have left deduction to run-time and this may account for the poor run-time performance of existing Prolog systems. Our work tries to minimize run-time deduction by shifting the deductive process to compile-time. In addition, we offer an alternative inferencing procedure based on translating logic to mixed integer programming. This makes available for research and implementation in deductive databases, all the theorems, algorithms, and software packages developed by the operations research community over the past 50 years. The method keeps the same query language as for disjunctive deductive databases, only the inferencing procedure changes. The language is purely declarative, independent of the order of rules in the program, and independent of the order in which literals occur in clause bodies, The technique avoids Prolog's problem of infinite looping. It saves run-time by doing primary inferencing at compile-time. Furthermore, it is incremental in nature. The first half of this article translates disjunctive clauses, integrity constraints, and database facts into Boolean equations, and develops procedures to use mixed integer programming methods to compute least models of definite deductive databases, and minimal models and the Generalized Closed World Assumption of disjunctive deductive databases. These procedures are sound and complete. The second half of the article proposes a query processing system based on mixed integer programming compilation, and describes our (implemented) prototype compiler. Experimental results using this compiler are reported. These results suggest that our compilation-based mixed integer programming paradigm is a promising approach to practical implementation of query systems for definition and disjunctive databases.