{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:54:45Z","timestamp":1649087685749},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,19]],"date-time":"2009-09-19T00:00:00Z","timestamp":1253318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10489-009-0195-6","type":"journal-article","created":{"date-parts":[[2009,9,18]],"date-time":"2009-09-18T13:34:41Z","timestamp":1253280881000},"page":"279-298","source":"Crossref","is-referenced-by-count":2,"title":["Boosting learning and inference in Markov logic through\u00a0metaheuristics"],"prefix":"10.1007","volume":"34","author":[{"given":"Marenglen","family":"Biba","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Ferilli","sequence":"additional","affiliation":[]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,19]]},"reference":[{"key":"195_CR1","volume-title":"Representing and reasoning with probabilistic knowledge","author":"F Bacchus","year":"1990","unstructured":"Bacchus F (1990) Representing and reasoning with probabilistic knowledge. MIT Press, Cambridge"},{"key":"195_CR2","doi-asserted-by":"crossref","unstructured":"Battiti R, Protasi M (1997) Reactive search, a history-based heuristic for max-sat. ACM J Exp Algorithmics 2","DOI":"10.1145\/264216.264220"},{"key":"195_CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.2307\/2987782","volume":"24","author":"J Besag","year":"1975","unstructured":"Besag J (1975) Statistical analysis of non-lattice data. Statistician 24:179\u2013195","journal-title":"Statistician"},{"key":"195_CR4","series-title":"LNCS","first-page":"59","volume-title":"Inductive logic programming, 18th international conference, ILP 2008, Prague, Czech Republic, September 10\u201312, 2008, Proceedings","author":"M Biba","year":"2008","unstructured":"Biba M, Ferilli S, Esposito F (2008) Discriminative structure learning of Markov logic networks. In: Inductive logic programming, 18th international conference, ILP 2008, Prague, Czech Republic, September 10\u201312, 2008, Proceedings. LNCS, vol 5194. Springer, Berlin, pp 59\u201376"},{"key":"195_CR5","first-page":"2","volume":"61","author":"P Damien","year":"1999","unstructured":"Damien P, Wakefield J, Walker S (1999) Gibbs sampling for Bayesian non-conjugate and hierarchical models by auxiliary variables. J R Stat Soc B 61:2","journal-title":"J R Stat Soc B"},{"key":"195_CR6","doi-asserted-by":"crossref","unstructured":"Davis J, Goadrich M (2006) The relationship between precision-recall and roc curves. In: Proc. 23rd ICML, pp 233\u2013240","DOI":"10.1145\/1143844.1143874"},{"key":"195_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1007361123060","volume":"26","author":"L Raedt De","year":"1997","unstructured":"De Raedt L, Dehaspe L (1997) Clausal discovery. Mach Learn 26:99\u2013146","journal-title":"Mach Learn"},{"key":"195_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3540635149_39","volume-title":"Proc. of 17th int\u2019l workshop on inductive logic programming","author":"L Dehaspe","year":"1997","unstructured":"Dehaspe L (1997) Maximum entropy modeling with clausal constraints. In: Proc. of 17th int\u2019l workshop on inductive logic programming. LNCS, vol 1297. Springer, Berlin, pp 109\u2013124"},{"key":"195_CR9","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/34.588021","volume":"19","author":"S Della Pietra","year":"1997","unstructured":"Della Pietra S, Della Pietra V, Laferty J (1997) Inducing features of random fields. IEEE Trans Pattern Anal Mach Intell 19:380\u2013392","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"195_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-1-4615-5775-3_18","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"C Fonlupt","year":"1999","unstructured":"Fonlupt C, Robilliard D, Preux P, Talbi E-G (1999) Fitness landscape and performance of meta-heuristics. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer Academic, Boston, pp 257\u2013268"},{"key":"195_CR11","first-page":"1300","volume-title":"Proc. 16th int\u2019l joint conf. on AI (IJCAI)","author":"N Friedman","year":"1999","unstructured":"Friedman N, Getoor L, Koller D, Pfeffer A (1999) Learning probabilistic relational models. In: Proc. 16th int\u2019l joint conf. on AI (IJCAI). Kaufmann, San Mateo, pp 1300\u20131307"},{"key":"195_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"195_CR13","volume-title":"Logical foundations of artificial intelligence","author":"MR Genesereth","year":"1987","unstructured":"Genesereth MR, Nilsson NJ (1987) Logical foundations of artificial intelligence. Kaufmann, San Mateo"},{"key":"195_CR14","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 (2007) Introduction to statistical relational learning. MIT Press, Cambridge"},{"key":"195_CR15","volume-title":"Markov chain Monte Carlo in practice","author":"WR Gilks","year":"1996","unstructured":"Gilks WR, Richardson S, Spiegelhalter DJ (1996) Markov chain Monte Carlo in practice. Chapman & Hall, London"},{"key":"195_CR16","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 (1997) Tabu search. Kluwer Academic, Boston"},{"key":"195_CR17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"J Halpern","year":"1990","unstructured":"Halpern J (1990) An analysis of first-order logics of probability. Artif Intell 46:311\u2013350","journal-title":"Artif Intell"},{"key":"195_CR18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen P, Jaumard B (1990) Algorithms for the maximum satisfiability problem. Computing 44:279\u2013303","journal-title":"Computing"},{"key":"195_CR19","volume-title":"Stochastic local search: foundations and applications","author":"HH Hoos","year":"2005","unstructured":"Hoos HH, Stutzle T (2005) Stochastic local search: foundations and applications. Kaufmann, San Francisco"},{"key":"195_CR20","doi-asserted-by":"crossref","unstructured":"Huynh TN, Mooney RJ (2008) Discriminative structure and parameter learning for Markov logic networks. In: Proc. of the 25th international conference on machine learning (ICML)","DOI":"10.1145\/1390156.1390209"},{"key":"195_CR21","volume-title":"The satisfiability problem: theory and applications","author":"H Kautz","year":"1997","unstructured":"Kautz H, Selman B, Jiang Y (1997) A general stochastic approach to solving problems with hard and soft constraints. In: The satisfiability problem: theory and applications. AMS, Providence"},{"key":"195_CR22","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-44797-0_10","volume-title":"Proc. 11th int\u2019l conf. on inductive logic programming","author":"K Kersting","year":"2001","unstructured":"Kersting K, De Raedt L (2001) Towards combining inductive logic programming with Bayesian networks. In: Proc. 11th int\u2019l conf. on inductive logic programming. Springer, Berlin, pp 118\u2013131"},{"key":"195_CR23","doi-asserted-by":"crossref","unstructured":"Kok S, Domingos P (2005) Learning the structure of Markov logic networks. In: Proc. 22nd int\u2019l conf. on machine learning, pp 441\u2013448","DOI":"10.1145\/1102351.1102407"},{"key":"195_CR24","unstructured":"Kok S, Singla P, Richardson M, Domingos P (2005) The alchemy system for statistical relational ai. Technical Report, Department of CSE-UW, Seattle, WA, http:\/\/alchemy.cs.washington.edu\/"},{"key":"195_CR25","first-page":"795","volume-title":"Proc. 20th nat\u2019l conf. on artificial intelligence","author":"N Landwehr","year":"2005","unstructured":"Landwehr N, Kersting K, De Raedt L (2005) nfoil: Integrating naive Bayes and foil. In: Proc. 20th nat\u2019l conf. on artificial intelligence. AAAI Press, Menlo Park, pp 795\u2013800"},{"key":"195_CR26","volume-title":"Proc. 21st nat\u2019l conf. on artificial intelligence","author":"N Landwehr","year":"2006","unstructured":"Landwehr N, Passerini A, De Raedt L, Frasconi P (2006) kfoil: Learning simple relational kernels. In: Proc. 21st nat\u2019l conf. on artificial intelligence. AAAI Press, Menlo Park"},{"key":"195_CR27","unstructured":"Landwehr N, Kersting K, De Raedt L (2007) Integrating naive Bayes and foil. J Mach Learn Res 481\u2013507"},{"key":"195_CR28","volume-title":"Inductive logic programming: techniques and applications","author":"N Lavrac","year":"1994","unstructured":"Lavrac N, Dzeroski S (1994) Inductive logic programming: techniques and applications. Ellis Horwood, Chichester"},{"key":"195_CR29","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu DC, Nocedal J (1989) On the limited memory bfgs method for large scale optimization. Math Program 45:503\u2013528","journal-title":"Math Program"},{"key":"195_CR30","first-page":"321","volume-title":"Handbook of metaheuristics","author":"HR Loureno","year":"2002","unstructured":"Loureno HR, Martin O, Stutzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Norwell, pp 321\u2013353"},{"key":"195_CR31","first-page":"200","volume-title":"Proc. of the 11th PKDD","author":"D Lowd","year":"2007","unstructured":"Lowd D, Domingos P (2007) Efficient weight learning for Markov logic networks. In: Proc. of the 11th PKDD. Springer, Berlin, pp\u00a0200\u2013211"},{"key":"195_CR32","unstructured":"McCallum A (2003) Efficiently inducing features of conditional random fields. In: Proc. UAI-03, pp 403\u2013410"},{"key":"195_CR33","volume-title":"Lecture notes in physics","author":"M Mezard","year":"1987","unstructured":"Mezard M, Parisi G, Virasoro MA (1987) Spin-glass theory and beyond. In: Lecture notes in physics, vol 9. World Scientific, Singapore"},{"key":"195_CR34","doi-asserted-by":"crossref","unstructured":"Mihalkova L, Mooney RJ (2007) Bottom-up learning of Markov logic network structure. In: Proc. 24th int\u2019l conf. on machine learning, pp 625\u2013632","DOI":"10.1145\/1273496.1273575"},{"key":"195_CR35","unstructured":"Mihalkova L, Richardson M (2008) Speeding up inference in statistical relational learning by clustering similar query literals. Technical Report, Microsoft Research Technical Report MSR-TR-2008-72, May 2008"},{"key":"195_CR36","unstructured":"Mills P, Tsang E (2000) Guided local search for solving sat and weighted max-sat problems. In: Gent IP, van Maaren H, Walsh T (eds) SAT2000\u2014Highlights of satisfiability research in the year 2000. IOS Press, pp 89\u2013106"},{"key":"195_CR37","first-page":"170","volume-title":"Proc. 4th IEEE int\u2019l conf. on data mining","author":"J Neville","year":"2004","unstructured":"Neville J, Jensen D (2004) Dependency networks for relational data. In: Proc. 4th IEEE int\u2019l conf. on data mining. IEEE Comput Soc, Los Alamitos, pp 170\u2013177"},{"key":"195_CR38","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N Nilsson","year":"1986","unstructured":"Nilsson N (1986) Probabilistic logic. Artif Intell 28:71\u201387","journal-title":"Artif Intell"},{"key":"195_CR39","unstructured":"Park JD (2005) Using weighted max-sat engines to solve mpe. In: Proc. of AAAI, pp 682\u2013687"},{"key":"195_CR40","unstructured":"Pereira J, Saraiva JT, PoncedeLeao MT (1999) Identification of operation strategies of distribution networks using a simulated annealing approach. In: IEEE Power tech conference, Budapest"},{"key":"195_CR41","first-page":"458","volume-title":"Proc. 21st nat\u2019l conf. on AI (AAAI)","author":"H Poon","year":"2006","unstructured":"Poon H, Domingos P (2006) Sound and efficient inference with probabilistic and deterministic dependencies. In: Proc. 21st nat\u2019l conf. on AI (AAAI). AAAI Press, Menlo Park, pp 458\u2013463"},{"key":"195_CR42","volume-title":"Proc. 23rd nat\u2019l conf. on artificial intelligence","author":"H Poon","year":"2008","unstructured":"Poon H, Domingos P, Sumner M (2008) A general method for reducing the complexity of relational inference and its application to mcmc. In: Proc. 23rd nat\u2019l conf. on artificial intelligence. AAAI Press, Chicago"},{"key":"195_CR43","first-page":"239","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan JR (1990) Learning logical definitions from relations. Mach Learn 5:239\u2013266","journal-title":"Mach Learn"},{"key":"195_CR44","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 (2006) Markov logic networks. Mach Learn 62:107\u2013236","journal-title":"Mach Learn"},{"key":"195_CR45","unstructured":"Riedel S (2008) Improving the accuracy and efficiency of map inference for Markov logic. In: Proceedings of UAI"},{"key":"195_CR46","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth D (1996) On the hardness of approximate reasoning. Artif Intell 82:273\u2013302","journal-title":"Artif Intell"},{"key":"195_CR47","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","volume-title":"Cliques, coloring, and satisfiability: second DIMACS implementation challenge","author":"B Selman","year":"1996","unstructured":"Selman B, Kautz H, Cohen B (1996) Local search strategies for satisfiability testing. In: Cliques, coloring, and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, pp 521\u2013532"},{"key":"195_CR48","doi-asserted-by":"crossref","unstructured":"Sha F, Pereira F (2003) Shallow parsing with conditional random fields. In: Proc. HLT-NAACL-03, pp 134\u2013141","DOI":"10.3115\/1073445.1073473"},{"key":"195_CR49","first-page":"378","volume-title":"Proc. of IJCAI","author":"Y Shang","year":"1997","unstructured":"Shang Y, Wah B (1997) Discrete lagrangian-based search for solving max-sat problems. In: Proc. of IJCAI. Kaufmann, San Francisco, pp 378\u2013383"},{"key":"195_CR50","first-page":"868","volume-title":"Proc. 20th nat\u2019l conf. on AI, (AAAI)","author":"P Singla","year":"2005","unstructured":"Singla P, Domingos P (2005) Discriminative training of Markov logic networks. In: Proc. 20th nat\u2019l conf. on AI, (AAAI). AAAI Press, Menlo Park, pp 868\u2013873"},{"key":"195_CR51","first-page":"572","volume-title":"Proc. ICDM-2006","author":"P Singla","year":"2006","unstructured":"Singla P, Domingos P (2006) Entity resolution with Markov logic. In: Proc. ICDM-2006. IEEE Comput Soc, Los Alamitos, pp 572\u2013582"},{"key":"195_CR52","unstructured":"Singla P, Domingos P (2007) Markov logic in infinite domains. In: Proc. 23rd UAI. AUAI Press, pp 368\u2013375"},{"key":"195_CR53","doi-asserted-by":"crossref","unstructured":"Smyth K, Hoos H, St\u00fctzle T (2003) Iterated robust tabu search for max-sat. In: Canadian conference on AI, pp 129\u2013144","DOI":"10.1007\/3-540-44886-1_12"},{"key":"195_CR54","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"ED Taillard","year":"1991","unstructured":"Taillard ED (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17:443\u2013455","journal-title":"Parallel Comput"},{"key":"195_CR55","unstructured":"Wei W, Erenrich J, Selman B (2004) Towards efficient sampling: Exploiting random walk strategies. In: Proc. 19th nat\u2019l conf. on AI, (AAAI)"},{"key":"195_CR56","doi-asserted-by":"crossref","unstructured":"Wellman JS, Breese M, Goldman RP (1992) From knowledge bases to decision models. Knowl Eng Rev 7","DOI":"10.1017\/S0269888900006147"},{"key":"195_CR57","first-page":"673","volume-title":"Proc. of AAAI","author":"Z Wu","year":"1999","unstructured":"Wu Z, Wah BW (1999) Trap escaping strategies in discrete lagrangian methods for solving hard satisfiability and maximum satisfiability problems. In: Proc. of AAAI. MIT Press, Cambridge, pp\u00a0673\u2013678"},{"issue":"5","key":"195_CR58","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1023\/A:1011306011437","volume":"7","author":"M Yagiura","year":"2001","unstructured":"Yagiura M, Ibaraki T (2001) Efficient 2 and 3-flip neighborhood search algorithms for the max sat:experimental evaluation. J Heuristics 7(5):423\u2013442","journal-title":"J Heuristics"},{"issue":"3","key":"195_CR59","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.ress.2003.11.012","volume":"84","author":"EP Zafiropoulos","year":"2004","unstructured":"Zafiropoulos EP, Dialynas EN (2004) Reliability and cost optimization of electronic devices considering the component failure rate uncertainty. Reliab Eng Syst Saf 84(3):271\u2013284","journal-title":"Reliab Eng Syst Saf"},{"issue":"1\u20133","key":"195_CR60","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F Zelezny","year":"2006","unstructured":"Zelezny F, Srinivasan A, Page D (2006) Randomised restarted search in ilp. Mach Learn 64(1\u20133):183\u2013208","journal-title":"Mach Learn"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0195-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-009-0195-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-009-0195-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:43Z","timestamp":1559139943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-009-0195-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,19]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s10489-009-0195-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,19]]}}}