{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:17:43Z","timestamp":1720696663827},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0305-0548(94)90051-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"185-197","source":"Crossref","is-referenced-by-count":21,"title":["Generating logical expressions from positive and negative examples via a branch-and-bound approach"],"prefix":"10.1016","volume":"21","author":[{"given":"Evangelos","family":"Triantaphyllou","sequence":"first","affiliation":[]},{"given":"Allen L.","family":"Soyster","sequence":"additional","affiliation":[]},{"given":"Soundar R.T.","family":"Kumara","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90051-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. ACM"},{"key":"10.1016\/0305-0548(94)90051-5_BIB2","series-title":"Proc. 9th IJCAI","first-page":"560","article-title":"Learning disjunctions of conjunctives","author":"Valiant","year":"1986"},{"key":"10.1016\/0305-0548(94)90051-5_BIB3","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. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(94)90051-5_BIB4","first-page":"193","article-title":"Machine learning research in the artificial intelligence laboratory at Illinois","author":"Michalski","year":"1986"},{"key":"10.1016\/0305-0548(94)90051-5_BIB5","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(94)90051-5_BIB6","series-title":"Proceedings of the Fifth International Conference on Machine Learning","first-page":"395","article-title":"Learning systems of first-order rules","author":"Helft","year":"1988"},{"key":"10.1016\/0305-0548(94)90051-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(94)90051-5_BIB8","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(94)90051-5_BIB9","series-title":"Proceedings of the Fifth International Conference on Machine Learning","first-page":"107","article-title":"ID5: an incremental ID3","author":"Utgoff","year":"1988"},{"key":"10.1016\/0305-0548(94)90051-5_BIB10","first-page":"1","article-title":"Linear and Integer Programming Applied to Artificial Intelligence","author":"Williams","year":"1986"},{"key":"10.1016\/0305-0548(94)90051-5_BIB11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-9236(88)90128-5","article-title":"Computation-oriented reductions of predicate to propositional logic","volume":"4","author":"Jeroslow","year":"1988","journal-title":"Decis. supp. Syst."},{"key":"10.1016\/0305-0548(94)90051-5_BIB12","first-page":"217","article-title":"Generalized resolution and cutting planes","volume":"Vol. 12","author":"Hooker","year":"1988"},{"key":"10.1016\/0305-0548(94)90051-5_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(88)90044-2","article-title":"Resolution vs cutting plane solution of inference problems: some computational experience","volume":"7","author":"Hooker","year":"1988","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90051-5_BIB14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/0305-0548(90)90062-C","article-title":"Modeling and integer programming techniques applied to propositional calculus","volume":"17","author":"Cavalier","year":"1990","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90051-5_BIB15","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","volume":"27","author":"Kamath","year":"1991","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(94)90051-5_BIB16","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":"1986","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90051-5_BIB17","article-title":"A continuous approach to inductive inference","author":"Kamath","year":"1993","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90051-5_BIB18","article-title":"An interior point algorithm to solve computationally difficult set covering problems","author":"Karmakar","year":"1993","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(94)90051-5_BIB19","article-title":"A relationship between CNF and DNF systems derivable from examples","author":"Triantaphyllou","year":"1993","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(94)90051-5_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(81)90002-3","article-title":"Inductive learning of structural descriptions","volume":"16","author":"Dietterich","year":"1981","journal-title":"Artific. Intell."},{"key":"10.1016\/0305-0548(94)90051-5_BIB21","series-title":"On the minimum number of logical clauses which can be inferred from examples, working paper","author":"Triantaphyllou","year":"1992"},{"key":"10.1016\/0305-0548(94)90051-5_BIB22","series-title":"An approach to guided learning of Boolean functions, working paper","author":"Triantaphyllou","year":"1992"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:26:04Z","timestamp":1552929964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0305054894900515"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90051-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}