{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:48:23Z","timestamp":1725518903238},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878025"},{"type":"electronic","value":"9783540878032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87803-2_34","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T10:35:16Z","timestamp":1222166116000},"page":"416-428","source":"Crossref","is-referenced-by-count":2,"title":["Rule Calculus: Semantics, Axioms and Applications"],"prefix":"10.1007","author":[{"given":"Yi","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Gelfond, M., Lifschitz, V., Przymusinska, H., Truszczy\u0144ski, M.: Disjunctive defaults. In: Proceedings of the KR 1991, pp. 230\u2013237 (1991)"},{"key":"34_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"key":"34_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-72200-7_21","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Zhou","year":"2007","unstructured":"Zhou, Y., Lin, F., Zhang, Y.: General default logic. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 241\u2013253. Springer, Heidelberg (2007)"},{"key":"34_CR4","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, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(02)00189-3","volume":"139","author":"R. Ben-Eliyahu-Zohary","year":"2002","unstructured":"Ben-Eliyahu-Zohary, R.: Yet some more complexity results for default logic. Artificial Intelligence\u00a0139(1), 1\u201320 (2002)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"34_CR6","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"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S147106840200159X","volume":"3","author":"D.H.J.D. Jongh","year":"2003","unstructured":"Jongh, D.H.J.D., Hendriks, L.: Characterization of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming\u00a03(3), 259\u2013270 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"6","key":"34_CR8","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1017\/S1471068407003110","volume":"7","author":"P. Cabalar","year":"2007","unstructured":"Cabalar, P., Ferraris, P.: Propositional theories are strongly equivalent to logic programs. Theory and Practice of Logic Programming\u00a07(6), 745\u2013759 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"34_CR9","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)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"issue":"4","key":"34_CR11","doi-asserted-by":"publisher","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 Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"van Dalen, D.: Intuitionistic logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Alternatives to Classical Logic, vol.\u00a0III, pp. 225\u2013339 (1986)","DOI":"10.1007\/978-94-009-5203-4_4"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.1113","volume":"18","author":"J. Lang","year":"2003","unstructured":"Lang, J., Liberatore, P., Marquis, P.: Propositional independence: formula-variable independence and forgetting. Journal of Artificial Intelligence Research (JAIR)\u00a018, 391\u2013443 (2003)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"34_CR14","unstructured":"Plotkin, G.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, pp. 153\u2013163 (1970)"},{"key":"34_CR15","volume-title":"The MIT Encyclopedia of the Cognitive Sciences (MITECS)","author":"S. Muggleton","year":"1999","unstructured":"Muggleton, S.: Inductive logic programming. In: The MIT Encyclopedia of the Cognitive Sciences (MITECS). MIT Press, Cambridge (1999)"},{"key":"34_CR16","unstructured":"Inoue, K., Sakama, C.: Generality and equivalence relations in default logic. In: Proceedings of the AAAI 2007, pp. 434\u2013439 (2007)"},{"key":"34_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511663109","volume-title":"Updating logical databases","author":"M. Winslett","year":"1990","unstructured":"Winslett, M.: Updating logical databases. Cambridge University Press, Cambridge (1990)"},{"key":"34_CR18","series-title":"Lecture Notes in Artificial Intelligence","first-page":"87","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2004)"},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.2472","volume":"31","author":"K. Wong","year":"2008","unstructured":"Wong, K.: Sound and complete inference rules for se-consequence. Journal of Artificial Intelligence Research\u00a031, 205\u2013216 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2-3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0004-3702(92)90071-5","volume":"53","author":"H. Geffner","year":"1992","unstructured":"Geffner, H., Pearl, J.: Conditional entailment: bridging two approaches to default reasoning. Artificial Intelligence\u00a053(2-3), 209\u2013244 (1992)","journal-title":"Artificial Intelligence"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Nute, D.: Conditional logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Extensions of Classical Logic, vol.\u00a0II, pp. 387\u2013439 (1984)","DOI":"10.1007\/978-94-009-6259-0_8"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0027408","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P.A. Bonatti","year":"1997","unstructured":"Bonatti, P.A., Olivetti, N.: A sequent calculus for skeptical default logic. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol.\u00a01227, pp. 107\u2013121. Springer, Heidelberg (1997)"},{"key":"34_CR23","unstructured":"Lakemeyer, G., Levesque, H.J.: Towards an axiom system for default logic. In: Proceedings of the AAAI 2006 (2006)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87803-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:59Z","timestamp":1619524199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87803-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540878025","9783540878032"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87803-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}