A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Mathematical and Computer Modelling

Volumn 27, Issue 1, 1998, Pages 75-99

  Deshpande, A S ^a   Triantaphyllou, E ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Boolean functions; Clause satisfiability problem; CNF DNF form; GRASP; Inductive inference; Learning from examples; Logical analysis; Randomized algorithms

Indexed keywords

EID: 0031931829     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00255-0     Document Type: Article

References (29)

1. 1. A.P. Kamath, N. Karmarker, K.G. Ramakrishnan and M.G.C. Resende, A continuous approach to inductive inference, Math. Programming 57 (2), 215-238 (1992).
2. 2. A.P. Kamath, N. Karmarker, K.G. Ramakrishnan and M.G.C. Resende, An interior point approach to Boolean vector function synthesis, In Proceedings of the 36th MSCAS, 1-5, (1994).
3. 3. E. Triantaphyllou, A.L. Soyster and S.R.T. Kumara, Generating logical expressions from positive and negative examples via a branch-and bound approach, Computers and Operations Research 21 (2), 185-197 (1994).
4. 4. E. Triantaphyllou, Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, Journal of Global Optimization 5, 69-94 (1994).
5. 5. E. Boros, Dualization of aligned Boolean functions, RUTCOR Reserach Report RRR, Rutgers University, pp. 9-94 (1994).
6. 6. E. Boros, V. Gurvich, P.L. Hammer, T. Ibaraki and A. Kogan, Structural analysis and decomposition of partially defined Boolean functions, RUTCOR Research Report RRR, Rutgers University, 13-94 (1994).
7. 7. W.H. Wolberg and O.L. Mangasarian, Multisurface method of pattern separation for medical diagnosis applied to breast cytology, In Proceedings of the National Academy of Sciences of the USA 87 (23), 9193-9196 (1990).
8. 8. O.L. Mangasarian, R. Setiono and W.H. Wolberg, Pattern recognition via linear programming: Theory and application to medical diagnosis, In Large Scale Numerical Optimization, pp. 22-31 (1990), Philadelphia, PA; In SIAM Proceedings of the Workshop on Large-Scale Numerical Optimization, October 19-20, 1989, Cornell University, Ithaca, NY.
9. 8. O.L. Mangasarian, R. Setiono and W.H. Wolberg, Pattern recognition via linear programming: Theory and application to medical diagnosis, In Large Scale Numerical Optimization, pp. 22-31 (1990), Philadelphia, PA; In SIAM Proceedings of the Workshop on Large-Scale Numerical Optimization, October 19-20, 1989, Cornell University, Ithaca, NY.
10. 9. O.L. Mangasarian, Mathematical programming in neural networks, ORSA Journal on Computing 5 (4), 349-360 (1993).
11. 10. J.W. Shavlik, Combining symbolic and neural learning, Machine Learning 14, 321-331 (1994).
12. 11. L.M. Fu, Knowledge-based connectionism for revising domain theories, IEEE Transactions on Systems, Man and Cybernetics 23 (1), 173-182 (1993).
13. 12. S.A. Goldman and R.H. Sloan, The power of self directed learning, Machine Learning 14, 271-294 (1994).
14. 13. D. Cohn, L. Atlas and R. Ladner, Improving generalizing with active learning, Machine Learning 15, 201-221 (1994).
15. 14. K. Hattori and Y. Torri, Effective algorithms for the nearest neighbor method in the clustering problem, Pattern Recognization 26 (5), 741-746 (1993).
16. 15. T. Kurita, An efficient agglomerative clustering algorithm using a heap, Pattern Recognization 24 (3), 205-209 (1991).
17. 16. B. Kamgar-Parsi and L.N. Kanal, An improved branch and bound algorithm for computing k-nearest neighbors, Pattern Recognition Letters 3, 7-12 (1985).
18. 17. S.I. Gallant, Connectionist expert systems, Communications of the ACM 31, 152-169 (1988).
19. 18. L.M. Fu, Rule learning by searching on adapted nets, In Proceeedings of The Ninth National Conference on Artificial Intelligence, Anaheim, CA: AAAI Press, pp. 590-595, (1991).
20. 19. G.G. Towell and J.W. Shavlik, Extracting refined rules from knowledge-based neural networks, Machine Learning 13, 71-101 (1993).
21. 20. J. Peysakh, A Fast Algorithm to Convert Boolean Expressions into CNF, IBM Computer Science RC 12913 (#57971), Watson, NY, (1987).
22. 21. E. Triantaphyllou and A.L. Soyster, A relationship between CNF and DNF systems derivable from examples, ORSA Journal on Computing 7 (3), 283-285 (1995).
23. 22. A.V. Aho, J.E. Hopcraft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, (1974).
24. 23. T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization 6, 109-133 (1995).
25. 24. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, (1995).
26. 25. N.H. Bshouty, S.A. Goldman, T.R. Hancock and S. Matar, Asking questions to minimize errors, In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pp. 41-50, (1993).
27. 26. E. Triantaphyllou and A.L. Soyster, An approach to guided learning of Boolean functions, Math. Comput. Modelling 23 (3), 69-86 (1995).
28. 27. P.M. Murphy and D.W. Aha, UCI repository of machine learning databases, Machine Readable Data Repository, University of California, Dept. of Information and Computer Science, Irvine, CA (1994).
29. 28. M.G.C. Resende and T.A. Feo, A GRASP for MAX-SAT, TIMS/ORSA National Meeting in Boston, MA, USA (1994).