{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:11:08Z","timestamp":1743005468502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089089"},{"type":"electronic","value":"9783319089096"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-08909-6_5","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T06:02:05Z","timestamp":1405058525000},"page":"65-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Axiomatic Rejection for the Description Logic $$\\mathcal {ALC}$$"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Berger","sequence":"first","affiliation":[]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"5_CR1","volume-title":"Aristotle\u2019s Syllogistic from the Standpoint of Modern Formal Logic","author":"J \u0141ukasiewicz","year":"1957","unstructured":"\u0141ukasiewicz, J.: Aristotle\u2019s Syllogistic from the Standpoint of Modern Formal Logic. Clarendon Press, Oxford (1957)"},{"key":"5_CR2","unstructured":"Bonatti, P.A.: A Gentzen system for non-theorems. Technical report CD-TR 93\/52, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (1993)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Tiomkin, M.L.: Proving unprovability. In: Proceedings of the LICS \u201988, pp. 22\u201326. IEEE Computer Society (1988)","DOI":"10.1109\/LICS.1988.5097"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symbolic Logic 57(3), 795\u2013807 (1992)","journal-title":"J. Symbolic Logic"},{"issue":"1\u20132","key":"5_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BF01988049","volume":"3","author":"G Kreisel","year":"1957","unstructured":"Kreisel, G., Putnam, H.: Eine Unableitbarkeitsbeweismethode f\u00fcr den Intuitionistischen Aussagenkalk\u00fcl. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung 3(1\u20132), 74\u201378 (1957)","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01054714","volume":"53","author":"V Goranko","year":"1994","unstructured":"Goranko, V.: Refutation systems in modal logic. Studia Logica 53, 299\u2013324 (1994)","journal-title":"Studia Logica"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-94-017-2798-3_4","volume-title":"Proof Theory of Modal Logic","author":"T Skura","year":"1996","unstructured":"Skura, T.: Refutations and proofs in S4. In: Wansing, H. (ed.) Proof Theory of Modal Logic, pp. 45\u201351. Kluwer, Dordrecht (1996)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-20895-9_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Oetsch","year":"2011","unstructured":"Oetsch, J., Tompits, H.: Gentzen-type refutation systems for three-valued logics with an application to disproving strong equivalence. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 254\u2013259. Springer, Heidelberg (2011)"},{"issue":"2754","key":"5_CR9","first-page":"179","volume":"23","author":"U Wybraniec-Skardowska","year":"2005","unstructured":"Wybraniec-Skardowska, U.: On the notion and function of the rejection of propositions. Acta Universitatis Wratislaviensis Logika 23(2754), 179\u2013202 (2005)","journal-title":"Acta Universitatis Wratislaviensis Logika"},{"issue":"10","key":"5_CR10","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1002\/int.20304","volume":"23","author":"R Caferra","year":"2008","unstructured":"Caferra, R., Peltier, N.: Accepting\/rejecting propositions from accepted\/rejected propositions: a unifying overview. Int. J. Intell. Syst. 23(10), 999\u20131020 (2008)","journal-title":"Int. J. Intell. Syst."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/505372.505374","volume":"3","author":"PA Bonatti","year":"2002","unstructured":"Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Logic 3(2), 226\u2013278 (2002)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1\u20132","key":"5_CR12","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. Artif. Intell. 13(1\u20132), 81\u2013132 (1980)","journal-title":"Artif. Intell."},{"key":"5_CR13","unstructured":"Moore, R.C.: Semantical considerations on nonmonotonic logic. In: Proceedings of the IJCAI \u201983, pp. 272\u2013279. William Kaufmann (1983)"},{"issue":"1\u20132","key":"5_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artif. Intell. 13(1\u20132), 27\u201339 (1980)","journal-title":"Artif. Intell."},{"key":"5_CR15","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","author":"F Baader","year":"2003","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York (2003)"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4002-3","volume-title":"A Proof Theory for Description Logics","author":"A Rademaker","year":"2012","unstructured":"Rademaker, A.: A Proof Theory for Description Logics. Springer, New York (2012)"},{"key":"5_CR17","unstructured":"Borgida, A., Franconi, E., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F.: Explaining $$\\cal ALC$$ subsumption. In: Proceedings of the DL \u201999. CEUR Workshop Proceedings, vol. 22 (1999)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F Baader","year":"2001","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69, 5\u201340 (2001)","journal-title":"Studia Logica"},{"key":"5_CR19","series-title":"Studies in Logic and the Foundations of Mathematics Series","volume-title":"Proof Theory","author":"G Takeuti","year":"1975","unstructured":"Takeuti, G.: Proof Theory. Studies in Logic and the Foundations of Mathematics Series. North-Holland, Amsterdam (1975)"},{"key":"5_CR20","unstructured":"Schild, K.: A Correspondence theory for terminological logics: preliminary report. In: Proceedings of the IJCAI \u201991, pp. 466\u2013471. Morgan Kaufmann Publishers Inc. (1991)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-69778-0_30","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"I Horrocks","year":"1998","unstructured":"Horrocks, I.: The FaCT system. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 307\u2013312. Springer, Heidelberg (1998)"},{"key":"5_CR22","unstructured":"Goranko, V., Otto, M.: Model theory of modal logic. In Blackburn, P., Wolter, F., van Benthem, J. (eds.) Handbook of Modal Logic, pp. 255\u2013325. Elsevier (2006)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1016\/B978-044450813-3\/50027-8","volume-title":"Handbook of Automated Reasoning","author":"C Ferm\u00fcller","year":"2001","unstructured":"Ferm\u00fcller, C., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Robinson, A., Vorkonov, A. (eds.) Handbook of Automated Reasoning, pp. 1791\u20131849. Elsevier, Amsterdam (2001)"}],"container-title":["Lecture Notes in Computer Science","Declarative Programming and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08909-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:35:10Z","timestamp":1676637310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08909-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089089","9783319089096"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08909-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}