{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:54:22Z","timestamp":1725540862295},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102905"},{"type":"electronic","value":"9783642102912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10291-2_28","type":"book-chapter","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T03:14:47Z","timestamp":1258341287000},"page":"274-283","source":"Crossref","is-referenced-by-count":0,"title":["High Performing Algorithms for MAP and Conditional Inference in Markov Logic"],"prefix":"10.1007","author":[{"given":"Marenglen","family":"Biba","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Ferilli","sequence":"additional","affiliation":[]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","first-page":"2","volume":"61","author":"P. Damien","year":"1999","unstructured":"Damien, P., Wakefield, J., Walker, S.: Gibbs sampling for bayesian non-conjugate and hierarchical models by auxiliary variables. Journal of the Royal Statistical Society B\u00a061, 2 (1999)","journal-title":"Journal of the Royal Statistical Society B"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/34.588021","volume":"19","author":"S. Della Pietra","year":"1997","unstructured":"Della Pietra, S., Pietra, V.D., Laferty, J.: Inducing features of random fields. IEEE TPAMI\u00a019, 380\u2013392 (1997)","journal-title":"IEEE TPAMI"},{"key":"28_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to Statistical Relational Learning","author":"L. Getoor","year":"2007","unstructured":"Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT, Cambridge (2007)"},{"key":"28_CR4","volume-title":"Markov Chain Monte Carlo in Practice","author":"W.R. Gilks","year":"1996","unstructured":"Gilks, W.R., Richardson, S., Spiegelhalter, D.J.: Markov Chain Monte Carlo in Practice. Chapman and Hall, Boca Raton (1996)"},{"key":"28_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search.","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"unstructured":"Kok, S., Singla, P., Richardson, M., Domingos, P.: The alchemy system for statistical relational ai. Tech. rep., CSE-UW, Seattle, WA (2005)","key":"28_CR6"},{"key":"28_CR7","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Loureno","year":"2002","unstructured":"Loureno, H.R., Martin, O., Stutzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, USA (2002)"},{"key":"28_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-74976-9_21","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"D. Lowd","year":"2007","unstructured":"Lowd, D., Domingos, P.: Efficient weight learning for markov logic networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 200\u2013211. Springer, Heidelberg (2007)"},{"unstructured":"Park, J.D.: Using weighted max-sat engines to solve mpe. In: AAAI, pp. 682\u2013687 (2005)","key":"28_CR9"},{"unstructured":"Poon, H., Domingos, P.: Sound and efficient inference with probabilistic and deterministic dependencies. In: Proc. 21st AAAI, pp. 458\u2013463 (2006)","key":"28_CR10"},{"key":"28_CR11","doi-asserted-by":"publisher","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. Machine Learning\u00a062, 107\u2013236 (2006)","journal-title":"Machine Learning"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability: 2nd DIMACS, pp. 521\u2013532 (1996)","key":"28_CR13","DOI":"10.1090\/dimacs\/026\/25"},{"key":"28_CR14","first-page":"868","volume-title":"Proc. 20th AAAI","author":"P. Singla","year":"2005","unstructured":"Singla, P., Domingos, P.: Discriminative training of markov logic networks. In: Proc. 20th AAAI, pp. 868\u2013873. AAAI Press, Menlo Park (2005)"},{"doi-asserted-by":"crossref","unstructured":"Smyth, K., Hoos, H., Sttzle, T.: Iterated robust tabu search for max-sat. In: Canadian Conference on AI, pp. 129\u2013144 (2003)","key":"28_CR15","DOI":"10.1007\/3-540-44886-1_12"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"unstructured":"Wei, W., Erenrich, J., Selman, B.: Towards efficient sampling: Exploiting random walk strategies. In: Proc. 19th Nat\u2019l Conf. on AI ( AAAI) (2004)","key":"28_CR17"},{"issue":"5","key":"28_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1023\/A:1011306011437","volume":"7","author":"M. Yagiura","year":"2001","unstructured":"Yagiura, M., Ibaraki, T.: Efficient 2 and 3-flip neighborhood search algorithms for the max sat:experimental evaluation. Journal of Heuristics\u00a07(5), 423\u2013442 (2001)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2009: Emergent Perspectives in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10291-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:36:31Z","timestamp":1619768191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10291-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102905","9783642102912"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10291-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}