{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:51:29Z","timestamp":1772373089918,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T00:00:00Z","timestamp":1539043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10844-018-0531-6","type":"journal-article","created":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T08:01:51Z","timestamp":1539072111000},"page":"647-672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extending expressivity and flexibility of abductive logic programming"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1118-0601","authenticated-orcid":false,"given":"Stefano","family":"Ferilli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,9]]},"reference":[{"key":"531_CR1","unstructured":"Alberti, M., Bellodi, E., Cota, G., Lamma, E., Riguzzi, F., Zese, R. (2016). Probabilistic constraint logic theories. In Hommersom, A, & Abdallah, S (Eds.) Proceedings of the 3rd International Workshop on Probabilistic Logic Programming (PLP-2016), co-located with 26th International Conference on Inductive Logic Programming (ILP 2016), CEUR Workshop Proceedings, (Vol. 1661 pp. 15\u201328)."},{"key":"531_CR2","unstructured":"Arvanitis, A., Muggleton, S.H., Chen, J., Watanabe, H. (2006). Abduction with stochastic logic programs based on a possible worlds semantics. In Short Paper Proceedings of the 16th International Conference on Inductive Logic Programming (ILP-06), University of Coru\u00f1a."},{"key":"531_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-92243-8_5","volume-title":"Constraint Handling Rules","author":"Henning Christiansen","year":"2008","unstructured":"Christiansen, H. (2008). Implementing probabilistic abductive logic programming with constraint handling rules. In Schrijvers, T., & Fr\u00fchwirth, T. (Eds.) Constraint handling rules, lecture notes in computer science, vol 5388, springer (pp. 85\u2013118)."},{"key":"531_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"Keith L. Clark","year":"1978","unstructured":"Clark, K.L. (1978). Negation as failure. In Gallaire, H., & Minker, J. (Eds.) Logic and Databases, Plenum Press (pp. 293\u2013322)."},{"key":"531_CR5","doi-asserted-by":"crossref","unstructured":"De Raedt, L., & Kersting, K. (2008). Probabilistic inductive logic programming. In Probabilistic inductive logic programming, springer, lecture notes in artificial intelligence, (Vol. 4911 pp. 1\u201327).","DOI":"10.1007\/978-3-540-78652-8_1"},{"key":"531_CR6","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H. (2007). Problog: A probabilistic prolog and its application in link discovery. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07) (pp. 2462\u20132467)."},{"key":"531_CR7","unstructured":"Denecker, M., & Schreye, D.D. (1992). Sldnfa: An abductive procedure for normal abductive programs. In Proceedings of ICSLP, MIT Press (pp. 700\u2013868)."},{"key":"531_CR8","unstructured":"Fierens, D., Van den Broeck, G., Bruynooghe, M., De Raedt, L. (2012). Constraints for probabilistic logic programming. In Roy, D., Mansinghka, V., Goodman, N. (Eds.) Proceedings of the NIPS probabilistic programming workshop."},{"key":"531_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","volume":"33","author":"TH Fung","year":"1997","unstructured":"Fung, T.H., & Kowalski, R.A. (1997). The IFF proof procedure for abductive logic programming. The Journal of Logic Programming, 33, 151\u2013165.","journal-title":"The Journal of Logic Programming"},{"key":"531_CR10","unstructured":"Getoor, L.C. (2002). Learning statistical models from relational data. PhD thesis, Stanford, CA, USA, aAI3038093."},{"key":"531_CR11","unstructured":"Kakas, A., & Mancarella, P. (1990a). Abductive logic programming. In Proceedings of NACLP workshop on non-monotonic reasoning and logic programming."},{"key":"531_CR12","unstructured":"Kakas, A., & Mancarella, P. (1990b). Database updates through abduction. In Proceedings of the 16th VLDB, Morgan Kaufmann (pp. 650\u2013661)."},{"key":"531_CR13","unstructured":"Kakas, A.C., & Mancarella, P. (1990c). On the relation of truth maintenance and abduction. In Proceedings of the 1st pacific rim international conference on artificial intelligence."},{"key":"531_CR14","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"AC Kakas","year":"1992","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F. (1992). Abductive logic programming. Journal of Logic and Computation, 2, 719\u2013770.","journal-title":"Journal of Logic and Computation"},{"key":"531_CR15","unstructured":"Kate, R.J., & Mooney, R.J. (2009). Probabilistic abduction using markov logic networks. In Proceedings of the IJCAI-09 Workshop on Plan, Activity and Intent Recognition (PAIR-09), Pasadena, CA."},{"key":"531_CR16","unstructured":"Lloyd, J. (1987). Foundations of Logic Programming, 2nd edn. Springer."},{"key":"531_CR17","unstructured":"Muggleton, S. (1996). Stochastic logic programs De Raedt, L. (Ed.), (Vol. 32."},{"key":"531_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N Nilsson","year":"1986","unstructured":"Nilsson, N. (1986). Probabilistic logic. Artificial Intelligence, 28, 71\u201387.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"531_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","volume":"64","author":"D Poole","year":"1993","unstructured":"Poole, D. (1993). Probabilistic horn abduction and bayesian networks. Artificial Intelligence, 64(1), 81\u2013129.","journal-title":"Artificial Intelligence"},{"key":"531_CR20","unstructured":"Raghavan, S.V. (2011). Bayesian abductive logic programs: a probabilistic logic for abductive reasoning. In Walsh, T. (Ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11) (pp. 2840\u20132841)."},{"key":"531_CR21","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. (2006). Markov logic networks. Machine Learning, 62, 107\u2013136.","journal-title":"Machine Learning"},{"key":"531_CR22","unstructured":"Rotella, F., & Ferilli, S. (2013). Probabilistic abductive logic programming using possible worlds. In Proceedings of the 10th Italian Convention on Computational Logic (CILC-2013), Central Europe (CEUR) Workshop Proceedings, (Vol. 1068 pp. 131\u2013145)."},{"key":"531_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-45884-0_11","volume-title":"Progress in Discovery Science","author":"Taisuke Sato","year":"2002","unstructured":"Sato, T. (2002). EM Learning for symbolic-statistical models in statistical abduction. In Progress in discovery science ,final report of the japanese discovery science project, Springer (pp. 189\u2013200)."},{"key":"531_CR24","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-27775-0_30","volume-title":"Logic Programming","author":"Joost Vennekens","year":"2004","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M. (2004). Logic programs with annotated disjunctions. In Demoen, B., & Lifschitz, V. (Eds.) Programming, Logic (pp. 431\u2013445). Berlin: Springer."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-018-0531-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-018-0531-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-018-0531-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:09:52Z","timestamp":1570561792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-018-0531-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s10844-018-0531-6","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,9]]},"assertion":[{"value":"6 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}