A continuous approach to inductive inference

In this paper we describe an interior point mathematical programming approach to inductive inference. We list several versions of this problem and study in detail the formulation based on hidden Boolean logic. We consider the problem of identifying a hidden Boolean functionℱ:{0, 1}n → {0, 1} using outputs obtained by applying a limited number of random inputs to the hidden function. Given this input—output sample, we give a method to synthesize a Boolean function that describes the sample. We pose the Boolean Function Synthesis Problem as a particular type of Satisfiability Problem. The Satisfiability Problem is translated into an integer programming feasibility problem, that is solved with an interior point algorithm for integer programming. A similar integer programming implementation has been used in a previous study to solve randomly generated instances of the Satisfiability Problem. In this paper we introduce a new variant of this algorithm, where the Riemannian metric used for defining the search region is dynamically modified. Computational results on 8-, 16- and 32-input, 1-output functions are presented. Our implementation successfully identified the majority of hidden functions in the experiment.

[1]  Endre Boros,et al.  Predicting Cause-Effect Relationships from Incomplete Discrete Observations , 1994, SIAM J. Discret. Math..

[2]  Douglas W. Brown,et al.  A State-Machine Synthesizer -- SMS , 1981, 18th Design Automation Conference.

[3]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[4]  Mauricio G. C. Resende,et al.  An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..

[5]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[6]  Narendra Karmarkar,et al.  An Interior-Point Approach to NP-Complete Problems , 1990, Conference on Integer Programming and Combinatorial Optimization.

[7]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[8]  Raymond E Miller.  Switching theory , 1979 .

[9]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[10]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[11]  Y. Crama,et al.  Cause-effect relationships and partially defined Boolean functions , 1988 .

[12]  Eugenio Morreale,et al.  Recursive Operators for Prime Implicant and Irredundant Normal Form Determination , 1970, IEEE Transactions on Computers.

[13]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[14]  James F. Gimpel.  A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table , 1965, IEEE Trans. Electron. Comput..

[15]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[16]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.

[17]  Richard C. T. Lee,et al.  A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.