{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:48Z","timestamp":1740123888470,"version":"3.37.3"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:00:00Z","timestamp":1588809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:00:00Z","timestamp":1588809600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10472-020-09698-z","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:03:03Z","timestamp":1588809783000},"page":"907-949","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging cluster backbones for improving MAP inference in statistical relational models"],"prefix":"10.1007","volume":"88","author":[{"given":"Mohamed-Hamza","family":"Ibrahim","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,7]]},"reference":[{"issue":"1","key":"9698_CR1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/070680382","volume":"39","author":"D Achlioptas","year":"2009","unstructured":"Achlioptas, D., Ricci-Tersenghi, F.: Random formulas have frozen variables. SIAM J Comput 39(1), 260\u2013280 (2009). SIAM","journal-title":"SIAM J Comput"},{"key":"9698_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadi, B., Kersting, K., Mladenov, M., Natarajan, S.: Exploiting symmetries for scaling loopy belief propagation and relational training, vol. 92 (2013)","DOI":"10.1007\/s10994-013-5385-0"},{"key":"9698_CR3","unstructured":"Allouche, D., de Givry, S., Schiex, T.: Toulbar2 an Open Source Exact Cost Function Network Solver. Technical report, INRIA (2010)"},{"key":"9698_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1613\/jair.1.11322","volume":"66","author":"MM Amirian","year":"2019","unstructured":"Amirian, M.M., Ghidary, S.S.: Xeggora: Exploiting immune-to-evidence symmetries with full aggregation in statistical relational models. J. Artif. Intell. Res. 66, 33\u201356 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"9698_CR5","doi-asserted-by":"crossref","first-page":"36107","DOI":"10.1103\/PhysRevE.70.036107","volume":"70","author":"D Battaglia","year":"2004","unstructured":"Battaglia, D., Kol\u00e1r, M., Zecchina, R.: Minimizing energy below the glass thresholds. Phys. Rev. E 70, 36107\u201336118 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"9698_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J Besag","year":"1986","unstructured":"Besag, J.: On the statistical analysis of dirty pictures. J R Stat Soc Series B stat Methodol 48(3), 259\u2013279 (1986)","journal-title":"J R Stat Soc Series B stat Methodol"},{"key":"9698_CR7","doi-asserted-by":"crossref","unstructured":"Braunstein, A., Zecchina, R.: Survey and belief propagation on random k-sat. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, vol. 2919, pp. 519\u2013528. Springer, Vancouver (2004)","DOI":"10.1007\/978-3-540-24605-3_38"},{"issue":"2","key":"9698_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithm. 27(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithm."},{"issue":"11","key":"9698_CR9","doi-asserted-by":"crossref","first-page":"11016","DOI":"10.1088\/1742-5468\/2005\/11\/P11016","volume":"2005","author":"J Chavas","year":"2005","unstructured":"Chavas, J., Furtlehner, C., M\u00e9zard, M., Zecchina, R.: Survey-propagation decimation through distributed local computations. J. Stat. Mech. Theory Exper. 2005 (11), 11016\u201311027 (2005). IOP Publishing","journal-title":"J. Stat. Mech. Theory Exper."},{"key":"9698_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.2808","volume":"36","author":"HL Chieu","year":"2009","unstructured":"Chieu, H.L., Lee, W.S.: Relaxed survey propagation for the weighted maximum satisfiability problem. J. Artif. Intell. Res. (JAIR) 36, 229\u2013266 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9698_CR11","unstructured":"Chieu, H.L., Lee, W.S., Teh, Y.W.: Cooled and relaxed survey propagation for mrfs. In: Proceedings of the 21st Annual Conference on Neural Information Processing Systems: Advances in Neural Information Processing Systems, vol. 20, pp. 297\u2013304, Vancouver. Curran Associates, Inc. (2007)"},{"key":"9698_CR12","unstructured":"Conaty, D., Maua, D., de Campos, C.: Approximation complexity of maximum a posteriori inference in sum-product networks. In: Proceedings of The 33rd Conference on Uncertainty in Artificial Intelligence, AUAI (2017)"},{"key":"9698_CR13","doi-asserted-by":"crossref","unstructured":"Davis, J., Domingos, P.: Deep Transfer via Second-Order Markov Logic. In: Proceedings of the 26Th International Conference on Machine Learning (ICML-09), Montreal (2009)","DOI":"10.1145\/1553374.1553402"},{"key":"9698_CR14","unstructured":"De Salvo Braz, R., Amir, E., Roth, D.: Lifted first-order probabilistic inference. In: Proceedings of the 19th International joint conference in artificial intelligent, pp. 1319\u20131325. AAAI Press (2005)"},{"key":"9698_CR15","unstructured":"De Salvo Braz, R., Amir, E., Roth, D.: Mpe and partial inversion in lifted probabilistic variable elimination. In: Proceedings Of The Twenty-first National Conference On Artificial Intelligence, vol. 6, pp. 1123\u20131130. AAAI press, Boston (2006)"},{"issue":"3","key":"9698_CR16","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"GD Forney","year":"1973","unstructured":"Forney, G.D.: The viterbi algorithm. Proc. IEEE 61(3), 268\u2013278 (1973). IEEE computer Society","journal-title":"Proc. IEEE"},{"key":"9698_CR17","doi-asserted-by":"crossref","unstructured":"Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. Adaptive Computation and Machine Learning. The MIT Press (2007)","DOI":"10.7551\/mitpress\/7432.001.0001"},{"key":"9698_CR18","unstructured":"Gomes, C., Hogg, T., Walsh, T., Zhang, W.: Tutorial - Phase Transitions and Structure in Combinatorial Problems. In: Proceedings Of The Eighteenth National Conference On Artificial Intelligence. AAAI Press, Edmonton (2002)"},{"issue":"6","key":"9698_CR19","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/34.295910","volume":"16","author":"V Granville","year":"1994","unstructured":"Granville, V., Kriv\u00e1nek, M., Rasson, J.P.: Simulated annealing: a proof of convergence. IEEE Trans. Pattern Anal. Mach. Intell. 16(6), 652\u2013656 (1994). IEEE computer society","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9698_CR20","doi-asserted-by":"crossref","unstructured":"Hartmann, A.K., Weigt, M.: Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics. Wiley, New York (2006)","DOI":"10.1002\/3527606734"},{"key":"9698_CR21","doi-asserted-by":"crossref","unstructured":"Huynh, T.N., Mooney, R.J.: Max-margin weight learning for markov logic networks. In: Machine Learning and Knowledge Discovery in Databases, vol. 5781, pp. 564\u2013579. Springer (2009)","DOI":"10.1007\/978-3-642-04180-8_54"},{"key":"9698_CR22","doi-asserted-by":"crossref","unstructured":"Ibrahim, M.H., Pal, C., Pesant, G.: Exploiting determinism to scale relational inference. In: Proceedings of the Twenty-Ninth National Conference on Artificial Intelligence (AAAI\u201915), pp. 1756\u20131762. AAAI Press, Austin (2015)","DOI":"10.1609\/aaai.v29i1.9478"},{"key":"9698_CR23","unstructured":"Jain, D., Maier, P., Wylezich, G.: Markov Logic as a Modelling Language for Weighted Constraint Satisfaction Problems. In: Eighth International Workshop on Constraint Modelling and Reformulation, in conjunction with CP (2009)"},{"key":"9698_CR24","doi-asserted-by":"crossref","unstructured":"Kambhampati, S.C., Liu, T.: Phase transition and network structure in realistic sat problems. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, pp. 1619\u20131620. AAAI Press, Washington (2013)","DOI":"10.1609\/aaai.v27i1.8529"},{"key":"9698_CR25","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1090\/dimacs\/035\/15","volume":"17","author":"H Kautz","year":"1997","unstructured":"Kautz, H., Selman, B., Jiang, Y.: A general stochastic approach to solving problems with hard and soft constraints. Satisfiab Problem Theory Appl. 17, 573\u2013586 (1997)","journal-title":"Satisfiab Problem Theory Appl."},{"key":"9698_CR26","unstructured":"Kazemi, S.M., Kimmig, A., Van den Broeck, G., Poole, D.: New liftable classes for first-order probabilistic inference. In: Advances in Neural Information Processing Systems, pp. 3117\u20133125 (2016)"},{"key":"9698_CR27","unstructured":"Kersting, K.: Lifted probabilistic inference. In: Proceedings of 20th European Conference on Artificial Intelligence (ECAI\u20132012), vol. 27-31, pp. 33\u201338. ECCAI, Montpellier (2012)"},{"key":"9698_CR28","unstructured":"Khosla, M., Melhorn, K., Panagiotou, K.: Message Passing Algorithms, PhD thesis. Citeseer (2009)"},{"key":"9698_CR29","doi-asserted-by":"crossref","unstructured":"Kiddon, C., Domingos, P.: Coarse-to-fine inference and learning for first-order probabilistic models. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, pp. 1049\u20131056. AAAI Press, San Francisco (2011)","DOI":"10.1609\/aaai.v25i1.8019"},{"key":"9698_CR30","unstructured":"Kilby, P., Slaney, J., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings of the The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, vol. 5, pp. 1368\u20131373. AAAI Press, Pittsburgh (2005)"},{"key":"9698_CR31","unstructured":"Kok, S., Singla, P., Richardson, M., Domingos, P., Sumner, M., Poon, H., Lowd, D.: The Alchemy System for Statistical Relational AI. In: Technical Report Department of Computer Science and Engineering, University of Washington, Seattle. http:\/\/alchemy.cs.washington.edu (2007)"},{"issue":"10","key":"9698_CR32","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9698_CR33","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Survey propagation revisited. In: Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, pp. 217\u2013226. AUAI Press, Vancouver (2007)"},{"key":"9698_CR34","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Counting solution clusters in graph coloring problems using belief propagation. In: Proceedings of 22nd Conference on Neural Information Processing Systems: Advances in Neural Information Processing Systems, vol. 21, pp. 873\u2013880. Curran Associates Inc., Vancouver (2008)"},{"key":"9698_CR35","doi-asserted-by":"crossref","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: Message-passing and local heuristics as decimation strategies for satisfiability. In: Proceedings of the 2009 ACM symposium on Applied Computing, pp. 1408\u20131414. ACM (2009)","DOI":"10.1145\/1529282.1529596"},{"key":"9698_CR36","doi-asserted-by":"crossref","unstructured":"Kumar, M.P., Torr, P.H.: Efficiently solving convex relaxations for map estimation. In: Proceedings of the 25th international conference on Machine learning, pp. 680\u2013687. ACM, Helsinki (2008)","DOI":"10.1145\/1390156.1390242"},{"key":"9698_CR37","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. R. Stat. Soc. Ser. B (Methodol.) 50, 157\u2013224 (1988)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"9698_CR38","doi-asserted-by":"crossref","unstructured":"Lowd, D., Domingos, P.: Efficient weight learning for markov logic networks. In: Proceedings of 11th European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD 2007, pp. 200\u2013211. Springer, Warsaw (2007)","DOI":"10.1007\/978-3-540-74976-9_21"},{"key":"9698_CR39","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1613\/jair.1.11261","volume":"63","author":"S L\u00fcdtke","year":"2018","unstructured":"L\u00fcdtke, S., Schr\u00f6der, M., Kr\u00fcger, F., Bader, S., Kirste, T.: State-space abstractions for probabilistic inference: a systematic review. J. Artif. Intell. Res. 63, 789\u2013848 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"9698_CR40","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1255443.1255445","volume":"54","author":"E Maneva","year":"2007","unstructured":"Maneva, E., Mossel, E., Wainwright, M.J.: A new look at survey propagation and its generalizations. J. ACM (JACM) 54(4), 17\u201321 (2007). ACM","journal-title":"J. ACM (JACM)"},{"key":"9698_CR41","doi-asserted-by":"crossref","unstructured":"Mann, A., Hartmann, A.: Numerical solution-space analysis of satisfiability problems. Phys. Rev. E 82(5), 056702\u201356707. APS (2010)","DOI":"10.1103\/PhysRevE.82.056702"},{"key":"9698_CR42","doi-asserted-by":"crossref","unstructured":"Mei, J., Jiang, Y., Tu, K.: Maximum a posteriori inference in sum-product networks. In: Thirty-Second AAAI Conference on Artificial Intelligence, pp. 1923\u20131930 (2018)","DOI":"10.1609\/aaai.v32i1.11550"},{"key":"9698_CR43","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.dss.2017.02.013","volume":"100","author":"C Meilicke","year":"2017","unstructured":"Meilicke, C., Leopold, H., Kuss, E., Stuckenschmidt, H., Reijers, H.A.: Overcoming individual process model matcher weaknesses using ensemble matching. Decis. Support. Syst. 100, 15\u201326 (2017)","journal-title":"Decis. Support. Syst."},{"key":"9698_CR44","unstructured":"Molina, A., Vergari, A., Stelzner, K., Peharz, R., Subramani, P., Mauro, N.D., Poupart, P., Kersting, K.: Spflow: An easy and extensible library for deep probabilistic learning using sum-product networks. arXiv:1901.03704(2019)"},{"issue":"6","key":"9698_CR45","doi-asserted-by":"crossref","first-page":"2073","DOI":"10.1088\/0305-4470\/37\/6\/008","volume":"37","author":"A Montanari","year":"2004","unstructured":"Montanari, A., Parisi, G., Ricci-Tersenghi, F.: Instability of one-step replica-symmetry-broken phase in satisfiability problems. J. Phys. A: Math. Gen. 37 (6), 2073\u20132079 (2004). IOP Publishing","journal-title":"J. Phys. A: Math. Gen."},{"issue":"1-3","key":"9698_CR46","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10472-009-9138-5","volume":"54","author":"S Natarajan","year":"2008","unstructured":"Natarajan, S., Tadepalli, P., Dietterich, T.G., Fern, A.: Learning first-order probabilistic models with combining rules. Ann. Math. Artif. Intell. 54(1-3), 223\u2013256 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9698_CR47","doi-asserted-by":"crossref","unstructured":"Nath, A., Domingos, P.M.: Learning relational sum-product networks. In: Twenty-Ninth AAAI Conference on Artificial Intelligence, pp 2878\u20132886 (2015)","DOI":"10.1609\/aaai.v29i1.9538"},{"issue":"1-3","key":"9698_CR48","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10472-009-9136-7","volume":"54","author":"KS Ng","year":"2008","unstructured":"Ng, K.S., Lloyd, J.W., Uther, W.T.: Probabilistic modelling, inference and learning using logical theories. Ann. Math. Artif. Intell. 54(1-3), 159\u2013205 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"6","key":"9698_CR49","doi-asserted-by":"crossref","first-page":"373","DOI":"10.14778\/1978665.1978669","volume":"4","author":"F Niu","year":"2011","unstructured":"Niu, F., R\u00e9, C., Doan, A., Shavlik, J.: Tuffy: Scaling up statistical inference in markov logic networks using an rdbms. Proc. VLDB Endow. 4(6), 373\u2013384 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"9698_CR50","doi-asserted-by":"crossref","unstructured":"Noessner, J., Niepert, M., Stuckenschmidt, H.: Rockit: Exploiting Parallelism and Symmetry for Map Inference in Statistical Relational Models. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8579"},{"key":"9698_CR51","doi-asserted-by":"crossref","unstructured":"Papai, T., Singla, P., Kautz, H.: Constraint propagation for efficient inference in markov logic. In: Proceedings of 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), no. 6876 in Lecture Notes in Computer Science (LNCS), pp 691\u2013705 (2011)","DOI":"10.1007\/978-3-642-23786-7_52"},{"key":"9698_CR52","unstructured":"Park, J.D.: Using weighted max-sat engines to solve mpe. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 682\u2013687. AAAI Press, Menlo Park (2002)"},{"key":"9698_CR53","unstructured":"Parkes, A.J.: Clustering at the phase transition. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 340\u2013345. AAAI Press. at the convention center in Providence (1997)"},{"key":"9698_CR54","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"issue":"10","key":"9698_CR55","doi-asserted-by":"crossref","first-page":"2030","DOI":"10.1109\/TPAMI.2016.2618381","volume":"39","author":"R Peharz","year":"2016","unstructured":"Peharz, R., Gens, R., Pernkopf, F., Domingos, P.: On the latent variable interpretation in sum-product networks. IEEE Trans. Pattern Anal. Mach. Intell. 39 (10), 2030\u20132044 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9698_CR56","doi-asserted-by":"crossref","unstructured":"Poon, H., Domingos, P.: Sum-Product Networks: a New Deep Architecture. In: 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), pp. 689\u2013690. IEEE (2011)","DOI":"10.1109\/ICCVW.2011.6130310"},{"key":"9698_CR57","unstructured":"Poon, H., Domingos, P., Sumner, M.: A general method for reducing the complexity of relational inference and its application to mcmc. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, pp 1075\u20131080. AAAI Press, Chicago (2008)"},{"key":"9698_CR58","doi-asserted-by":"crossref","unstructured":"Ravikumar, P., Lafferty, J.: Quadratic programming relaxations for metric labeling and markov random field map estimation. In: Proceedings of the 23rd international conference on Machine learning, pp. 737\u2013744. ACM (2006)","DOI":"10.1145\/1143844.1143937"},{"issue":"1-2","key":"9698_CR59","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1-2), 107\u2013136 (2006). Kluwer Academic Publishers","journal-title":"Mach. Learn."},{"key":"9698_CR60","unstructured":"Riedel, S.: Improving the accuracy and efficiency of map inference for markov logic. In: UAI, pp 468\u2013475. AUAI Press (2008)"},{"key":"9698_CR61","unstructured":"Rooshenas, A., Lowd, D.: Learning sum-product networks with direct and indirect variable interactions. In: International Conference on Machine Learning, pp 710\u2013718 (2014)"},{"key":"9698_CR62","unstructured":"Sarkhel, S., Gogate, V.: Lifting walksat-based local search algorithms for map inference. In: Proceedings of Statistical Relational Artificial Intelligence Workshop at the Twenty-Seventh AAAI Conference on Artificial Intelligence, pp. 64\u201367. AAAI Press, Bellevue (2013)"},{"key":"9698_CR63","unstructured":"Sarkhel, S., Venugopal, D., Singla, P., Gogate, V.: Lifted MAP inference for markov logic networks. In: Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, vol. 33, pp. 859\u2013867. JMLR: W & CP, Reykjavik (2014a)"},{"key":"9698_CR64","unstructured":"Sarkhel, S., Venugopal, D., Singla, P., Gogate, V.G.: An integer polynomial programming based framework for lifted map inference. In: Advances in Neural Information Processing Systems, pp 3302\u20133310 (2014b)"},{"key":"9698_CR65","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.is.2017.11.003","volume":"74","author":"J Schoenfisch","year":"2018","unstructured":"Schoenfisch, J., Meilicke, C., von St\u00fclpnagel, J., Ortmann, J., Stuckenschmidt, H.: Root cause analysis in it infrastructures using ontologies and abduction in markov logic networks. Inf. Syst. 74, 103\u2013116 (2018)","journal-title":"Inf. Syst."},{"key":"9698_CR66","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B., et al.: Local search strategies for satisfiability testing. Cliques, coloring, and satisfiability: Second DIMACS implementation challenge 26, 521\u2013532 (1993)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"9698_CR67","doi-asserted-by":"crossref","unstructured":"Singla, P., Domingos, P.: Entity resolution with markov logic. In: ICDM, pp 572\u2013582. IEEE Computer Society (2006a)","DOI":"10.1109\/ICDM.2006.65"},{"key":"9698_CR68","unstructured":"Singla, P., Domingos, P.: Memory-efficient inference in relational domains. In: Proceedings of the Twenty-first National Conference on Artificial Intelligence (AAAI-06), vol. 6, pp 488\u2013493. AAAI Press, Boston (2006b)"},{"key":"9698_CR69","unstructured":"Skarlatidis, A.: Logical markov random fields (lomrf): an open-source implementation of markov logic networks. https:\/\/github.com\/anskarl\/LoMRF (2012)"},{"key":"9698_CR70","unstructured":"Slaney, J., Walsh, T.: Backbones in optimization and approximation. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, vol. 1, pp. 254\u2013259. Morgan Kaufmann Publishers Inc., Seattle (2001)"},{"issue":"1","key":"9698_CR71","first-page":"1","volume":"2","author":"R Szeliski","year":"2006","unstructured":"Szeliski, R.: Image alignment and stitching: a tutorial. Found. Trends\u00ae; Comput. Graph. Vis. 2(1), 1\u2013104 (2006). Now Publishers Inc.","journal-title":"Found. Trends\u00ae; Comput. Graph. Vis."},{"issue":"2","key":"9698_CR72","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/B:STCO.0000021412.33763.d5","volume":"14","author":"M Wainwright","year":"2004","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Stat. Comput. 14(2), 143\u2013166 (2004). Springer","journal-title":"Stat. Comput."},{"key":"9698_CR73","doi-asserted-by":"crossref","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches. IEEE Transactions on Information Theory, vol. 51, pp. 3697\u20133717. IEEE computer society (2005)","DOI":"10.1109\/TIT.2005.856938"},{"issue":"2","key":"9698_CR74","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y Weiss","year":"2001","unstructured":"Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Trans. Inf. Theory 47(2), 736\u2013744 (2001). IEEE computer Society","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9698_CR75","first-page":"1887","volume":"7","author":"C Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., Weiss, Y.: Linear programming relaxations and belief propagation\u2013an empirical study. J. Mach. Learn. Res. 7, 1887\u20131907 (2006). JMLR. org","journal-title":"J. Mach. Learn. Res."},{"key":"9698_CR76","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","volume":"21","author":"W Zhang","year":"2004","unstructured":"Zhang, W.: Phase transitions and backbones of the asymmetric traveling salesman problem. J. Artif. Intell. Res. (JAIR) 21, 471\u2013497 (2004). AAAI Press","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09698-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-020-09698-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-020-09698-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T11:30:01Z","timestamp":1722857401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-020-09698-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,7]]},"references-count":76,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["9698"],"URL":"https:\/\/doi.org\/10.1007\/s10472-020-09698-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2020,5,7]]},"assertion":[{"value":"7 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}