{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T05:09:33Z","timestamp":1777439373614,"version":"3.51.4"},"reference-count":34,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"unspecified","delay-in-days":0,"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":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Approximation fixpoint theory (AFT) provides an algebraic framework for the study of fixpoints of operators on bilattices and has found its applications in characterizing semantics for various classes of logic programs and nonmonotonic languages. In this paper, we show one more application of this kind: the alternating fixpoint operator by Knorr et al. for the study of the well-founded semantics for hybrid minimal knowledge and negation as failure (MKNF) knowledge bases is in fact an approximator of AFT in disguise, which, thanks to the abstraction power of AFT, characterizes not only the well-founded semantics but also two-valued as well as three-valued semantics for hybrid MKNF knowledge bases. Furthermore, we show an improved approximator for these knowledge bases, of which the least stable fixpoint is information richer than the one formulated from Knorr et al.\u2019s construction. This leads to an improved computation for the well-founded semantics. This work is built on an extension of AFT that supports consistent as well as inconsistent pairs in the induced product bilattice, to deal with inconsistencies that arise in the context of hybrid MKNF knowledge bases. This part of the work can be considered generalizing the original AFT from symmetric approximators to arbitrary approximators.<\/jats:p>","DOI":"10.1017\/s1471068421000168","type":"journal-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T12:23:02Z","timestamp":1630498982000},"page":"305-334","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT"],"prefix":"10.1017","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0954-9238","authenticated-orcid":false,"given":"FANGFANG","family":"LIU","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9372-4371","authenticated-orcid":false,"given":"JIA-HUAI","family":"YOU","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"S1471068421000168_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00330-3"},{"key":"S1471068421000168_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.03.008"},{"key":"S1471068421000168_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1183278.1183284"},{"key":"S1471068421000168_ref3","doi-asserted-by":"crossref","unstructured":"Bi, Y. , You, J. and Feng, Z. 2014. A generalization of approximation fixpoint theory and application. In Proceedings of the 8th International Conference on Web Reasoning and Rule Systems, RR-14. Athens, Greece, 45\u201359.","DOI":"10.1007\/978-3-319-11113-1_4"},{"key":"S1471068421000168_ref32","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"S1471068421000168_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.02.004"},{"key":"S1471068421000168_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.02.005"},{"key":"S1471068421000168_ref19","unstructured":"Kaminski, T. , Knorr, M. and Leite, J. 2015. Efficient paraconsistent reasoning with ontologies and rules. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, Yang, Q. and Wooldridge, M. J. , Eds. AAAI Press, 3098\u20133105."},{"key":"S1471068421000168_ref4","doi-asserted-by":"crossref","unstructured":"Bogaerts, B. 2019. Weighted abstract dialectical frameworks through the lens of approximation fixpoint theory. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence, AAAI-19. AAAI Press, Hawaii, USA, 2686\u20132693.","DOI":"10.1609\/aaai.v33i01.33012686"},{"key":"S1471068421000168_ref23","doi-asserted-by":"crossref","unstructured":"Liu, F. and You, J. 2017. Three-valued semantics for hybrid MKNF knowledge bases revisited. Artificial Intelligence 252, 123\u2013138.","DOI":"10.1016\/j.artint.2017.08.003"},{"key":"S1471068421000168_ref26","unstructured":"Motik, B. and Rosati, R. 2007. A faithful integration of description logics with logic programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI-07. Hyderabad, India, 477\u2013482."},{"key":"S1471068421000168_ref20","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2021\/41"},{"key":"S1471068421000168_ref24","author":"Liu","year":"2019"},{"key":"S1471068421000168_ref11","volume-title":"Logic-Based Artificial Intelligence","author":"Denecker","year":"2000"},{"key":"S1471068421000168_ref25","doi-asserted-by":"crossref","unstructured":"Markowsky, G. 1976. Chain-complete posets and directed sets with applications. Algebra Universalis 6, 1, 53\u201368.","DOI":"10.1007\/BF02485815"},{"key":"S1471068421000168_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-016-0301-3"},{"key":"S1471068421000168_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.11.003"},{"key":"S1471068421000168_ref14","doi-asserted-by":"crossref","unstructured":"Denecker, M. and Vennekens, J. 2007. Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR-07. Tempe, USA. 84\u201396.","DOI":"10.1007\/978-3-540-72200-7_9"},{"key":"S1471068421000168_ref27","first-page":"1","article-title":"Reconciling description logics and rules","volume":"5","author":"Motik","year":"2010","journal-title":"Journal of the ACM 57"},{"key":"S1471068421000168_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068421000168_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000162"},{"key":"S1471068421000168_ref2","doi-asserted-by":"crossref","unstructured":"Antic, C. , Eiter, T. and Fink, M. 2013. Hex semantics via approximation fixpoint theory. In Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR-13. Corunna, Spain, 102\u2013115.","DOI":"10.1007\/978-3-642-40564-8_11"},{"key":"S1471068421000168_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.004"},{"key":"S1471068421000168_ref30","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/5.3.265"},{"key":"S1471068421000168_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.03.006"},{"key":"S1471068421000168_ref28","doi-asserted-by":"crossref","unstructured":"Pearce, D. and Valverde, A. 2008. Quantified equilibrium logic and foundations for answer set programs. In Proceedings of the 24th International Conference on Logic Programming, ICLP-08, Udine, Italy, de la Banda, M. G. and Pontelli, E. , Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 546\u2013560.","DOI":"10.1007\/978-3-540-89982-2_46"},{"key":"S1471068421000168_ref18","doi-asserted-by":"crossref","unstructured":"Ji, J. , Liu, F. and You, J. 2017. Well-founded operators for normal hybrid MKNF knowledge bases. Theory and Practice of Logic Programming 17, 5\u20136, 889\u2013905.","DOI":"10.1017\/S1471068417000291"},{"key":"S1471068421000168_ref29","doi-asserted-by":"crossref","unstructured":"Pelov, N. , Denecker, M. and Bruynooghe, M. 2007. Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming 7, 3, 301\u2013353.","DOI":"10.1017\/S1471068406002973"},{"key":"S1471068421000168_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.01.007"},{"key":"S1471068421000168_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00293-X"},{"key":"S1471068421000168_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068421000168_ref22","unstructured":"Lifschitz, V. 1991. Nonmonotonic databases and epistemic queries. In Proceedings of the 12th Joint Conference on Artificial Intelligence, IJCAI-91. Sydney, Australia, 381\u2013386."},{"key":"S1471068421000168_ref17","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the Fifth International Conference and Symposium on Logic Programming. MIT Press, Seattle, Washington, 1070\u20131080."},{"key":"S1471068421000168_ref1","doi-asserted-by":"crossref","unstructured":"Amendola, G. , Eiter, T. , Fink, M. , Leone, N. and Moura, J. 2016. Semi-equilibrium models for paracoherent answer set programs. Artificial Intellegence 234, 219\u2013271.","DOI":"10.1016\/j.artint.2016.01.011"}],"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\/S1471068421000168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:16:34Z","timestamp":1649045794000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000168\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["S1471068421000168"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000168","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. 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 in any medium, provided the original work 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"}]}}