{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:50:16Z","timestamp":1746521416872,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030294359"},{"type":"electronic","value":"9783030294366"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29436-6_10","type":"book-chapter","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T16:04:02Z","timestamp":1566317042000},"page":"161-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Tableaux Calculus for Default Intuitionistic Logic"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Cassano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Fervari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Areces","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo F.","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1093\/logcom\/6.2.205","volume":"6","author":"G Amati","year":"1996","unstructured":"Amati, G., Aiello, L., Gabbay, D., Pirri, F.: A proof theoretical approach to default reasoning I: tableaux for default logic. J. Log. Comput. 6(2), 205\u2013231 (1996)","journal-title":"J. Log. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5040.001.0001","volume-title":"Nonmonotonic Reasoning","author":"G Antoniou","year":"1997","unstructured":"Antoniou, G.: Nonmonotonic Reasoning. The MIT Press, Cambridge (1997)"},{"doi-asserted-by":"crossref","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, et al. [4], pp. 821\u2013868","key":"10_CR3","DOI":"10.1016\/S1570-2464(07)80017-6"},{"volume-title":"Handbook of Modal Logic","year":"2007","unstructured":"Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic. Elsevier, Amsterdam (2007)","key":"10_CR4"},{"unstructured":"Bochman, A.: Non-monotonic reasoning. In: Gabbay and Woods [20], pp. 555\u2013632","key":"10_CR5"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","volume":"50","author":"G Brewka","year":"1991","unstructured":"Brewka, G.: Cumulative default logic: in defense of nonmonotonic inference rules. Artif. Intell. 50(2), 183\u2013205 (1991)","journal-title":"Artif. Intell."},{"unstructured":"Cassano, V., Areces, C., Castro, P.: Reasoning about prescription and description using prioritized default rules. In: Barthe, G., Sutcliffe, G., Veanes, M. (eds.) 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-22), EPiC Series in Computing, vol. 57, pp. 196\u2013213. EasyChair (2018)","key":"10_CR7"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-030-19570-0_44","volume-title":"Logics in Artificial Intelligence","author":"V Cassano","year":"2019","unstructured":"Cassano, V., Fervari, R., Areces, C., Castro, P.F.: Interpolation and beth definability in default logics. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 675\u2013691. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_44"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-319-24312-2_2","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"V Cassano","year":"2015","unstructured":"Cassano, V., Pombo, C.G.L., Maibaum, T.S.E.: A propositional tableaux based proof calculus for reasoning with default rules. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 6\u201321. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24312-2_2"},{"unstructured":"Cholewinski, P., Marek, V., Truszczynski, M.: Default reasoning system DeReS. In: 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 518\u2013528. Morgan Kaufmann (1996)","key":"10_CR10"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-662-48899-7_43","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Claessen","year":"2015","unstructured":"Claessen, K., Ros\u00e9n, D.: SAT modulo intuitionistic implications. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 622\u2013637. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_43"},{"issue":"1\u20132","key":"10_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(94)90106-6","volume":"70","author":"J Delgrande","year":"1994","unstructured":"Delgrande, J., Schaub, T., Jackson, W.: Alternative approaches to default logic. Artif. Intell. 70(1\u20132), 167\u2013237 (1994)","journal-title":"Artif. Intell."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"unstructured":"Egly, U., Tompits, H.: A sequent calculus for intuitionistic default logic. In: 12th Workshop Logic Programming (WLP 1997), pp. 69\u201379 (1997)","key":"10_CR14"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3166\/jancl.19.149-166","volume":"19","author":"M Ferrari","year":"2009","unstructured":"Ferrari, M., Fiorentini, C., Fiorino, G.: A tableau calculus for propositional intuitionistic logic with a refined treatment of nested implications. J. Appl. Non-Class. Log. 19, 149\u2013166 (2009)","journal-title":"J. Appl. Non-Class. Log."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-16242-8_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Ferrari","year":"2010","unstructured":"Ferrari, M., Fiorentini, C., Fiorino, G.: fCube: an efficient prover for intuitionistic propositional logic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 294\u2013301. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_21"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof Methods for Modal and Intuitionistic Logics","author":"M Fitting","year":"1983","unstructured":"Fitting, M.: Proof Methods for Modal and Intuitionistic Logics. Springer, Dordrecht (1983). https:\/\/doi.org\/10.1007\/978-94-017-2794-5"},{"unstructured":"Font, J.: Abstract Algebraic Logic: An Introductory Textbook, 1st edn. College Publications (2016)","key":"10_CR18"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BFb0000064","volume-title":"6th Conference on Automated Deduction","author":"DM Gabbay","year":"1982","unstructured":"Gabbay, D.M.: Intuitionistic basis for non-monotonic logic. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol. 138, pp. 260\u2013273. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0000064"},{"volume-title":"Handbook of the History of Logic: The Many Valued and Nonmonotonic Turn in Logic","year":"2007","unstructured":"Gabbay, D., Woods, J. (eds.): Handbook of the History of Logic: The Many Valued and Nonmonotonic Turn in Logic, vol. 8. North-Holland, Amsterdam (2007)","key":"10_CR20"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-08587-6_19","volume-title":"Automated Reasoning","author":"R Gor\u00e9","year":"2014","unstructured":"Gor\u00e9, R., Thomson, J., Wu, J.: A history-based theorem prover for intuitionistic propositional logic using global caching: IntHistGC system description. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 262\u2013268. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_19"},{"unstructured":"Haeusler, E., de Paiva, V., Rademaker, A.: Intuitionistic logic and legal ontologies. In: 23rd International Conference on Legal Knowledge and Information Systems (JURIX 2010), Frontiers in Artificial Intelligence and Applications, vol. 223, pages 155\u2013158. IOS Press (2010)","key":"10_CR22"},{"key":"10_CR23","volume-title":"An Introduction to Modal Logic","author":"G Hughes","year":"1968","unstructured":"Hughes, G., Cresswell, M.: An Introduction to Modal Logic. Methuen, London (1968)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-69778-0_22","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"U Hustadt","year":"1998","unstructured":"Hustadt, U., Schmidt, R.A.: Simplification and backjumping in modal tableau. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 187\u2013201. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69778-0_22"},{"issue":"4","key":"10_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10849-009-9087-8","volume":"18","author":"M Kaminski","year":"2009","unstructured":"Kaminski, M., Smolka, G.: Terminating tableau systems for hybrid logic with difference and converse. J. Log. Lang. Inf. 18(4), 437\u2013464 (2009)","journal-title":"J. Log. Lang. Inf."},{"key":"10_CR26","series-title":"Logic, Argumentation & Reasoning","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-58507-9_2","volume-title":"Applications of Formal Philosophy","author":"A Kapsner","year":"2017","unstructured":"Kapsner, A.: The logic of guilt, innocence and legal discourse. In: Urbaniak, R., Payette, G. (eds.) Applications of Formal Philosophy. LARI, vol. 14, pp. 7\u201324. Springer, Cham (2017)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1467-8640.1988.tb00086.x","volume":"4","author":"W \u0141ukaszewicz","year":"1988","unstructured":"\u0141ukaszewicz, W.: Considerations on default logic: an alternative approach. Comput. Intell. 4, 1\u201316 (1988)","journal-title":"Comput. Intell."},{"unstructured":"Makinson, D., van der Torre, L.: What is input\/output logic? Input\/output logic, constraints, permissions. In: Boella, G., van der Torre, L., Verhagen, H. (eds.) Normative Multi-agent Systems, Dagstuhl Seminar Proceedings, vol. 07122. Internationales Begegnungsund Forschungszentrum f\u00fcr Informatik (2007)","key":"10_CR28"},{"unstructured":"Mikitiuk, A., Truszczynski, M.: Constrained and rational default logics. In: 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 1509\u20131517 (1995)","key":"10_CR29"},{"issue":"3","key":"10_CR30","first-page":"325","volume":"4","author":"M Osorio","year":"2004","unstructured":"Osorio, M., Navarro P\u00e9rez, J., Arrazola, J.: Applications of intuitionistic logic in answer set programming. TPLP 4(3), 325\u2013354 (2004)","journal-title":"TPLP"},{"key":"10_CR31","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-94-007-7759-0_13","volume-title":"David Makinson on Classical Methods for Non-Classical Problems","author":"X Parent","year":"2014","unstructured":"Parent, X., Gabbay, D., Torre, L.: Intuitionistic basis for input\/output logic. In: Hansson, S.O. (ed.) David Makinson on Classical Methods for Non-Classical Problems. OCL, vol. 3, pp. 263\u2013286. Springer, Dordrecht (2014). https:\/\/doi.org\/10.1007\/978-94-007-7759-0_13"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0743-1066(98)10015-8","volume":"38","author":"D Pearce","year":"1999","unstructured":"Pearce, D.: Stable inference as intuitionistic validity. J. Log. Program. 38(1), 79\u201391 (1999)","journal-title":"J. Log. Program."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-45619-8_28","volume-title":"Logic Programming","author":"D Pearce","year":"2002","unstructured":"Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 405\u2013420. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45619-8_28"},{"unstructured":"Poole, D.: What the lottery paradox tells us about default reasoning. In: 1st International Conference on Principles of Knowledge Representation and Reasoning (KR 1989), pp. 333\u2013340 (1989)","key":"10_CR34"},{"key":"10_CR35","volume-title":"An Introduction to Non-Classical Logic: From If to Is","author":"G Priest","year":"2000","unstructured":"Priest, G.: An Introduction to Non-Classical Logic: From If to Is. Cambridge University Press, Cambridge (2000)"},{"issue":"1\u20133","key":"10_CR36","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10817-006-9060-z","volume":"38","author":"T Raths","year":"2007","unstructured":"Raths, T., Otten, J., Kreitz, C.: The ILTP problem library for intuitionistic logic. J. Autom. Reason. 38(1\u20133), 261\u2013271 (2007)","journal-title":"J. Autom. Reason."},{"issue":"1\u20132","key":"10_CR37","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."},{"issue":"4","key":"10_CR38","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.2307\/2275363","volume":"57","author":"G Servi","year":"1992","unstructured":"Servi, G.: Nonmonotonic consequence based on intuitionistic logic. J. Symb. Log. 57(4), 1176\u20131197 (1992)","journal-title":"J. Symb. Log."},{"issue":"1","key":"10_CR39","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1305\/ndjfl\/1040308828","volume":"36","author":"H Wansing","year":"1995","unstructured":"Wansing, H.: Semantics-based nonmonotonic inference. Notre Dame J. Formal Log. 36(1), 44\u201354 (1995)","journal-title":"Notre Dame J. Formal Log."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 27"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29436-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:54:27Z","timestamp":1657576467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29436-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030294359","9783030294366"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29436-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Natal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mat.ufrn.br\/CADE-27\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}