{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T07:53:34Z","timestamp":1719820414738},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,29]],"date-time":"2009-09-29T00:00:00Z","timestamp":1254182400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10472-009-9161-6","type":"journal-article","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T09:21:07Z","timestamp":1254129667000},"page":"125-160","source":"Crossref","is-referenced-by-count":3,"title":["General default logic"],"prefix":"10.1007","volume":"57","author":[{"given":"Yi","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangzhen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,29]]},"reference":[{"key":"9161_CR1","volume-title":"A Semantic Web Primer","author":"G Antoniou","year":"2004","unstructured":"Antoniou, G., van Harmelen, F.: A Semantic Web Primer. MIT, Cambridge (2004)"},{"issue":"1","key":"9161_CR2","first-page":"86","volume":"78","author":"N Bidoit","year":"1991","unstructured":"Bidoit, N., Froidevaux, C.: Negation by default and unstratifiable logic programs. Theor. Comput. Sci. 78(1), 86\u2013112 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9161_CR3","doi-asserted-by":"crossref","unstructured":"Borgida, A., Brachman, R.J., McGuinness, D.L., Resnick, L.A.: CLASSIC: a structural data model for objects. In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pp. 58\u201367 (1989)","DOI":"10.1145\/67544.66932"},{"key":"9161_CR4","first-page":"293","volume-title":"Logics and Databases","author":"KL Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logics and Databases, pp.\u00a0293\u2013322. Plenum, New York (1978)"},{"key":"9161_CR5","unstructured":"Delgrande, J., Schaub, T.: Compiling reasoning with and about preferences into default logic. In: Proceedings of IJCAI\u201997, pp. 168\u2013174 (1997)"},{"issue":"3","key":"9161_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1008687430626","volume":"10","author":"FM Donini","year":"1998","unstructured":"Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: integrating datalog and description logics. J. Intell. Inf. Syst. 10(3), 227\u2013252 (1998)","journal-title":"J. Intell. Inf. Syst."},{"key":"9161_CR7","unstructured":"Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: International Logic Programming Symposium, pp. 266\u2013278 (1993)"},{"key":"9161_CR8","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G.: The complexity class $\\Theta^2_p$ : recent results and applications in AI and modal logic. In: FCT \u201997: Proceedings of the 11th International Symposium on Fundamentals of Computation Theory, pp. 1\u201318 (1997)","DOI":"10.1007\/BFb0036168"},{"key":"9161_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Proceedings of LPNMR\u201904, pp. 87\u201399 (2004)","DOI":"10.1007\/978-3-540-24609-1_10"},{"key":"9161_CR10","doi-asserted-by":"crossref","unstructured":"Ferraris, P.: Answer sets for propositional theories. In: Proceedings of LPNMR\u201905, pp. 119\u2013131 (2005)","DOI":"10.1007\/11546207_10"},{"key":"9161_CR11","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP\u201988, pp.\u00a01070\u20131080 (1988)"},{"key":"9161_CR12","doi-asserted-by":"crossref","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 Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"9161_CR13","unstructured":"Gelfond, M., Lifschitz, V., Przymusinska, H., Truszczynski, M.: Disjunctive defaults. In: Proceedings of KR\u201991, pp. 230\u2013237 (1991)"},{"issue":"1\u20132","key":"9161_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01530762","volume":"12","author":"M Gelfond","year":"1994","unstructured":"Gelfond, M.: Logic programming and reasoning with incomplete information. Ann. Math. Artif. Intell. 12(1\u20132), 89\u2013116 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"9161_CR15","doi-asserted-by":"crossref","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. J. Log. Comput. 2(3), 397\u2013425 (1992)","journal-title":"J. Log. Comput."},{"issue":"2","key":"9161_CR16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/201019.201031","volume":"42","author":"G Gottlob","year":"1995","unstructured":"Gottlob, G.: NP trees and Carnap\u2019s modal logic. J. ACM 42(2), 421\u2013457 (1995)","journal-title":"J. ACM"},{"key":"9161_CR17","doi-asserted-by":"crossref","unstructured":"Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic (2003)","DOI":"10.2139\/ssrn.460986"},{"issue":"3","key":"9161_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"JY Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54(3), 319\u2013379 (1992)","journal-title":"Artif. Intell."},{"key":"9161_CR19","doi-asserted-by":"crossref","unstructured":"Horrocks, I., Patel-Schneider, P.F.: A proposal for an owl rules language. In: Proceedings of WWW\u201904, pp. 723\u2013731 (2004)","DOI":"10.1145\/988672.988771"},{"key":"9161_CR20","doi-asserted-by":"crossref","unstructured":"Janhunen, T.: On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. In: Proceedings of JELIA\u201998. LNCS, vol.\u00a01489, pp.\u00a0216\u2013232 (1998)","DOI":"10.1007\/3-540-49545-2_15"},{"issue":"3","key":"9161_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","volume":"35","author":"K Konolige","year":"1988","unstructured":"Konolige, K.: On the relation between default and autoepistemic logic. Artif. Intell. 35(3), 343\u2013382 (1988)","journal-title":"Artif. Intell."},{"issue":"3","key":"9161_CR22","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"RE Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9161_CR23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.datak.2005.03.002","volume":"55","author":"P Liberatore","year":"2005","unstructured":"Liberatore, P., Schaerf, M.: The complexity of model checking for propositional default logics. Data Knowl. Eng. 55(2), 189\u2013202 (2005)","journal-title":"Data Knowl. Eng."},{"key":"9161_CR24","unstructured":"Lifschitz, V.: Nonmonotonic databases and epistemic queries. In: IJCAI\u201991, pp. 381\u2013386 (1991)"},{"issue":"3\u20134","key":"9161_CR25","doi-asserted-by":"crossref","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. Ann. Math. Artif. Intell. 25(3\u20134), 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"9161_CR26","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"9161_CR27","unstructured":"Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. In: Proceedings of IJCAI\u201905, pp.\u00a0516\u2013521 (2005)"},{"key":"9161_CR28","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(92)90019-T","volume":"57","author":"F Lin","year":"1992","unstructured":"Lin, F., Shoham, Y.: A logic of knowledge and justified assumptions. Artif. Intell. 57, 271\u2013289 (1992)","journal-title":"Artif. Intell."},{"key":"9161_CR29","unstructured":"Lin, F., Zhou, Y.: From answer set logic programming to circumscription via logic of GK. In: Proceedings of the IJCAI\u201907, 441\u2013446 (2007)"},{"issue":"3","key":"9161_CR30","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"V Marek","year":"1991","unstructured":"Marek, V., Truszczynski, M.: Autoepistemic logic. J. ACM 38(3), 588\u2013619 (1991)","journal-title":"J. ACM"},{"key":"9161_CR31","unstructured":"Moore, R.: Possible-world semantics for autoepistemic logic. In: Readings in Nonmonotonic Reasoning, pp.\u00a0137\u2013142 (1987)"},{"key":"9161_CR32","unstructured":"Motik, B., Rosati, R.: A faithful integration of description logics with logic programming. In: Proceedings of IJCAI\u201907, pp. 477\u2013482 (2007)"},{"key":"9161_CR33","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: Towards automatic autoepistemic reasoning. In: Proceedings of JELIA \u201990, pp. 428\u2013443 (1991)","DOI":"10.1007\/BFb0018457"},{"key":"9161_CR34","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9161_CR35","doi-asserted-by":"crossref","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Proceedings of EPIA \u201901, pp. 306\u2013320 (2001)","DOI":"10.1007\/3-540-45329-6_31"},{"key":"9161_CR36","doi-asserted-by":"crossref","unstructured":"Pearce, D.: A new logical characterisation of stable models and answer sets. In: Proccedings of NMELP\u201996. LNCS, vol.\u00a01216, pp.\u00a057\u201370 (1997)","DOI":"10.1007\/BFb0023801"},{"key":"9161_CR37","doi-asserted-by":"crossref","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. Artif. Intell. 13, 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"key":"9161_CR38","unstructured":"Rosati, R.: Model checking for nonmonotonic logics: algorithms and complexity. In: Proceedings of IJCAI\u201999, pp. 76\u201383 (1999)"},{"key":"9161_CR39","unstructured":"Stillman, J.: The complexity of propositional default logics. In: Proceedings of AAAI\u201992, pp. 794\u2013799 (1992)"},{"key":"9161_CR40","unstructured":"Truszczynski, M.: Strong and uniform equivalence of nonmonotonic theories\u2014an algebraic approach. In: Proceedings of KR\u201906, pp. 389\u2013399 (2006)"},{"key":"9161_CR41","unstructured":"Truszczynski, M.: The modal logic S4F, the default logic, and the logic here-and-there. In: Proceedings of AAAI\u201907, pp. 508\u2013513 (2007)"},{"key":"9161_CR42","doi-asserted-by":"crossref","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Proceedings of LPNMR\u201901, pp. 81\u201392 (2001)","DOI":"10.1007\/3-540-45402-0_6"},{"key":"9161_CR43","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Lin, F., Zhang, Y.: General default logic. In: Proceedings of LPNMR\u201907, pp. 241\u2013253 (2007)","DOI":"10.1007\/978-3-540-72200-7_21"},{"key":"9161_CR44","unstructured":"Zhou, Y., Lin, F., Zhang, Y.: Embedding general default logic into the logic of GK. In: Proceedings of NMR\u201908, pp. 76\u201383 (2008)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9161-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-009-9161-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-009-9161-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:58:13Z","timestamp":1559152693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-009-9161-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,29]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s10472-009-9161-6","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,29]]}}}