Abstract
One of the main areas of great potential in the interface of operations research and computer science is in inductive inference. Inductive inference refers to the extraction of a pattern from observations which belong to different classes. This is the essence of building many intelligent systems with learning capabilities. In this paper we discuss a logical analysis approach to this problem. Given are sets of binary vectors. The main problem is how to extract a Boolean function, in CNF or DNF form, with as few clauses (conjunctions or disjunctions) as possible. Therefore, this is an optimization problem. We present a number of theoretical results and also some possible extensions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angluin, D., 1988, “Queries and Concept learning,” Machine Learning, Vol. 2, pp. 319–342.
Angluin, D., 1992, “Computational Learning Theory: Survey and Selected Bibliography,” Proceedings of the 24-th Annual ACM Symposium on the Theory of Computing, Victoria, BC, Canada, May 4–6, pp. 351–369.
Alekseev, V.B., 1988, “Monotone Boolean Functions”. Encyclopedia of Mathematics, v. 6, Kluwer Academic Publishers, 306–307.
Boros, E., V. Gurvich, P.L. Hammer, T. Ibaraki, and A. Kogan, 1994, “Structural Analysis and Decomposition of Partially Defined Boolean Functions,” RRR 13-94, 25 pages, RUTCOR, Rutgers University, NJ.
Boros, E., P.L. Hammer, and J.N. Hooker, 1994, “Predicting Cause-Effect Relationships From Incomplete Discrete Observations,” SIAM J. on Discrete Math., Vol. 7, No. 4, pp. 531–543.
Blair, C.E., R.G. Jeroslow, and J.K. Lowe, 1985, “Some Results and Experiments in Programming Techniques for Propositional Logic,” Computers and Operations Research. No. 13, pp. 633–645.
Carraghan, R., and P.M. Pardalos, 1990, “An Exact Algorithm for the Maximum Clique Problem,” Operations Research Letters, 9, November, pp. 375–382.
Cavalier, T.M., P.M. Pardalos, and A.L. Soyster, 1990, “Modeling and Integer Programming Techniques Applied to Propositional Calculus,” J.P. Ignizio (ed.). Computers and Operations Research. 17:6, 561–570.
Deshpande, A.S., and E. Triantaphyllou, 1996, “A Randomized Polynomial Heuristic for Inferring A Small Number of Logical Clauses from Examples,” Mathematical and Computer Modelling, in print.
Feo, T.A. and M.G.C. Resende, 1995, “Greedy Randomized Adaptive Search Procedures,” Journal of Global Optimization, Vol. 6, pp. 109–133.
Fu, L.M., 1993, “Knowledge-based connectionism for revising domain theories,” IEEE Transactions on Systems, Man and Cybernetics, Vol. 23, No. 1, pp. 173–182.
Hammer, P.L., and E. Boros, 1994, “Logical Analysis: An Overview,” RUTCOR Research Report, Rutgers University, NJ.
Hammer, P.L., and A. Kogan, 1992, “Horn Function Minimization and Knowledge Compression in Production Rule Bases,” RUTCOR Research Report # 8 - 92, Rutgers University, NJ.
Hansel, G., 1966, “Sur le nombre des fonctions Boolenes monotones den variables”. C.R. Acad. Sci. Paris, v. 262, n. 20, 1088–1090.
Haussler, D. 1989, “Learning conjunctive concepts in structural domains,” Machine Learning, Vol. 4, pp. 7–40.
Haussler, D., and M. Warmuth, 1993, “The Probably Approximately Correct (PAC) and Other Learning Models,” Chapter in: Foundations of Knowledge Acquisition: Machine Learning, A.L. Meyrowitz and S. Chipman (Eds), Kluwer Academic Publishers, Norwell, MA, pp. 291–312.
Hooker, J.N., 1988a, “Generalized Resolution and Cutting Planes,” R.G. Jeroslow (ed.), Annals of Operations Research, Vol. 12, No. 1–4, pp. 217–239.
Hooker, J.N., 1988b, “A Quantitative Approach to Logical Inference,” Decision Support Systems. North-Holland, No. 4, pp. 45–69.
Gimpel, J., 1965, “A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table,” IEEE Trans. on Computers, Vol. 14, pp. 485–488.
Goldman, S.A., 1990, “Learning Binary Relations, Total Orders, and Real-Once Formulas.” Ph.D. Thesis, Massachusetts Institute of Technology, September 1990. Available as Technical Report MIT/LCS/TR-483, MIT Laboratory for Computer Science.
Gorbunov, Y. and B. Kovalerschuk, 1982, “An Interactive Algorithm For Restoring of a Monotone Boolean Function,” Izvestia AN USSR (Proceedings of the Acad, of Sci.), STN, 2, Tashkent, pp. 3–16, in Russian.
Jeroslow, R.G., 1988, “Computation-Oriented Reductions of Predicate to Prepositional Logic,” Decision Support Systems. North-Holland, No. 4, pp. 183–197.
Jeroslow, R.G., 1989, Logic-Based Decision Support, North-Holland.
Quinlan, J.R., “Discovering rules by induction from large collections of examples,” in Expert Systems in the Micro Electronic Age, D. Michie, Ed., Edinburgh, Scotland: Edinburgh University Press, 1979.
Kamath, A.P., N.K. Karmakar, K.G. Ramakrishnan, and M.G.C. Resende, 1990, “Computational Experience with an Interior Point Algorithm on the Satisfiability Problem,” Annals of Operations Research. P.M. Pardalos and J.B. Rosen (eds.). Special issue on: Computational Methods in Global Optimization, Vol 25, pp. 43–58.
Kamath, A.P., N.K. Karmakar, K.G. Ramakrishnan, and M.G.C. Resende, 1992, “A Continuous Approach to Inductive Inference,” Math. Progr., Vol. 57, pp. 215–238.
Kamath, A.P., N.K. Karmakar, K.G. Ramakrishnan, and M.G.C. Resende, 1994, “An Interior Point Approach to Boolean Vector Synthesis,” Proceedings of the 36th MSCAS, pp. 1–5.
Karmakar, N.K., M.G.C. Resende, and K.G. Ramakrishnan, 1991, “An Interior Point Algorithm to Solve Computationally Difficult Set Covering Problems,” Math. Progr., Vol. 52, pp. 597–618.
Kleitman, D., 1969, “On Dedekind’s problem: the number of monotone Boolean functions”. Proc. Amer. Math. Soc. 21, 677–682.
Kleitman, D., 1969, “On Dedekind’s problem: the number of monotone Boolean functions”. Proc. Amer. Math. Soc. 21, 677–682.
Kearns, M., Ming Li, L. Pitt, and L.G. Valiant, 1987, “On The Learnability of Boolean Formulae,” Journal of the Association for Computing Machinery, No. 9, pp. 285–295.
Kovalerchuk, B, E. Triantaphyllou, and E. Vityaev, 1995, “Monotone Boolean Function Learning Techniques Integrated with User Interaction,” Proceedings of the 12-th Inter’1 Conference in Machine Learning, Lake Tahoe, CA, U.S.A., July 9–12, pp. 41–48.
Kovalerchuk, B., E. Triantaphyllou, A.S. Deshpande, and E. Vityaev, 1996, “Interactive Learning of Monotone Boolean Functions,” Information Sciences, 20 pages, (in print).
McCluskey, E., 1956, “Minimization of Boolean Functions,” Bell Syst. Tech. J., Vol. 35, pp. 1417–1444.
Mangasarian, O.L., R. Setiono, and W.H. Wolberg, 1991, “Pattern Recognition Via Linear Programming: Theory and Application to Medical Diagnosis,” in: Large-Scale Numerical Optimization, Eds. T.F. Coleman, and Y. Li, SIAM, pp. 22–30.
Mansour, Y., 1992, “Learning of DNF Formulas”, Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 53–59.
Motwani, R. and P. Raghavan, 1995, Randomized Algorithms, Cambridge University Press, New York, NY, USA.
Murphy and D.W. Aha, 1994, UCI Repository of Machine Learning Databases, Machine readable data repository, Irvine, CA, University of California, Dept. of Information and Computer Science.
Pardalos, P.M., and C.S. Rentala,1990, “Computational Aspects of a Parallel Algorithm to Find the Connected Components of a Graph,” Technical Report, Dept. of Computer Science, Pennsylvania State University.
Peysakh, J., 1987, “A Fast Algorithm to Convert Boolean Expressions into CNF,” IBM Computer Science RC 12913 (#57971), Watson, NY.
Pitt, L. and L.G. Valiant, 1988, “Computational Limitations on Learning from Examples,” Journal of the Association for Computing Machinery. Vol. 35, No. 4, pp. 965–984.
Rudeanu, S., 1974, Boolean Functions and Equations, North-Holland, NY.
Shavlik, J.W., 1994, “Combining Symbolic and Neural Learning,” Machine Learning, Vol. 14, pp. 321–331.
Triantaphyllou, E, A.L. Soyster, and S.R.T. Kumara, 1994, “Generating Logical Expressions from Positive and Negative Examples via a Branch-And-Bound Approach,” Computers and Operations Research, Vol. 21, No. 2, pp. 185–197.
Triantaphyllou, E., 1994, “Inference of A Minimum Size Boolean Function From Examples by Using A New Efficient Branch-And-Bound Approach,” Journal of Global Optimization, Vol. 5, No. 1, pp. 69–94.
Triantaphyllou, E. and A.L. Soyster,1995, “An Important Relationship Between CNF and DNF Systems Which are Derived from Examples,” ORSA Journal on Computing, Vol. 7, No. 3, pp. 283–285.
Triantaphyllou, E. and A.L. Soyster, 1996a, “On the Minimum Number of Logical Clauses Which Can be Inferred From Positive and Negative Examples,” Computers and Operations Research, Vol. 23, No. 8, pp. 783–799.
Triantaphyllou, E. and A.L. Soyster, 1996b, “An Approach to Guided Learning of Boolean Functions,” Computers and Mathematical Modelling, Vol. 23, No. 3, pp. 69–86.
Trick, M. and D. Johnson, 1995, “Second DIAMACS Challenge on Cliques, Coloring and Satisfiability,” American Mathematical Society, Rutgers University, Summer.
Turksen, I.B., and H. Zhao, “An Equivalence Between Inductive Learning and Pseudo-Boolean Logic Simplification: A Rule Generation and Reduction Scheme,” IEEE Transactions on Systems, Man and Cybernetics, Vol. 23, No. 3, pp. 907–917, 1993.
Valiant, L.G., 1984, “A Theory of the Learnable,” Comm. of ACM, Vol. 27, No. 11, pp. 1134–1142.
Williams, H.P., 1986, “Linear and Integer Programming Applied to Artificial Intelligence,” Preprint series, University of Southampton, Faculty of Mathematical Studies, pp. 1–33.
Yablonskii, S., 1986, Introduction to Discrete Mathematics, Moscow, Nauka Publ. (in Russian).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Triantaphyllou, E., Kovalerchuk, B., Deshpande, A.S. (1997). Some Recent Developments of Using Logical Analysis for Inferring a Boolean Function with Few Clauses. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds) Interfaces in Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4102-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4102-8_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6837-3
Online ISBN: 978-1-4615-4102-8
eBook Packages: Springer Book Archive