{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:44:27Z","timestamp":1762101867691,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319341101"},{"type":"electronic","value":"9783319341118"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-34111-8_28","type":"book-chapter","created":{"date-parts":[[2016,5,12]],"date-time":"2016-05-12T06:53:01Z","timestamp":1463035981000},"page":"224-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Flexible Approximators for Approximating Fixpoint Theory"],"prefix":"10.1007","author":[{"given":"Fangfang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Solimul","family":"Chowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,13]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-40564-8_11","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C Antic","year":"2013","unstructured":"Antic, C., Eiter, T., Fink, M.: Hex semantics via approximation fixpoint theory. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 102\u2013115. Springer, Heidelberg (2013)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-319-11113-1_4","volume-title":"Web Reasoning and Rule Systems","author":"Y Bi","year":"2014","unstructured":"Bi, Y., You, J.-H., Feng, Z.: A generalization of approximation fixpoint theory and application. In: Kontchakov, R., Mugnier, M.-L. (eds.) RR 2014. LNCS, vol. 8741, pp. 45\u201359. Springer, Heidelberg (2014)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bogaerts, B., Vennekens, J., Denecker, M.: Grounded fixpoints. In: Proceedings of AAAI 2015, pp. 1453\u20131459 (2015)","DOI":"10.1609\/aaai.v29i1.9388"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.artint.2015.03.006","volume":"224","author":"B Bogaerts","year":"2015","unstructured":"Bogaerts, B., Vennekens, J., Denecker, M.: Grounded fixpoints and their applications in knowledge representation. Artif. Intell. 224, 51\u201371 (2015)","journal-title":"Artif. Intell."},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0004-3702(02)00293-X","volume":"143","author":"M Denecker","year":"2003","unstructured":"Denecker, M., Marek, V.W., Truszczynski, M.: Uniform semantic treatment of default and autoepistemic logics. Artif. Intell. 143(1), 79\u2013122 (2003)","journal-title":"Artif. Intell."},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ic.2004.02.004","volume":"192","author":"M Denecker","year":"2004","unstructured":"Denecker, M., Marek, V.W., Truszczynski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192(1), 84\u2013121 (2004)","journal-title":"Inf. Comput."},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"12\u201313","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","volume":"172","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12\u201313), 1495\u20131539 (2008)","journal-title":"Artif. Intell."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., Lukasiewicz, T., Ianni, G., Schindlauer, R.: Well-founded semantics for description logic programs in the semantic web. ACM Trans. Comput. Logic 12(2) (2011). Article 11","DOI":"10.1145\/1877714.1877717"},{"key":"28_CR10","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070\u20131080 (1988)"},{"issue":"9\u201310","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1016\/j.artint.2011.01.007","volume":"175","author":"M Knorr","year":"2011","unstructured":"Knorr, M., Alferes, J.J., Hitzler, P.: Local closed world reasoning with description logics under the well-founded semantics. Artif. Intell. 175(9\u201310), 1528\u20131554 (2011)","journal-title":"Artif. Intell."},{"issue":"11","key":"28_CR12","first-page":"1577","volume":"22","author":"T Lukasiewicz","year":"2010","unstructured":"Lukasiewicz, T.: A novel combination of answer set programming with description logics for the semantic web. IEEE TKDE 22(11), 1577\u20131592 (2010)","journal-title":"IEEE TKDE"},{"issue":"5","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1754399.1754403","volume":"57","author":"B Motik","year":"2010","unstructured":"Motik, B., Rosati, R.: Reconciling description logics and rules. J. ACM 57(5), 1\u201362 (2010)","journal-title":"J. ACM"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"MBN Pelov","year":"2007","unstructured":"Pelov, M.B.N., Denecker, M.: Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Logic Program. 7, 301\u2013353 (2007)","journal-title":"Theory Pract. Logic Program."},{"key":"28_CR15","unstructured":"Rosati, R.: DL+log: tight integration of description logics and disjunctive datalog. In: Proceedings of KR 2006, pp. 68\u201378 (2006)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-642-25073-6_40","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"Y-D Shen","year":"2011","unstructured":"Shen, Y.-D., Wang, K.: Extending logic programs with description logic expressions for the semantic web. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol. 7031, pp. 633\u2013648. Springer, Heidelberg (2011)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","volume":"205","author":"H Strass","year":"2013","unstructured":"Strass, H.: Approximating operators and semantics for abstract dialectical frameworks. Artif. Intell. 205, 39\u201370 (2013)","journal-title":"Artif. Intell."},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."},{"issue":"3","key":"28_CR19","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Gelder van","year":"1991","unstructured":"van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"28_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10472-010-9207-9","volume":"58","author":"J Vennekens","year":"2010","unstructured":"Vennekens, J., Denecker, M., Bruynooghe, M.: FO(ID) as an extension of DL with rules. Ann. Math. Artif. Intell. 58(1\u20132), 85\u2013115 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Yang, Q., You, J.-H., Feng, Z.: Integrating rules and description logics by circumscription. In: Proceedings of AAAI 2011 (2011)","DOI":"10.1609\/aaai.v25i1.7850"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34111-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T05:30:31Z","timestamp":1692336631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34111-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319341101","9783319341118"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34111-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Canadian AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canadian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Victoria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"canadianai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}