{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:30:30Z","timestamp":1785202230213,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642307423","type":"print"},{"value":"9783642307430","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30743-0_39","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T03:49:46Z","timestamp":1338608986000},"page":"576-591","source":"Crossref","is-referenced-by-count":2,"title":["Well-Supported Semantics for Logic Programs with Generalized Rules"],"prefix":"10.1007","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi-Dong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kewen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)"},{"key":"39_CR2","unstructured":"Bartholomew, M., Lee, J., Meng, Y.: First-order extension of the flp stable model semantics via modified circumscription. In: Proc. IJCAI 2011, pp. 724\u2013730 (2011)"},{"key":"39_CR3","unstructured":"Calimeri, F., Faber, W., Leone, N., Perri, S.: Declarative and computational properties of logic programs with aggregates. In: Proc. IJCAI 2005, Edinburgh, Scotland, UK, pp. 406\u2013411. Professional Book Center (2005)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Wan, H., Zhang, Y., Zhou, Y.: dl2asp: Implementing default logic via answer set programming. In: Proceedings 12th European Conference on Logics in Artificial Intelligence, pp. 104\u2013116 (2010)","DOI":"10.1007\/978-3-642-15675-5_11"},{"issue":"3","key":"39_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Survey\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Computing Survey"},{"issue":"1","key":"39_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. Information and Computation\u00a0192(1), 84\u2013121 (2004)","journal-title":"Information and Computation"},{"issue":"3-4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence\u00a015(3-4), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"12-13","key":"39_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. Artifical Intelligence\u00a0172(12-13), 1495\u20131539 (2008)","journal-title":"Artifical Intelligence"},{"key":"39_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: Proc. IJCAI 2005, Edinburgh, Scotland, UK, pp. 90\u201396. Professional Book Center (2005)"},{"key":"39_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"issue":"1","key":"39_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W. Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence\u00a0175(1), 278\u2013298 (2011)","journal-title":"Artificial Intelligence"},{"key":"39_CR12","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"39_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"issue":"1","key":"39_CR14","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. Artificial Intelligence\u00a0175(1), 236\u2013263 (2011)","journal-title":"Artificial Intelligence"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"issue":"3","key":"39_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G. Gottlob","year":"1992","unstructured":"Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic and Computation\u00a02(3), 397\u2013425 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"39_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-89982-2_8","volume-title":"Logic Programming","author":"V. Lifschitz","year":"2008","unstructured":"Lifschitz, V.: Twelve Definitions of a Stable Model. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 37\u201351. Springer, Heidelberg (2008)"},{"issue":"3-4","key":"39_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"39_CR19","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.\u00a05366, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"39_CR20","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 and Practice of Logic Programming\u00a07, 301\u2013353 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"39_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24609-1_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"N. Pelov","year":"2003","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Partial Stable Models for Logic Programs with Aggregates. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 207\u2013219. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"39_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013(1-2), 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"39_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1093\/logcom\/6.2.295","volume":"6","author":"G. Schwarz","year":"1996","unstructured":"Schwarz, G., Truszczynski, M.: Nonmonotonic reasoning is sometimes simpler! Journal of Logic and Computation\u00a06(2), 295\u2013308 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"39_CR24","unstructured":"Shen, Y.-D.: Well-supported semantics for description logic programs. In: Proc. IJCAI 2011, IJCAI\/AAAI, pp. 1081\u20131086, Barcelona, Spain (2011)"},{"key":"39_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-04238-6_24","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y.-D. Shen","year":"2009","unstructured":"Shen, Y.-D., You, J.-H.: A Default Approach to Semantics of Logic Programs with Constraint Atoms. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 277\u2013289. Springer, Heidelberg (2009)"},{"key":"39_CR26","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S1471068406002936","volume":"7","author":"T.C. Son","year":"2007","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming\u00a07, 355\u2013375 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"39_CR27","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.2171","volume":"29","author":"T.C. Son","year":"2007","unstructured":"Son, T.C., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. Journal of Artificial Intelligence Research\u00a029, 353\u2013389 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"39_CR28","doi-asserted-by":"crossref","unstructured":"Truszczynski, M.: Modal interpretations of default logic. In: Proc. IJCAI 1991, pp. 393\u2013398 (1991)","DOI":"10.1017\/CBO9780511570667.009"},{"issue":"16-17","key":"39_CR29","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1016\/j.artint.2010.08.004","volume":"174","author":"M. Truszczynski","year":"2010","unstructured":"Truszczynski, M.: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs. Artificial Intelligence\u00a0174(16-17), 1285\u20131306 (2010)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"39_CR30","doi-asserted-by":"publisher","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\u00a038(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"39_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72200-7_20","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J.-H. You","year":"2007","unstructured":"You, J.-H., Yuan, L.-Y., Liu, G., Shen, Y.-D.: Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 228\u2013240. Springer, Heidelberg (2007)"},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Zhang, Y.: Progression semantics for disjunctive logic programs. In: Proc. AAAI 2011, pp. 286\u2013291 (2011)","DOI":"10.1609\/aaai.v25i1.7843"}],"container-title":["Lecture Notes in Computer Science","Correct Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30743-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T02:01:04Z","timestamp":1687485664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30743-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307423","9783642307430"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30743-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}