On the minimum number of logical clauses inferred from examples

Computers and Operations Research

Volumn 23, Issue 8, 1996, Pages 783-799

  Triantaphyllou, Evangelos ^a   Soyster, Allen L ^b  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY; LARGE SCALE SYSTEMS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

INDUCTIVE INFERENCE PROBLEMS; LOGICAL CLAUSES;

LEARNING SYSTEMS;

EID: 0030212491     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00075-5     Document Type: Article

References (36)

1. L. G. Valiant, A theory of the learnable. Comm. of ACM 27, 1134-1142 (1984).
2. L. G. Valiant, Learning disjunctions of conjunctives, Proc. of the 9th IJCAI, pp. 560-566 (1985).
3. M. Kearns, Ming Li, L. Pitt and L.G. Valiant, On the learnability of Boolean formulae. J. Assoc. Computng Mach., 34, 285-295 (1987).
4. L. Pitt and L. G. Valiant, Computational limitations on learning from examples. J. Assoc. Computng Mach. 35, 965-984 (1988).
5. J. G. Carbonell, R. S. Michalski and T. M. Mitchell, An overview of machine learning from examples. In R. S. Michalski, J. G. Carbonell and T.M. Mitchell (Eds), Machine Learning: An Artificial Intelligence Approach, pp.3-23. Tioga Publishing Company, Palo Alto, CA (1983).
6. T. C. Dietterich and R. S. Michalski, A comparative review of selected methods for learning from examples. In R. S. Michalski, J. G. Carbonell and T. M. Mitchell (Eds), Machine Learning: An Artificial Intelligence Approach, pp. 41-81. Tioga Publishing Company, Palo Alto, CA (1983).
7. J. R. Quinlan, Discovering rules by induction from large numbers of examples: a case study. In D. Michie (Ed.) Expert Systems in the Micro-Electronic Age. Edinburgh University Press (1979).
8. J. R. Quinlan, Learning efficient classification procedures and their application to chess and games. In R.S. Michalski, J.G. Carbonell and T.M. Mitchell (Eds), Machine Learning: An Artificial Intelligence Approach, pp. 3-23. Tioga Publishing Company, Palo Alto, CA, (1983).
9. J. R. Quinlan, Induction of decision trees, Mach. Learn. 1, 81-106 (1986).
10. E. Triantaphyllou, A. L. Soyster and S. R. T. Kumara, Generating logical expressions from positive and negative examples via a branch-and-bound approach. Comput. Ops Res. 21, 185-197 (1994).
11. E. Triantaphyllou, Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, J. Glob. Optimiz. 5, 69-94 (1994).
12. A. P. Kamath, N. K. Karmakar, K. G. Ramakrishnan and M. G. C. Resende, A continuous approach to inductive inference, Math. Progm. 57, 215-238 (1992).
13. P. E. Utgoff, ID5: an incremental ID3, John Laird (Ed.). Proc. 5th Int. Conf. on Machine Learning, pp.107-120. University of Michigan, Ann Arbor (1988).
14. C. E. Blair, R. G. Jeroslow and J. K. Lowe, Some results and experiments in programming techniques for propositional logic. Comput. Ops Res. 13, 633-645 (1985).
15. T. M. Cavalier, P. M. Pardalos and A. L. Soyster, Modeling and integer programming techniques applied to propositional calculus, J.P. Ignizio (Ed.). Comput. Ops Res. 17, 561-570 (1990).
16. J. N. Hooker, Generalized resolution and cutting planes, R.G. Jeroslow (Ed.). Ann. Ops Res. 12, 217-239 (1988).
17. J. N. Hooker, A quantitative approach to logical inference, Dec. Supp. Syst. 4, 45-69 (1988).
18. R. G. Jeroslow, Computation-oriented reductions of predicate to prepositional Logic. Dec. Supp. Syst. 4, 183-197 (1988).
19. R. G. Jeroslow, R. G., Logic-Based Decision Support. North-Holland, Amsterdam (1989).
20. A. P. Kamath, N. K. Karmakar, K. G. Ramakrishnan and M. G. C. Resende, 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, 25, 43-58 (1990).
21. H. P. Williams, Linear and integer programming applied to artificial intelligence, (Preprint Series), pp. 1-33. Faculty of Mathematical Studies, University of Southampton (1986).
22. H. P. Williams, Linear and integer programming applied to the propositional calculus. Int. J. Syst. Res. Inf. Sci. 2, 81-100 (1987).
23. J. Peysakh, A fast algorithm to convert Boolean expressions into CNF. IBM Computer Science RC 12913 (No. 57971), Watson, NY (1987).
24. E. Triantaphyllou and A. L. Soyster, A relationship between CNF and DNF systems which are derived from the same positive and negative examples. ORSA J. Comput. 7, 283-285 (1995).
25. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York (1980).
26. B. Bollobás, Graph Theory, An Introductory Course. Springer, Berlin (1979).
27. R. Carraghan and P. M. Pardalos, An exact algorithm for the maximum clique problem, Ops Res. Lett. 9, 375-382 (1990).
28. P. M. Pardalos and J. Xue, The Maximum Clique Problem. J. Glob. Optimiz. 4, 301-328 (1994).
29. L. Babel and G. Tinhofer, A branch and bound algorithm for the maximum clique problem. Meth. Models Ops Res. 34, 207-217 (1990).
30. L. Babel, Finding maximum cliques in arbitrary and in special graphs. Computing 46, 321-341 (1991).
31. L. Babel, A fast algorithm for the maximum weight clique problem, Computing, to appear (1996).
32. E. Balas and J. Xue, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Management Science Research Report No. MSRR-590, Carnegie Mellon University, Pittsburgh (1993).
33. E. Balas and W. Niehaus, Finding large cliques by bipartite matching. Management Science Research Report No. MSRR-597, Carnegie Mellon University, Pittsburgh (1994).
34. P. M. Pardalos and C. S. Rentala, Computational aspects of a parallel algorithm to find the connected components of a graph. Technical Report, Department of Computer Science, Pennsylvania State University (1990).
35. N. K. Karmakar, M. G. C. Resende and K. G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Math. Progm. 52, 597-618 (1991).
36. P. M. Pardalos and G. P. Rogers, A branch and bound algorithm for the Maximum Clique Problem. Comput. Ops Res. 19, 363-375 (1992).