{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:41:15Z","timestamp":1743082875362,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031314131"},{"type":"electronic","value":"9783031314148"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-31414-8_4","type":"book-chapter","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T18:13:33Z","timestamp":1682619213000},"page":"132-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Statistical Relational Extension of\u00a0Answer Set Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9569-5575","authenticated-orcid":false,"given":"Joohyung","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9043-5774","authenticated-orcid":false,"given":"Zhun","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, N., Lee, J., Papotti, P., Saeed, M.: Explainable fact checking with probabilistic answer set programming. In: Conference for Truth and Trust Online (2019)","DOI":"10.36370\/tto.2019.15"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Babb, J., Lee, J.: Action language $$\\cal{BC}$$+: preliminary report. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (2015)","DOI":"10.1609\/aaai.v29i1.9405"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Babb, J., Lee, J.: Action language $$\\cal{BC}$$+. J. Logic Comput. 30(4), 899\u2013922 (2020)","DOI":"10.1093\/logcom\/exv062"},{"key":"4_CR4","unstructured":"Balai, E., Gelfond, M.: On the relationship between P-log and LPMLN. In: IJCAI (2016)"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845\u2013860 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR6","unstructured":"Calimeri, F., et al.: ASP-Core-2: Input language format. ASP Standardization Working Group, Technical report (2012)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-48758-8_15","volume-title":"Logics in Artificial Intelligence","author":"T Eiter","year":"2016","unstructured":"Eiter, T., Kaminski, T.: Exploiting contextual knowledge for hybrid classification of visual objects. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 223\u2013239. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_15"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory Pract. Logic Program. 3, 499\u2013518 (2003)","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artif. Intell. 175, 236\u2013263 (2011)","journal-title":"Artif. Intell."},{"issue":"03","key":"4_CR10","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., et al.: Inference and learning in probabilistic logic programs using weighted Boolean formulas. Theory Pract. Logic Program. 15(03), 358\u2013401 (2015)","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR11","unstructured":"Gebser, M., Schaub, T., Marius, S., Thiele, S.: xorro: near uniform sampling of answer sets by means of XOR (2016). https:\/\/potassco.org\/labs\/2016\/09\/20\/xorro.html"},{"key":"4_CR12","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of International Logic Programming Conference and Symposium, pp. 1070\u20131080. MIT Press (1988)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-031-21541-4_4","volume-title":"Rules and Reasoning","author":"S Hahn","year":"2022","unstructured":"Hahn, S., Janhunen, T., Kaminski, R., Romero, J., R\u00fchling, N., Schaub, T.: Plingo: a system for probabilistic reasoning in clingo based on $$LP^{MLN}$$. In: Governatori, G., Turhan, A.Y. (eds.) RuleML+RR 2022. LNCS, vol. 13752, pp. 54\u201362. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21541-4_4"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Katzouris, N., Artikis, A.: WOLED: a tool for online learning weighted answer set rules for temporal reasoning under uncertainty. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, vol. 17, pp. 790\u2013799 (2020)","DOI":"10.24963\/kr.2020\/81"},{"key":"4_CR15","unstructured":"Lee, J., Meng, Y., Wang, Y.: Markov logic style weighted rules under the stable model semantics. In: CEUR Workshop Proceedings, vol. 1433 (2015)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-24599-5_31","volume-title":"Logic Programming","author":"J Lee","year":"2003","unstructured":"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 451\u2013465. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24599-5_31"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-04238-6_51","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Lee","year":"2009","unstructured":"Lee, J., Palla, R.: System f2lp \u2013 computing answer sets of first-order formulas. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 515\u2013521. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04238-6_51"},{"key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000400","author":"J Lee","year":"2017","unstructured":"Lee, J., Talsania, S., Wang, Y.: Computing LPMLN using ASP and MLN solvers. Theory Pract. Logic Program. (2017). https:\/\/doi.org\/10.1017\/S1471068417000400","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR19","unstructured":"Lee, J., Wang, Y.: Weighted rules under the stable model semantics. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 145\u2013154 (2016)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lee, J., Wang, Y.: A probabilistic extension of action language $$\\cal{BC}$$+. Theory Pract. Logic Program. 18(3\u20134), 607\u2013622 (2018)","DOI":"10.1017\/S1471068418000303"},{"key":"4_CR21","unstructured":"Lee, J., Wang, Y.: Weight learning in a probabilistic extension of answer set programs. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 22\u201331 (2018)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Lee, J., Yang, Z.: LPMLN, weak constraints, and P-log. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1170\u20131177 (2017)","DOI":"10.1609\/aaai.v31i1.10686"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2, 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157, 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"4_CR25","unstructured":"Luo, M., Lee, J.: Strong equivalence for LPMLN programs. In: ICLP (Technical Communications) (2019)"},{"key":"4_CR26","unstructured":"Poon, H., Domingos, P.: Sound and efficient inference with probabilistic and deterministic dependencies. In: AAAI, vol. 6, pp. 458\u2013463 (2006)"},{"issue":"1\u20132","key":"4_CR27","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. Mach. Learn. 62(1\u20132), 107\u2013136 (2006)","journal-title":"Mach. Learn."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming (ICLP), pp. 715\u2013729 (1995)","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Wang, B., Zhang, Z., Xu, H., Shen, J.: Splitting an LPMLN program. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11570"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-20528-7_17","volume-title":"International Conference on Logic Programming and Nonmonotonic Reasoning","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Lee, J.: Elaboration tolerant representation of Markov decision process via decision-theoretic extension of probabilistic action language $$p\\cal{BC}+$$. In: Balduccini, M., Lierler, Y., Woltran, S. (eds.) LPNMR 2019. LNAI, vol. 11481, pp. 224\u2013238. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20528-7_17"},{"issue":"5\u20136","key":"4_CR31","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1017\/S1471068419000371","volume":"19","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Zhang, S., Lee, J.: Bridging commonsense reasoning and probabilistic planning via a probabilistic action language. Theory Pract. Logic Program. 19(5\u20136), 1090\u20131106 (2019)","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Wu, W., et al.: LPMLNModels: a parallel solver for LPMLN. In: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 794\u2013799. IEEE (2018)","DOI":"10.1109\/ICTAI.2018.00124"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Yang, Z., Ishay, A., Lee, J.: NeurASP: embracing neural networks into answer set programming. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1755\u20131762 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/243","DOI":"10.24963\/ijcai.2020\/243"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Causality, Explanations and Declarative Knowledge"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31414-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T16:38:23Z","timestamp":1702312703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31414-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031314131","9783031314148"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31414-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}