{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:21Z","timestamp":1748751021435,"version":"3.41.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:00:00Z","timestamp":1447200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Suomen Akatemia (FI)","doi-asserted-by":"publisher","award":["251170"],"award-info":[{"award-number":["251170"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11222-015-9611-4","type":"journal-article","created":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T13:37:53Z","timestamp":1447249073000},"page":"115-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Learning discrete decomposable graphical models via constraint optimization"],"prefix":"10.1007","volume":"27","author":[{"given":"Tomi","family":"Janhunen","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[]},{"given":"Jussi","family":"Rintanen","sequence":"additional","affiliation":[]},{"given":"Henrik","family":"Nyman","sequence":"additional","affiliation":[]},{"given":"Johan","family":"Pensar","sequence":"additional","affiliation":[]},{"given":"Jukka","family":"Corander","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,11]]},"reference":[{"key":"9611_CR1","unstructured":"Bartlett, M., Cussens, J.: Advances in Bayesian network learning using integer programming. In: Proceedings of the 29th International Conference on Uncertainty in Artificial Intelligence, pp. 182\u2013191. AUAI Press (2013)"},{"key":"9611_CR2","unstructured":"Berg, J., J\u00e4rvisalo, M., Malone, B.: Learning optimal bounded treewidth Bayesian networks via maximum satisfiability. In: Proceedings of the 17th International Conference on Artificial Intelligence and Statistics, pp. 86\u201395. JMLR.org (2014)"},{"key":"9611_CR3","unstructured":"Boutilier, C., Friedman, N., Goldszmidt, M., Koller, D.: Context-specific independence in Bayesian networks. In: Proceedings of the 12th International Conference on Uncertainty in Artificial Intelligence, pp. 115\u2013123. Morgan Kaufmann (1996)"},{"issue":"12","key":"9611_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"2","key":"9611_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0304-3975(03)00221-4","volume":"307","author":"LS Chandran","year":"2003","unstructured":"Chandran, L.S., Ibarra, L., Ruskey, F., Sawada, J.: Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2), 303\u2013317 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9611_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM Press (1971)","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"9611_CR7","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1111\/1467-9469.00344","volume":"30","author":"J Corander","year":"2003","unstructured":"Corander, J.: Labelled graphical models. Scand. J. Stat. 30(3), 493\u2013508 (2003)","journal-title":"Scand. J. Stat."},{"issue":"3","key":"9611_CR8","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10618-008-0099-9","volume":"17","author":"J Corander","year":"2008","unstructured":"Corander, J., Ekdahl, M., Koski, T.: Parallel interacting MCMC for learning of topologies of graphical models. Data Min. Knowl. Discov. 17(3), 431\u2013456 (2008)","journal-title":"Data Min. Knowl. Discov."},{"key":"9611_CR9","unstructured":"Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems, pp. 1349\u20131357. NIPS Foundation (2013)"},{"key":"9611_CR10","unstructured":"Cussens, J.: Bayesian network learning by compiling to weighted MAX-SAT. In: Proceedings of the 24th International Conference on Uncertainty in Artificial Intelligence, pp. 105\u2013112. AUAI Press (2008)"},{"issue":"3","key":"9611_CR11","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1214\/aos\/1176349260","volume":"21","author":"AP Dawid","year":"1993","unstructured":"Dawid, A.P., Lauritzen, S.L.: Hyper-Markov laws in the statistical analysis of decomposable graphical models. Ann. Stat. 21(3), 1272\u20131317 (1993)","journal-title":"Ann. Stat."},{"issue":"3","key":"9611_CR12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1093\/biomet\/86.3.615","volume":"86","author":"P Dellaportas","year":"1999","unstructured":"Dellaportas, P., Forster, J.J.: Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models. Biometrika 86(3), 615\u2013633 (1999)","journal-title":"Biometrika"},{"issue":"1\u20132","key":"9611_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg 25(1\u20132), 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"9611_CR14","unstructured":"Eriksen, P.S.: Context specific interaction models. Technical Report, Department of Mathematical Sciences, Aalborg University (1999)"},{"key":"9611_CR15","unstructured":"Eriksen, P.S.: Decomposable log-linear models. Technical Report, Department of Mathematical Sciences, Aalborg University (2005)"},{"key":"9611_CR16","unstructured":"Friedman, N., Goldszmidt, M.: Learning Bayesian networks with local structure. In: Proceedings of the 12th International Conference on Uncertainty in Artificial Intelligence, pp. 252\u2013262. Morgan Kaufmann (1996)"},{"key":"9611_CR17","doi-asserted-by":"crossref","unstructured":"Galinier, P., Habib, M., Paul, C.: Chordal graphs and their clique graphs. In: Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 358\u2013371. Springer (1995)","DOI":"10.1007\/3-540-60618-1_88"},{"key":"9611_CR18","doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Proceedings of the 21st European Conference on Artificial Intelligence, pp. 351\u2013356. IOS Press (2014)","DOI":"10.1007\/978-3-319-11558-0_10"},{"key":"9611_CR19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187\u2013188, 52\u201389 (2012)","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"9611_CR20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1020202028934","volume":"50","author":"P Giudici","year":"2003","unstructured":"Giudici, P., Castello, R.: Improving Markov chain Monte Carlo model search for data mining. Mach. Learn. 50(1\u20132), 127\u2013158 (2003)","journal-title":"Mach. Learn."},{"issue":"4","key":"9611_CR21","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1093\/biomet\/86.4.785","volume":"86","author":"P Giudici","year":"1999","unstructured":"Giudici, P., Green, P.J.: Decomposable graphical Gaussian model determination. Biometrika 86(4), 785\u2013801 (1999)","journal-title":"Biometrika"},{"key":"9611_CR22","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"issue":"5","key":"9611_CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64(5), 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"9611_CR24","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/S0167-9473(02)00119-6","volume":"42","author":"S H\u00f8jsgaard","year":"2003","unstructured":"H\u00f8jsgaard, S.: Split models for contingency tables. Comput. Stat. Data Anal. 42(4), 621\u2013645 (2003)","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"9611_CR25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1111\/j.1467-9469.2004.00378.x","volume":"31","author":"S H\u00f8jsgaard","year":"2004","unstructured":"H\u00f8jsgaard, S.: Statistical inference in context specific interaction models for contingency tables. Scand. J. Stat. 31(1), 143\u2013158 (2004)","journal-title":"Scand. J. Stat."},{"key":"9611_CR26","unstructured":"IBM Corporation: IBM ILOG CPLEX Optimization Studio CP Optimizer User\u2019s Manual, version 12 release 6.0 edn. (2013)"},{"issue":"3","key":"9611_CR27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9611_CR28","unstructured":"Kangas, K., Koivisto, M., Niinim\u00e4ki, T.: Learning chordal Markov networks by dynamic programming. In: Proceedings of the 28th Annual Conference on Neural Information Processing Systems, pp. 2357\u20132365. NIPS Foundation (2014)"},{"issue":"430","key":"9611_CR29","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1080\/01621459.1995.10476572","volume":"90","author":"R Kass","year":"1995","unstructured":"Kass, R., Raftery, A.: Bayes factors. J. Am. Stat. Assoc. 90(430), 773\u2013795 (1995)","journal-title":"J. Am. Stat. Assoc."},{"key":"9611_CR30","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. The MIT Press, Cambridge (2009)"},{"key":"9611_CR31","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical Models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen, S.L.: Graphical Models. Oxford University Press, Oxford (1996)"},{"key":"9611_CR32","first-page":"59","volume":"7","author":"D Berre Le","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The Sat4j library, release 2.2 system description. J. Satisf. Boolean Model. Comput. 7, 59\u201364 (2010)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1\u20132","key":"9611_CR33","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138(1\u20132), 39\u201354 (2002)","journal-title":"Artif. Intell."},{"issue":"428","key":"9611_CR34","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1080\/01621459.1994.10476894","volume":"89","author":"D Madigan","year":"1994","unstructured":"Madigan, D., Raftery, A.E.: Model selection and accounting for model uncertainty in graphical models using Occam\u2019s window. J. Am. Stat. Assoc. 89(428), 1535\u20131546 (1994)","journal-title":"J. Am. Stat. Assoc."},{"key":"9611_CR35","doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted Boolean optimization. In: Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, pp. 495\u2013508. Springer (2009)","DOI":"10.1007\/978-3-642-02777-2_45"},{"key":"9611_CR36","doi-asserted-by":"crossref","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"2","key":"9611_CR37","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/AIC-2012-0517","volume":"25","author":"R Martins","year":"2012","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Parallel search for maximum satisfiability. AI Commun. 25(2), 75\u201395 (2012)","journal-title":"AI Commun."},{"key":"9611_CR38","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","DOI":"10.1023\/A:1018930122475"},{"key":"9611_CR39","doi-asserted-by":"crossref","unstructured":"Nyman, H., Pensar, J., Koski, T., Corander, J.: Stratified graphical models-context-specific independence in graphical models. Bayesian Anal. 9(4), 883\u2013908 (2014)","DOI":"10.1214\/14-BA882"},{"key":"9611_CR40","unstructured":"Parviainen, P., Farahani, H.S., Lagergren, J.: Learning bounded tree-width Bayesian networks using integer linear programming. In: Proceedings of the 17th International Conference on Artificial Intelligence and Statistics, pp. 751\u2013759. JMLR.org (2014)"},{"issue":"2","key":"9611_CR41","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10618-014-0355-0","volume":"29","author":"J Pensar","year":"2015","unstructured":"Pensar, J., Nyman, H., Koski, T., Corander, J.: Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models. Data Min. Knowl. Discov. 29(2), 503\u2013533 (2015)","journal-title":"Data Min. Knowl. Discov."},{"issue":"3","key":"9611_CR42","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"DJ Rose","year":"1970","unstructured":"Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32(3), 597\u2013609 (1970)","journal-title":"J. Math. Anal. Appl."},{"key":"9611_CR43","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-642-31365-3_38","volume-title":"Automated Reasoning","author":"R Sebastiani","year":"2012","unstructured":"Sebastiani, R., Tomasi, S.: Optimization in SMT with LA(Q) cost functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) Automated Reasoning, pp. 484\u2013498. Springer, Heidelberg (2012)"},{"key":"9611_CR44","unstructured":"Silander, T., Kontkanen, P., Myllym\u00e4ki, P.: On sensitivity of the MAP Bayesian network structure to the equivalent sample size parameter. In: Proceedings of the The 23rd Conference on Uncertainty in Artificial Intelligence (UAI-2007), pp. 360\u2013367. AUAI Press (2007)"},{"key":"9611_CR45","unstructured":"Silander, T., Roos, T., Kontkanen, P., Myllym\u00e4ki, P.: Factorized NML criterion for learning Bayesian network structures. In: Proceedings 4th European Workshop on Probabilistic Graphical Models (PGM-2008) (2008)"},{"issue":"5","key":"9611_CR46","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.ijar.2010.01.012","volume":"51","author":"T Silander","year":"2010","unstructured":"Silander, T., Roos, T., Myllym\u00e4ki, P.: Learning locally minimax optimal Bayesian networks. Int. J. Approx. Reason. 51(5), 544\u2013557 (2010)","journal-title":"Int. J. Approx. Reason."},{"key":"9611_CR47","doi-asserted-by":"crossref","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, pp. 827\u2013831. Springer (2005)","DOI":"10.1007\/11564751_73"},{"key":"9611_CR48","volume-title":"Graphical Models in Applied Multivariate Statistics","author":"J Whittaker","year":"1990","unstructured":"Whittaker, J.: Graphical Models in Applied Multivariate Statistics. Wiley, New York (1990)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-015-9611-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9611-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9611-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9611-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T11:12:39Z","timestamp":1748689959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-015-9611-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,11]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9611"],"URL":"https:\/\/doi.org\/10.1007\/s11222-015-9611-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2015,11,11]]}}}