{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:03Z","timestamp":1759637643338},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1007\/bf01581082","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:15Z","timestamp":1114681935000},"page":"215-238","source":"Crossref","is-referenced-by-count":69,"title":["A continuous approach to inductive inference"],"prefix":"10.1007","volume":"57","author":[{"given":"Anil P.","family":"Kamath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra K.","family":"Karmarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C.H. Smith, \u201cInductive inference: Theory and methods,\u201dComputing Surveys 15 (1983) 237\u2013265.","journal-title":"Computing Surveys"},{"key":"CR2","volume-title":"Predicting cause-effect relationships from incomplete discrete observations","author":"E. Boros","year":"1991","unstructured":"E. Boros, P.L. Hammer and J.N. Hooker, \u201cPredicting cause-effect relationships from incomplete discrete observations,\u201d RUTCOR, Rutgers University (Piscataway, NJ, 1991)."},{"key":"CR3","volume-title":"Logic Minimization Algorithms for VLSI Minimization","author":"R.K. Brayton","year":"1985","unstructured":"R.K. Brayton, G.D. Hachtel, C.T. McMullen and A.L. Sangiovanni-Vincentelli,Logic Minimization Algorithms for VLSI Minimization (Kluwer Academic Publishers, Dordrecht, 1985)."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"D.W. Brown, \u201cA state-machine synthesizer-SMS,\u201d in:Proceedings of the 18th Design Automation Conference (1981) pp. 301\u2013304.","DOI":"10.1109\/DAC.1981.1585367"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02283750","volume":"16","author":"Y. Crama","year":"1988","unstructured":"Y. Crama, P.L. Hammer and T. Ibaraki, \u201cCause-effect relationships and partially defined Boolean functions,\u201dAnnals of Operations Research 16 (1988) 299\u2013325.","journal-title":"Annals of Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam, \u201cA computing procedure for quantification theory,\u201dJournal of the ACM 7 (1960) 201\u2013215.","journal-title":"Journal of the ACM"},{"key":"CR7","first-page":"485","volume":"14","author":"J.F. Gimpel","year":"1965","unstructured":"J.F. Gimpel, \u201cA method of producing a Boolean function having an arbitrarily prescribed prime implicant table,\u201dIEEE Transaction on Computers 14 (1965) 485\u2013488.","journal-title":"IEEE Transaction on Computers"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"S.J. Hong, R.G. Cain and D.L. Ostapko, \u201cMINI: A heuristic approach for logic minimization,\u201dIBM Journal of Research and Development (1974) 443\u2013458.","DOI":"10.1147\/rd.185.0443"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02283686","volume":"25","author":"A.P. Kamath","year":"1990","unstructured":"A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, \u201cComputational experience with an interior point algorithm on the Satisfiability problem,\u201dAnnals of Operations Research 25 (1990) 43\u201358.","journal-title":"Annals of Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/conm\/114\/1097880","volume":"114","author":"N. Karmarkar","year":"1990","unstructured":"N. Karmarkar, \u201cAn interior-point approach to NP-complete problems,\u201dContemporary Mathematics 114 (1990) 297\u2013308.","journal-title":"Contemporary Mathematics"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/conm\/114\/1097865","volume":"114","author":"N. Karmarkar","year":"1990","unstructured":"N. Karmarkar, \u201cRiemannian geometry underlying interior-point methods for linear programming,\u201dContemporary Mathematics 114 (1990) 51\u201375.","journal-title":"Contemporary Mathematics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N.K. Karmarkar","year":"1991","unstructured":"N.K. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, \u201cAn interior point algorithm to solve computationally difficult set covering problems,\u201dMathematical Programming 52 (1991) 597\u2013618.","journal-title":"Mathematical Programming"},{"key":"CR13","unstructured":"N.K. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, \u201cAn interior-point approach to the maximum independent set problem in dense random graphs,\u201d in:Proceedings of the XV Latin American Conference on Informatics (1989) pp. 241\u2013260."},{"key":"CR14","first-page":"417","volume":"351","author":"E.J. McCluskey","year":"1956","unstructured":"E.J. McCluskey, \u201cMinimization of Boolean functions,\u201dBell System Technical Journal 351 (1956) 417\u20131444.","journal-title":"Bell System Technical Journal"},{"key":"CR15","volume-title":"Switching Theory, Vol. 1: Combinatorial Circuits","author":"R.E. Miller","year":"1965","unstructured":"R.E. Miller,Switching Theory, Vol. 1: Combinatorial Circuits (Wiley, New York, 1965)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"J.J. Mor\u00e9 and D.C. Sorensen, \u201cComputing a trust region step,\u201dSIAM Journal on Scientific and Statistical Computing 4 (1983) 553\u2013572.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"E. Morreale, \u201cRecursive operators for prime implicant and irredundant normal form determination,\u201dIEEE Transactions on Computers C-19 (1970) 504.","DOI":"10.1109\/T-C.1970.222967"},{"key":"CR18","volume-title":"A global router based on Karmarkar's interior point method","author":"R. Pai","year":"1988","unstructured":"R. Pai, N. Karmarkar and S.S.S.P. Rao, \u201cA global router based on Karmarkar's interior point method,\u201d CSE, Indian Institute of Technology (Bombay, 1988)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"W.V. Quine, \u201cThe problem of simplifying truth functions,\u201dAmerican Mathematical Monthly 59 (1952).","DOI":"10.2307\/2308219"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"W.V. Quine, \u201cA way to simplify truth functions,\u201dAmerican Mathematical Monthly 62 (1955).","DOI":"10.2307\/2307285"},{"key":"CR21","volume-title":"A calculus and an algorithm for the multiple-output 2-level minimization problem","author":"J.P. Roth","year":"1968","unstructured":"J.P. Roth, \u201cA calculus and an algorithm for the multiple-output 2-level minimization problem,\u201d IBM Thomas J. Watson Research Center (Yorktown Heights, NY, 1968)."},{"key":"CR22","unstructured":"R. Rudell and A. Sangiovanni-Vincentelli, \u201cExact minimization of multiple-valued functions for PLA optimization,\u201d in:Proceedings of the IEEE International Conference on Computer-Aided Design (1986) pp. 352\u2013355."},{"key":"CR23","volume-title":"A new method for solving large Satisfiability problems","author":"B. Selman","year":"1991","unstructured":"B. Selman, D. Mitchell and H.J. Levesque, \u201cA new method for solving large Satisfiability problems,\u201d AT&T Bell Laboratories (Murray Hill, NJ, 1991)."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"J.R. Slagle, C.L. Chang and R.C.T. Lee, \u201cA new algorithm for generating prime implicants,\u201dIEEE Transactions on Computers C-19 (1970) 304.","DOI":"10.1109\/T-C.1970.222917"},{"key":"CR25","volume-title":"Generating logical expressions from positive and negative examples via a branch-and-bound approach","author":"E. Triantaphyllou","year":"1991","unstructured":"E. Triantaphyllou, A.L. Soyster and S.R.T. Kumara, \u201cGenerating logical expressions from positive and negative examples via a branch-and-bound approach,\u201d Industrial and Management Systems Engineering, Pennsylvania State University (University Park, PA, 1991)."},{"key":"CR26","volume-title":"On the interior algorithms for nonconvex quadratic programming","author":"Y. Ye","year":"1988","unstructured":"Y. Ye, \u201cOn the interior algorithms for nonconvex quadratic programming,\u201d Integrated Systems Inc. (Santa Clara, CA, 1988)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581082.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581082\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:56:07Z","timestamp":1586231767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":26,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["BF01581082"],"URL":"https:\/\/doi.org\/10.1007\/bf01581082","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}