Abstract
This paper shows that the basis matrix inverse of the linear program associated with a propositional Horn clause knowledge base provides a proof structure of inference by forward chaining. The basis matrix inverse indicates how each assertion determines the others and is itself determined by the others. This tabulated proof structure provides a convenient way of making inference transparent and flexible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bazaraa, M. and Jarvis, J.,Linear Programming and Network Flows, Wiley, New York (1977).
Bell, C., Nerode, A., Ng, R. T. and Subrahmanian V. S., ‘Computation and implementation of non-monotonic deductive databases’,Technical Report 91-67, Mathematical Sciences Institute, Cornell University, Ithaca, N.Y. (1991).
Bell, C., Nerode, A., Ng, R. T. and Subrahmanian, V. S., ‘Implementing deductive databases by linear programming’,Proceedings of 1992 ACM SIGMOD/SIGACT/SIGART Symp. on Principles of Database Systems, pp. 283–292 (1992).
Colmerauer, A., ‘An introduction to Prolog III’,Comm. ACM 33(7), 69–91 (1990).
Chandru, V. and Hooker, J. N., ‘Logical inference: a mathematical programming perspective’,Working paper. School of Industrial Engineering, Purdue University, West Lafayette, Indiana (1988).
Dantzig, G. B.,Programming in a Linear Structure, Comptroller, United States Air Force, Washington, D.C. (February 1948).
Dantzig, G. B.,Linear Programming and Extensions, Princeton University Press (1963).
Davis, M. and Putnam, H., ‘A computing procedure for quantification theory’,J. ACM 7, 201–215 (1960).
Dowling, W. F. and Gallier, J. H., ‘Linear time algorithms for testing the satisfiability of Horn formulae’,J. Logic Programming 3, 267–284.
Gallaire, H., Miniker, J. and Nicolas, J.-M., ‘Logic and databases: a deductive approach’,Computing Surveys 16(2) (1984).
Hooker, J. N., ‘A quantitative approach to logical inference’,Decision Support Systems 4, 45–69 (1988).
Harche, F., Hooker, J. N. and Thompson, G. L., ‘A computational study of satisfiability algorithms for propositional logic’,Working paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Penn.
Jaffar, J. and Lassez, J.-L., ‘Constraint logic programming’,Proceedings of ACM Symp. on Principles of Programming Languages, pp. 111–119 (1987).
Jaffar, J., Michaylov, S., Stuckey, P. J. and Yap, R. H. C., ‘The CLP(R) language and system’,ACM Transactions on Programming Languages and Systems 14(3), 339–395 (1992).
Jaumard, B., Hansen, P. and Poggi De Aragao, M., ‘Column generation methods for probabilistic logic’,ORSA J. Computing 3(2), 135–148 (1991).
Jeroslow, R. G., ‘Representability in mixed integer programming’,Research Report, College of Management, Georgia Institute of Technology, Atlanta, Georgia (1984).
Jeroslow, R. G., ‘Ten lectures on mixed integer model formulation for logic-based decision support’,Research Report, College of Management, Georgia Institute of Technology, Atlanta, Georgia (1986).
Jertoslow, R. G. and Lowe, J. K., ‘Experimental results on the new techniques for integer programming formulations’,J. Operational Research Soc. 36, 393–403 (1985).
Jeroslow, R. G., Martin, R. K., Rardin, R. L. and Wang, J., ‘Gainfree Leontief flow problems’, to appear inMathematical Programming.
Jeroslow, R. G. and Wang, J., ‘Dynamic programming, integral polyhedra and Horn clause knowledge bases’,ORSA J. Computing 1, 7–19 (1989).
Jeroslow, R. G. and Wang, J., ‘Solving propositional satisfiability problems’,Ann. Math. and Artificial Intelligence 1, 167–187 (1990).
Kanellakis, P. C., Kuper, G. M. and Revesz, P. Z., ‘Constraint query languages’,Proceedings of 1990 ACM SIGMOD/SIGACT/SIGART Symp. on Principles of Database Systems, pp. 299–313.
Mittereiter, I. and Radermacher, F. J., ‘Some notes on experiments on the running time behavior of some algorithms solving propositional logical problems’,Working paper, FAW, Research Institute for Applied Knowledge Processing, P.O. Box 2060, D-7900 Ulm, Germany (1991).
Nerode, A., Ng, R. T. and Subrahmanian, V. S., ‘Computing circumscriptive deductive databases’,Technical Report 91-66, Mathematical Science Institute, Cornell University, Ithaca, N.Y. (1991).
Plaisted, David A., ‘Complete problems in the first-order predicate calculus’,J. Computer and System Science 29, 8–35 (1984).
Vardi, M., ‘The complexity of relational query languages’,Proceedings of the 14th ACM Symp. on Theory of Computing, pp. 137–146 (1982).
Veinott, A. F., Jr., ‘Extreme points of Leontief substitution systems’,Linear Algebra and its Applications 1, 181–194 (1968).
Wang, J., ‘Rule-based expert systems and discrete optimization’, Doctoral dissertation, Georgia Institute of Technology, Atlanta, Georgia (1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, J. Inference flexibility in Horn clause knowledge bases and the simplex method. J Autom Reasoning 11, 269–288 (1993). https://doi.org/10.1007/BF00881908
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00881908