{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:51:50Z","timestamp":1743112310222,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319178219"},{"type":"electronic","value":"9783319178226"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17822-6_16","type":"book-chapter","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T05:57:31Z","timestamp":1429682251000},"page":"279-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies"],"prefix":"10.1007","author":[{"given":"Md. Solimul","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangfang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Karimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,23]]},"reference":[{"key":"16_CR1","first-page":"487","volume":"42","author":"M Alviano","year":"2011","unstructured":"Alviano, M., Calimeri, F., Faber, W., Leone, N., Perri, S.: Unfounded sets and well-founded semantics of answer set programs with aggregates. J. Artif. Intell. Res. 42, 487\u2013527 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-40564-8_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Faber, W.: The complexity boundary of answer set programming with generalized atoms under the FLP semantics. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 67\u201372. Springer, Heidelberg (2013)"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2820","volume":"36","author":"A Artale","year":"2009","unstructured":"Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1\u201369 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"16_CR4","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, New York (2003)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1177352.1177354","volume":"38","author":"L Bordeaux","year":"2006","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: a comparative survey. ACM Comput. Surv. 38(4), 1\u201354 (2006)","journal-title":"ACM Comput. Surv."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1613\/jair.4175","volume":"49","author":"T Eiter","year":"2014","unstructured":"Eiter, T., Fink, M., Krennwallner, T., Redl, C., Sch\u00fcller, P.: Efficient hex-program evaluation based on unfounded sets. J. Artif. Intell. Res. (JAIR) 49, 269\u2013321 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"12\u201313","key":"16_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":"16_CR9","unstructured":"Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: IJCAI, pp. 90\u201396 (2005)"},{"key":"16_CR10","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. Log. 12(2) (2011), Article 3","DOI":"10.1145\/1877714.1877717"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11546207_4","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"W Faber","year":"2005","unstructured":"Faber, W.: Unfounded sets for disjunctive logic programs with arbitrary aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 40\u201352. Springer, Heidelberg (2005)"},{"issue":"5\u20136","key":"16_CR12","first-page":"545","volume":"8","author":"W Faber","year":"2008","unstructured":"Faber, W., Pfeifer, G., Leone, N., Dell\u2019Armi, T., Ielpa, G.: Design and implementation of aggregate functions in the DLV system. TPLP 8(5\u20136), 545\u2013580 (2008)","journal-title":"TPLP"},{"issue":"9\u201310","key":"16_CR13","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., J\u00falio Alferes, 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."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-20895-9_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G Liu","year":"2011","unstructured":"Liu, G., Goebel, R., Janhunen, T., Niemel\u00e4, I., You, J.-H.: Strong equivalence of logic programs with abstract constraint atoms. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 161\u2013173. Springer, Heidelberg (2011)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-89982-2_33","volume-title":"Logic Programming","author":"G Liu","year":"2008","unstructured":"Liu, G., You, J.-H.: Lparse programs revisited: semantics and representation of aggregates. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.artint.2009.11.016","volume":"174","author":"L Liu","year":"2010","unstructured":"Liu, L., Pontelli, E., Cao Son, T., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms. Artif. Intell. 174, 295\u2013315 (2010)","journal-title":"Artif. Intell."},{"key":"16_CR17","unstructured":"Marek, V.W., Truszczynski, M: Logic programs with abstract constraint atoms. In: Proceedings of AAAI-04, pp. 86\u201391 (2004)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S1471068406002973","volume":"7","author":"N Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Log. Program. 7, 301\u2013353 (2007)","journal-title":"Theory Pract. Log. Program."},{"key":"16_CR19","unstructured":"Rossi, F., Van Beek, P., Walsh, T. (eds.): Global constraints. Handbook of Constraint Programming. Elsevier, New York (2006)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Simons, P., Niemel$$\\ddot{a}$$, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","DOI":"10.1016\/S0004-3702(02)00187-X"},{"issue":"3","key":"16_CR21","first-page":"355","volume":"7","author":"T Cao Son","year":"2007","unstructured":"Cao Son, T., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP 7(3), 355\u2013375 (2007)","journal-title":"TPLP"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.2171","volume":"29","author":"E Pontelli","year":"2007","unstructured":"Pontelli, E., Huy Tu, P.: Answer sets for logic programs with arbitrary abstract constraint atoms. J. Artif. Intell. Res. 29, 353\u2013389 (2007)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"16_CR23","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":"16_CR24","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"16_CR25","unstructured":"Wang, Y., Lin, F., Zhang, M., You, J.-H.: A well-founded semantics for basic logic programs with arbitrary abstract constraint atoms. In: AAAI (2012)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17822-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:50:50Z","timestamp":1676940650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17822-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319178219","9783319178226"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17822-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}