{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:29:39Z","timestamp":1757543379876,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319942049"},{"type":"electronic","value":"9783319942056"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94205-6_33","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T12:22:50Z","timestamp":1530274970000},"page":"498-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Resolution-Based Calculus for Preferential Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9792-5346","authenticated-orcid":false,"given":"Cl\u00e1udia","family":"Nalon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5832-6666","authenticated-orcid":false,"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,30]]},"reference":[{"issue":"3","key":"33_CR1","first-page":"217","volume":"4","author":"L Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. JLC 4(3), 217\u2013247 (1994)","journal-title":"JLC"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BFb0054247","volume-title":"Automated Deduction \u2014 CADE-15","author":"B Beckert","year":"1998","unstructured":"Beckert, B., Gor\u00e9, R.: System description: leanK 2.0. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS, vol. 1421, pp. 51\u201355. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0054247"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1305\/ndjfl\/1093883341","volume":"22","author":"JP Burgess","year":"1981","unstructured":"Burgess, J.P.: Quick completeness proofs for some logics of conditionals. Notre Dame J. Formal Log. 22(1), 76\u201384 (1981)","journal-title":"Notre Dame J. Formal Log."},{"key":"33_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"B Chellas","year":"1980","unstructured":"Chellas, B.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-21401-6_14","volume-title":"Automated Deduction - CADE-25","author":"A David","year":"2015","unstructured":"David, A.: Deciding $$\\sf ATL^*$$ satisfiability by tableaux. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 214\u2013228. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21401-6_14"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/B978-1-4832-1452-8.50115-9","volume-title":"Principles of Knowledge Representation and Reasoning","author":"Nir Friedman","year":"1994","unstructured":"Friedman, N., Halpern, J.Y.: On the complexity of conditional logics. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Proceedings of KR 1994, pp. 202\u2013213. M. Kaufmann (1994)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11554554_25","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"O Gasquet","year":"2005","unstructured":"Gasquet, O., Herzig, A., Longin, D., Sahade, M.: LoTREC: logical tableaux research engineering companion. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 318\u2013322. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11554554_25"},{"issue":"3","key":"33_CR8","first-page":"18:1","volume":"10","author":"L Giordano","year":"2009","unstructured":"Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Analytic tableaux calculi for KLM logics of nonmonotonic reasoning. ACM Trans. Comput. Log. 10(3), 18:1\u201318:47 (2009)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"33_CR9","first-page":"21","volume":"10","author":"L Giordano","year":"2009","unstructured":"Giordano, L., Gliozzi, V., Olivetti, N., Schwind, C.: Tableau calculus for preference-based conditional logics: PCL and its extensions. ACM Trans. Comput. Log. 10(3), 21 (2009)","journal-title":"ACM Trans. Comput. Log."},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-08587-6_31","volume-title":"Automated Reasoning","author":"D Gor\u00edn","year":"2014","unstructured":"Gor\u00edn, D., Pattinson, D., Schr\u00f6der, L., Widmann, F., Wi\u00dfmann, T.: Cool \u2013 a generic reasoner for coalgebraic hybrid logics (system description). In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 396\u2013402. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08587-6_31"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/3-540-45744-5_59","volume-title":"Automated Reasoning","author":"V Haarslev","year":"2001","unstructured":"Haarslev, V., M\u00f6ller, R.: RACER system description. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 701\u2013705. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45744-5_59"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-24312-2_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"U Hustadt","year":"2015","unstructured":"Hustadt, U., Gainer, P., Dixon, C., Nalon, C., Zhang, L.: Ordered resolution for coalition logic. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 169\u2013184. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24312-2_12"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-319-40229-1_28","volume-title":"Automated Reasoning","author":"C Nalon","year":"2016","unstructured":"Nalon, C., Hustadt, U., Dixon, C.: K$$_{{\\rm S}}$$P: a resolution-based prover for multimodal K. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 406\u2013415. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40229-1_28"},{"issue":"2","key":"33_CR14","first-page":"109","volume":"9","author":"N Olivetti","year":"2015","unstructured":"Olivetti, N., Pozzato, G.L.: Nested sequent calculi and theorem proving for normal conditional logics: the theorem prover NESCOND. Intell. Artif. 9(2), 109\u2013125 (2015)","journal-title":"Intell. Artif."},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1276920.1276924","volume":"8","author":"N Olivetti","year":"2007","unstructured":"Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Log. 8(4), 22 (2007)","journal-title":"ACM Trans. Comput. Log."},{"key":"33_CR16","first-page":"293","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.A.: A structure-preserving clause form translation. JLC 2, 293\u2013304 (1986)","journal-title":"JLC"},{"issue":"2\u20133","key":"33_CR17","first-page":"91","volume":"15","author":"A Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2\u20133), 91\u2013110 (2002)","journal-title":"AI Commun."},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"unstructured":"Schr\u00f6der, L., Pattinson, D., Hausmann, D.: Optimal tableaux for conditional logics with cautious monotonicity. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of the ECAI 2010 Frontiers in Artificial Intelligence and Applications, vol. 215 , pp. 707\u2013712. IOS Press (2010)","key":"33_CR19"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-25984-8_15","volume-title":"Automated Reasoning","author":"S Schulz","year":"2004","unstructured":"Schulz, S.: System description: E 0.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 223\u2013228. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-25984-8_15"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11814771_26","volume-title":"Automated Reasoning","author":"D Tsarkov","year":"2006","unstructured":"Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: system description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 292\u2013297. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11814771_26"},{"key":"33_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02959-2_10"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94205-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T12:44:36Z","timestamp":1530276276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94205-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942049","9783319942056"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94205-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}