{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:23:45Z","timestamp":1760171025013},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319516752"},{"type":"electronic","value":"9783319516769"}],"license":[{"start":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T00:00:00Z","timestamp":1481932800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51676-9_14","type":"book-chapter","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T02:14:29Z","timestamp":1481940869000},"page":"198-213","source":"Crossref","is-referenced-by-count":3,"title":["Using Iterative Deepening for Probabilistic Logic Inference"],"prefix":"10.1007","author":[{"given":"Theofrastos","family":"Mantadelis","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,17]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 27(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-21295-6_7","volume-title":"Inductive Logic Programming","author":"S Bragaglia","year":"2011","unstructured":"Bragaglia, S., Riguzzi, F.: Approximate inference for logic programs with annotated disjunctions. In: Frasconi, P., Lisi, F.A. (eds.) ILP 2010. LNCS, vol. 6489, pp. 30\u201337. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21295-6_7"},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W Chen","year":"1996","unstructured":"Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. J. ACM 43(1), 20\u201374 (1996)","journal-title":"J. ACM"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"C\u00f4rte-Real, J., Mantadelis, T., de Castro Dutra, I., Rocha, R.: SkILL - a stochastic inductive logic learner. In: International Conference on Machine Learning and Applications (ICMLA), pp. 555\u2013558 (2015)","DOI":"10.1109\/ICMLA.2015.159"},{"issue":"1\u20132","key":"14_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"VS Costa","year":"2012","unstructured":"Costa, V.S., Rocha, R., Damas, L.: The YAP prolog system. Theory Pract. Logic Program. (TPLP) 12(1\u20132), 5\u201334 (2012)","journal-title":"Theory Pract. Logic Program. (TPLP)"},{"key":"14_CR6","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: International Joint Conference on Artificial Intelligence (IJCAI), vol. 2, pp. 819\u2013826 (2011)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Reason. (JAIR) 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Reason. (JAIR)"},{"issue":"2\u20133","key":"14_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1017\/S1471068410000566","volume":"11","author":"A Kimmig","year":"2011","unstructured":"Kimmig, A., Demoen, B., De Raedt, L., Santos Costa, V., Rocha, R.: On the implementation of the probabilistic logic programming language ProbLog. Theory Pract. Logic Program. (TPLP) 11(2\u20133), 235\u2013262 (2011)","journal-title":"Theory Pract. Logic Program. (TPLP)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 346\u2013350. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-24609-1_32"},{"key":"14_CR10","unstructured":"Mantadelis, T., Janssens, G.: Dedicated tabling for a probabilistic setting. In: International Conference on Logic Programming (ICLP). Leibniz International Proceedings in Informatics (LIPIcs), vol. 7, pp. 124\u2013133 (2010)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-15675-5_23","volume-title":"Logics in Artificial Intelligence","author":"T Mantadelis","year":"2010","unstructured":"Mantadelis, T., Rocha, R., Kimmig, A., Janssens, G.: Preprocessing Boolean formulae for BDDs in a probabilistic context. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 260\u2013272. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15675-5_23"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-23264-5_35","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T Mantadelis","year":"2015","unstructured":"Mantadelis, T., Shterionov, D., Janssens, G.: Compacting Boolean formulae for inference in probabilistic logic programming. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS, vol. 9345, pp. 425\u2013438. Springer, Cham (2015). doi: 10.1007\/978-3-319-23264-5_35"},{"key":"14_CR13","unstructured":"Pfeffer, A.: IBAL: a probabilistic rational programming language. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 733\u2013740 (2001)"},{"issue":"1\u20132","key":"14_CR14","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\u20132), 107\u2013136 (2006)","journal-title":"Mach. Learn."},{"key":"14_CR15","unstructured":"Riguzzi, F., Swift, T.: The PITA system: tabling and answer subsumption for reasoning under uncertainty. Comput. Res. Repository abs\/1107.4747 (2011)"},{"key":"14_CR16","unstructured":"Sato, T., Kameya, Y.: PRISM: a language for symbolic-statistical modeling. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 1330\u20131339 (1997)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-319-19686-2_7","volume-title":"Practical Aspects of Declarative Languages","author":"D Shterionov","year":"2015","unstructured":"Shterionov, D., Janssens, G.: Implementation and performance of probabilistic inference pipelines. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 90\u2013104. Springer, Cham (2015). doi: 10.1007\/978-3-319-19686-2_7"},{"key":"14_CR18","unstructured":"Vlasselaer, J., Van den Broeck, G., Kimmig, A., Meert, W., De Raedt, L.: Anytime inference in probabilistic logic programs with Tp-compilation. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 1852\u20131858 (2015)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51676-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T12:43:33Z","timestamp":1568637813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51676-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,17]]},"ISBN":["9783319516752","9783319516769"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51676-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,17]]}}}