{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:24:14Z","timestamp":1737005054360,"version":"3.33.0"},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"unspecified","delay-in-days":119,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hybrid MKNF Knowledge Bases (HMKNF-KBs) constitute a formalism for tightly integrated reasoning over closed-world rules and open-world ontologies. This approach allows for accurate modeling of real-world systems, which often rely on both categorical and normative reasoning. Conflict-driven solving is the leading approach for computationally hard problems, such as satisfiability (SAT) and answer set programming (ASP), in which MKNF is rooted. This paper investigates the theoretical underpinnings required for a conflict-driven solver of HMKNF-KBs. The approach defines a set of completion and loop formulas, whose satisfaction characterizes MKNF models. This forms the basis for a set of nogoods, which in turn can be used as the backbone for a conflict-driven solver.<\/jats:p>","DOI":"10.1017\/s1471068424000255","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T13:37:51Z","timestamp":1730122671000},"page":"901-920","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5195-0702","authenticated-orcid":false,"given":"RILEY","family":"KINAHAN","sequence":"first","affiliation":[]},{"given":"SPENCER","family":"KILLEN","sequence":"additional","affiliation":[]},{"given":"KEVIN","family":"WAN","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9372-4371","authenticated-orcid":false,"given":"JIA-HUAI","family":"YOU","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"key":"S1471068424000255_ref8","unstructured":"Eiter, T. , Ianni, G. , Schindlauer, R. and Tompits, H. 2006. Towards efficient evaluation of hex programs. In Proc. of the International Workshop on NMR, 40\u201346."},{"key":"S1471068424000255_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"S1471068424000255_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.04.001"},{"key":"S1471068424000255_ref18","first-page":"22","volume-title":"Reasoning Web","author":"Knorr","year":"2021"},{"key":"S1471068424000255_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.01.007"},{"key":"S1471068424000255_ref25","unstructured":"Wittocx, J. , Mari\u00ebn, M. and Denecker, M. 2008. The IDP system: A model expansion system for an extension of classical logic. In Proc. of Workshop on Logic and Search, 153\u2013165."},{"key":"S1471068424000255_ref2","unstructured":"Alberti, M. , Knorr, M. , Gomes, A. S. , Leite, J. , Gon\u00e7alves, R. and Slota, M. 2012. Normative systems require hybrid knowledge bases. In Proc. of International Conference on Autonomous Agents and Multiagent Systems, IFAAMS, 1425\u20131426."},{"key":"S1471068424000255_ref10","doi-asserted-by":"crossref","unstructured":"Eiter, T. and \u0160imkus, M. 2015. Linking open-world knowledge bases using nonmonotonic rules. In Proc. of LPNMR, Springer, 294\u2013308.","DOI":"10.1007\/978-3-319-23264-5_25"},{"key":"S1471068424000255_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2480759.2480768"},{"key":"S1471068424000255_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24599-5_31"},{"key":"S1471068424000255_ref5","first-page":"293","volume-title":"Logic and Data Bases","author":"Clark","year":"1977"},{"key":"S1471068424000255_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0535-y"},{"key":"S1471068424000255_ref7","doi-asserted-by":"crossref","unstructured":"Eiter, T. , Ianni, G. , Schindlauer, R. and Tompits, H. 2005. Nonmonotonic description logic programs: Implementation and experiments. In Proc. of LPAR, Springer, 511\u2013527.","DOI":"10.1007\/978-3-540-32275-7_34"},{"key":"S1471068424000255_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-020-00650-1"},{"key":"S1471068424000255_ref11","first-page":"2:1","article-title":"Theory solving made easy with clingo","author":"Gebser","year":"2016","journal-title":"Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)"},{"key":"S1471068424000255_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-018-0533-0"},{"key":"S1471068424000255_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103402"},{"key":"S1471068424000255_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754403"},{"key":"S1471068424000255_ref14","doi-asserted-by":"crossref","unstructured":"Gebser, M. , Kaufmann, B. and Schaub, T. 2013. Advanced conflict-driven disjunctive answer set solving. In Proc. of IJCAI, 13, 912\u2013918.","DOI":"10.1007\/978-3-031-01561-8"},{"key":"S1471068424000255_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068416000211"},{"key":"S1471068424000255_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000291"},{"key":"S1471068424000255_ref4","doi-asserted-by":"crossref","unstructured":"Alviano, M. , Dodaro, C. , Leone, N. and Ricca, F. 2015. Advances in WASP. In Proc. of LPNMR, Springer, 40\u201354.","DOI":"10.1007\/978-3-319-23264-5_5"},{"key":"S1471068424000255_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"S1471068424000255_ref17","doi-asserted-by":"crossref","unstructured":"Killen, S. and You, J.-H. 2021. Unfounded sets for disjunctive hybrid MKNF knowledge bases. In Proc. of KR, 432\u2013441.","DOI":"10.24963\/kr.2021\/41"},{"key":"S1471068424000255_ref21","unstructured":"Lifschitz, V. 1991. Nonmonotonic databases and epistemic queries. In Proc. of IJCAI, 381\u2013386."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068424000255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T09:52:57Z","timestamp":1736934777000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000255\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["S1471068424000255"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000255","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}