{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:27:57Z","timestamp":1743128877080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_24","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"347-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["MaxSAT-Based Cutting Planes for Learning Graphical Models"],"prefix":"10.1007","author":[{"given":"Paul","family":"Saikko","sequence":"first","affiliation":[]},{"given":"Brandon","family":"Malone","sequence":"additional","affiliation":[]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"24_CR1","unstructured":"Achterberg, T.: Constrained Integer Programming. Ph.D. Thesis, TU Berlin (2007)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ansotegui","year":"2013","unstructured":"Ansotegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artificial Intelligence 196, 77\u2013105 (2013)","journal-title":"Artificial Intelligence"},{"key":"24_CR3","unstructured":"Bartlett, M., Cussens, J.: Advances in Bayesian network learning using integer programming. In: Proc. UAI, pp. 182\u2013191. AUAI Press (2013)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"de Campos, C.P., Zeng, Z., Ji, Q.: Structure learning of Bayesian networks using constraints. In: Proc. ICML, pp. 113\u2013120. ACM (2009)","DOI":"10.1145\/1553374.1553389"},{"key":"24_CR5","unstructured":"Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Proc. NIPS, pp. 1349\u20131357. Curran Associates, Inc. (2013)"},{"key":"24_CR6","unstructured":"Cussens, J.: Bayesian network learning with cutting planes. In: Proc. UAI, pp. 153\u2013160. AUAI Press (2011)"},{"key":"24_CR7","unstructured":"Cussens, J., Bartlett, M.: GOBNILP 1.4.1 user\/developer manual (2013)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-39071-5_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"J Davies","year":"2013","unstructured":"Davies, J., Bacchus, F.: Exploiting the power of mip solvers in maxsat. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 166\u2013181. Springer, Heidelberg (2013)"},{"key":"24_CR9","first-page":"197","volume":"20","author":"D Heckerman","year":"1995","unstructured":"Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20, 197\u2013243 (1995)","journal-title":"Machine Learning"},{"key":"24_CR10","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., Meila, M.: Learning Bayesian network structure using LP relaxations. In: Proc. AISTATS, pp. 358\u2013365. JMLR.org (2010)"},{"key":"24_CR11","unstructured":"Kangas, K., Niinim\u00e4ki, T., Koivisto, M.: Learning chordal Markov networks by dynamic programming. In: Proc. NIPS, pp. 2357\u20132365. Curran Associates, Inc. (2014)"},{"key":"24_CR12","unstructured":"Koivisto, M., Sood, K.: Exact Bayesian structure discovery in Bayesian networks. Journal of Machine Learning Research, 549\u2013573 (2004)"},{"key":"24_CR13","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, chap. 19, pp. 613\u2013631. IOS Press (2009)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Malone, B., Kangas, K., J\u00e4rvisalo, M., Koivisto, M., Myllym\u00e4ki, P.: Predicting the hardness of learning Bayesian networks. In: Proc. AAAI, pp. 1694\u20131700. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9075"},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","volume":"18","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Heras, F., Liffiton, M.H., Planes, J., Marques-Silva, J.: Iterative and core-guided MaxSAT solving: a survey and assessment. Constraints 18(4), 478\u2013534 (2013)","journal-title":"Constraints"},{"key":"24_CR16","first-page":"124","volume":"14","author":"S Ott","year":"2003","unstructured":"Ott, S., Miyano, S.: Finding optimal gene networks using biological constraints. Genome Informatics 14, 124\u2013133 (2003)","journal-title":"Genome Informatics"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc. (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"24_CR18","unstructured":"Silander, T., Myllym\u00e4ki, P.: A simple approach for finding the globally optimal Bayesian network structure. In: Proc. UAI, pp. 445\u2013452. AUAI Press (2006)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1613\/jair.4039","volume":"48","author":"C Yuan","year":"2013","unstructured":"Yuan, C., Malone, B.: Learning optimal Bayesian networks: a shortest path perspective. Journal of Artificial Intelligence Research 48, 23\u201365 (2013)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:09:04Z","timestamp":1691586544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}