{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:22Z","timestamp":1759847182783},"reference-count":36,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0305-0548(95)00075-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:00:05Z","timestamp":1027638005000},"page":"783-799","source":"Crossref","is-referenced-by-count":17,"title":["On the minimum number of logical clauses inferred from examples"],"prefix":"10.1016","volume":"23","author":[{"given":"Evangelos","family":"Triantaphyllou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allen L.","family":"Soyster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00075-5_BIB1","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. of ACM"},{"key":"10.1016\/0305-0548(95)00075-5_BIB2","first-page":"560","article-title":"Learning disjunctions of conjunctives","author":"Valiant","year":"1985"},{"key":"10.1016\/0305-0548(95)00075-5_BIB3","first-page":"285","article-title":"On the learnability of Boolean formulae","volume":"34","author":"Kearns","year":"1987","journal-title":"J. Assoc. Computng Mach."},{"key":"10.1016\/0305-0548(95)00075-5_BIB4","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"J. Assoc. Computng Mach."},{"key":"10.1016\/0305-0548(95)00075-5_BIB5","series-title":"Machine Learning: An Artificial Intelligence Approach","first-page":"3","article-title":"An overview of machine learning from examples","author":"Carbonell","year":"1983"},{"key":"10.1016\/0305-0548(95)00075-5_BIB6","series-title":"Machine Learning: An Artificial Intelligence Approach","first-page":"41","article-title":"A comparative review of selected methods for learning from examples","author":"Dietterich","year":"1983"},{"key":"10.1016\/0305-0548(95)00075-5_BIB7","series-title":"Expert Systems in the Micro-Electronic Age","article-title":"Discovering rules by induction from large numbers of examples: a case study","author":"Quinlan","year":"1979"},{"key":"10.1016\/0305-0548(95)00075-5_BIB8","series-title":"Machine Learning: An Artificial Intelligence Approach","first-page":"3","article-title":"Learning efficient classification procedures and their application to chess and games","author":"Quinlan","year":"1983"},{"key":"10.1016\/0305-0548(95)00075-5_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Learn."},{"key":"10.1016\/0305-0548(95)00075-5_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0305-0548(94)90051-5","article-title":"Generating logical expressions from positive and negative examples via a branch-and-bound approach","volume":"21","author":"Triantaphyllou","year":"1994","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(95)00075-5_BIB11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01097004","article-title":"Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach","volume":"5","author":"Triantaphyllou","year":"1994","journal-title":"J. Glob. Optimiz."},{"key":"10.1016\/0305-0548(95)00075-5_BIB12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01581082","article-title":"A continuous approach to inductive inference","volume":"57","author":"Kamath","year":"1992","journal-title":"Math. Progm."},{"key":"10.1016\/0305-0548(95)00075-5_BIB13","series-title":"Proc. 5th Int. Conf. on Machine Learning","first-page":"107","article-title":"ID5: an incremental ID3","author":"Utgoff","year":"1988"},{"key":"10.1016\/0305-0548(95)00075-5_BIB14","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0305-0548(86)90056-0","article-title":"Some results and experiments in programming techniques for propositional logic","volume":"13","author":"Blair","year":"1985","journal-title":"Comput. Ops Res."},{"key":"10.1016\/0305-0548(95)00075-5_BIB15","first-page":"561","article-title":"Modeling and integer programming techniques applied to propositional calculus","volume":"17","author":"Cavalier","year":"1990"},{"key":"10.1016\/0305-0548(95)00075-5_BIB16","first-page":"217","article-title":"Generalized resolution and cutting planes","volume":"12","author":"Hooker","year":"1988"},{"key":"10.1016\/0305-0548(95)00075-5_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","article-title":"A quantitative approach to logical inference","volume":"4","author":"Hooker","year":"1988","journal-title":"Dec. Supp. Syst."},{"key":"10.1016\/0305-0548(95)00075-5_BIB18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-9236(88)90128-5","article-title":"Computation-oriented reductions of predicate to prepositional Logic","volume":"4","author":"Jeroslow","year":"1988","journal-title":"Dec. Supp. Syst."},{"key":"10.1016\/0305-0548(95)00075-5_BIB19","series-title":"Logic-Based Decision Support","author":"Jeroslow","year":"1989"},{"key":"10.1016\/0305-0548(95)00075-5_BIB20","series-title":"Annals of Operations Research","first-page":"43","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","volume":"25","author":"Kamath","year":"1990"},{"key":"10.1016\/0305-0548(95)00075-5_BIB21","first-page":"1","article-title":"Linear and integer programming applied to artificial intelligence","author":"Williams","year":"1986"},{"key":"10.1016\/0305-0548(95)00075-5_BIB22","first-page":"81","article-title":"Linear and integer programming applied to the propositional calculus","volume":"2","author":"Williams","year":"1987","journal-title":"Int. J. Syst. Res. Inf. Sci."},{"key":"10.1016\/0305-0548(95)00075-5_BIB23","article-title":"A fast algorithm to convert Boolean expressions into CNF","author":"Peysakh","year":"1987","journal-title":"IBM Computer Science RC 12913 (No. 57971)"},{"key":"10.1016\/0305-0548(95)00075-5_BIB24","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/ijoc.7.3.283","article-title":"A relationship between CNF and DNF systems which are derived from the same positive and negative examples","volume":"7","author":"Triantaphyllou","year":"1995","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(95)00075-5_BIB25","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0305-0548(95)00075-5_BIB26","series-title":"Graph Theory, An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0305-0548(95)00075-5_BIB27","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","article-title":"An exact algorithm for the maximum clique problem","volume":"9","author":"Carraghan","year":"1990","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(95)00075-5_BIB28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The Maximum Clique Problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"J. Glob. Optimiz."},{"key":"10.1016\/0305-0548(95)00075-5_BIB29","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"34","author":"Babel","year":"1990","journal-title":"Meth. Models Ops Res."},{"key":"10.1016\/0305-0548(95)00075-5_BIB30","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","article-title":"Finding maximum cliques in arbitrary and in special graphs","volume":"46","author":"Babel","year":"1991","journal-title":"Computing"},{"key":"10.1016\/0305-0548(95)00075-5_BIB31","article-title":"A fast algorithm for the maximum weight clique problem","author":"Babel","year":"1996","journal-title":"Computing"},{"key":"10.1016\/0305-0548(95)00075-5_BIB32","doi-asserted-by":"crossref","DOI":"10.21236\/ADA275328","article-title":"Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring","author":"Balas","year":"1993"},{"key":"10.1016\/0305-0548(95)00075-5_BIB33","article-title":"Finding large cliques by bipartite matching","author":"Balas","year":"1994"},{"key":"10.1016\/0305-0548(95)00075-5_BIB34","article-title":"Computational aspects of a parallel algorithm to find the connected components of a graph","author":"Pardalos","year":"1990"},{"key":"10.1016\/0305-0548(95)00075-5_BIB35","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","article-title":"An interior point algorithm to solve computationally difficult set covering problems","volume":"52","author":"Karmakar","year":"1991","journal-title":"Math. Progm."},{"key":"10.1016\/0305-0548(95)00075-5_BIB36","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","article-title":"A branch and bound algorithm for the Maximum Clique Problem","volume":"19","author":"Pardalos","year":"1992","journal-title":"Comput. Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000755?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000755?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:20:33Z","timestamp":1555190433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0305054895000755"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00075-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}