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 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.
Research partially sponsored by NSERC Grants OGP0138055 and STR0134419, and NCE IRIS Grants IC-5 and HMI-5. Proofs of all the lemmas and theorems presented in this paper are contained in [11].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman. (1986) Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. ACM-PODS, pp 1–15.
C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian. (1992) Implementing Deductive Databases by Linear Programming, Proc. ACM-PODS, pp 283–291.
C. Bell, A. Nerode, R. Ng and V.S. Subrahmanian. (1992) Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases, to appear in: Journal of ACM.
V. Chandru and J. Hooker. (1991) Extended Horn Sets in Propositional Logic, Journal of the ACM, 38, 1, pp 205–221.
M. Gelfond and V. Lifschitz. (1988) The Stable Model Semantics for Logic Programming, in: Proc. 5th International Conference and Symposium on Logic Programming, ed R. A. Kowalski and K. A. Bowen, pp 1070–1080.
R. E. Jeroslow. (1988) Computation-Oriented Reductions of Predicate to Propositional Logic, Decision Support Systems, 4, pps 183–187.
V.Kagan, A. Nerode and V.S. Subrahmanian (1993) Computing Definite Logic Programs by Partial Instantiation, to appear in: Annals of Pure and Applied Logic.
V.Kagan, A. Nerode and V.S. Subrahmanian (1994) Computing Minimal Models by Partial Instantiation, draft manuscript, submitted to a technical journal for publication.
J. Lobo, J. Minker and A. Rajasekar. (1992) Foundations of Disjunctive Logic Programming, MIT Press.
A. Martelli and U. Montanari. (1982) An Efficient Unification Algorithm, ACM Trans. on Programming Languages and Systems, 4, 2, pp 258–282.
X. Tian. (1994) Optimizations for Model Computation Based on Partial Instantiation, MSc Thesis, University of British Columbia.
A. van Gelder, K. Ross and J. Schlipf. (1988) Unfounded Sets and Well-founded Semantics for General Logic Programs, in Proc. ACM-PODS, pp 221–230.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, R.T., Tian, X. (1995). Incremental methods for optimizing partial instantiation. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59487-1
Online ISBN: 978-3-540-49282-5
eBook Packages: Springer Book Archive