On the minimum number of logical clauses inferred from examples

[1]  Soundar R. T. Kumara,et al.  Generating logical expressions from positive and negative examples via a branch-and-bound approach , 1994, Comput. Oper. Res..

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

[3]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[4]  H. D. Sherali,et al.  Computational methods in global optimization: P.M. Pardalo and J.B. Rosen (eds.), (Annals of Operations Research, vol. 25, nos. 1–4, 1990) J.C. Baltzer Scientific Publ. Company, Basel, 1990, 302 pages , 1991 .

[5]  H. P. Williams.  Linear and integer programming applied to the propositional calculus , 1987 .

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

[7]  Gottfried Tinhofer,et al.  A branch and bound algorithm for the maximum clique problem , 1990, ZOR Methods Model. Oper. Res..

[8]  M. A. Wright,et al.  Case Study D , 1996 .

[9]  Paul E. Utgoff,et al.  ID5: An Incremental ID3 , 1987, ML Workshop.

[10]  John N. Hooker,et al.  A quantitative approach to logical inference , 1988, Decis. Support Syst..

[11]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[12]  John N. Hooker,et al.  Generalized resolution and cutting planes , 1988 .

[13]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[14]  Evangelos Triantaphyllou,et al.  A Relationship Between CNF and DNF Systems Derivable from Examples , 1995, INFORMS J. Comput..

[15]  Leslie G. Valiant,et al.  Learning Disjunction of Conjunctions , 1985, IJCAI.

[16]  Panos M. Pardalos,et al.  Modeling and integer programming techniques applied to propositional calculus , 1990, Comput. Oper. Res..

[17]  Thomas G. Dietterich,et al.  A Comparative Review of Selected Methods for Learning from Examples , 1983 .

[18]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[19]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[20]  Mauricio G. C. Resende,et al.  A continuous approach to inductive inference , 1992, Math. Program..

[21]  John R. Anderson,et al.  MACHINE LEARNING An Artificial Intelligence Approach , 2009 .

[22]  Evangelos Triantaphyllou.  Inference of a minimum size boolean function from examples by using a new efficient branch-and-bound approach , 1994, J. Glob. Optim..

[23]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[24]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[25]  Donald Michie,et al.  Expert systems in the micro-electronic age , 1979 .

[26]  Jaime G. Carbonell,et al.  An Overview of Machine Learning , 1983 .

[27]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[28]  Robert G. Jeroslow,et al.  Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[29]  Stephen D. Burd,et al.  Logic-based decision support for computer capacity planning , 1987, Inf. Manag..