{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:09:19Z","timestamp":1648894159931},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T00:00:00Z","timestamp":1348531200000},"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":[[2012,12]]},"DOI":"10.1007\/s10472-012-9320-z","type":"journal-article","created":{"date-parts":[[2012,9,24]],"date-time":"2012-09-24T09:36:08Z","timestamp":1348479368000},"page":"257-271","source":"Crossref","is-referenced-by-count":4,"title":["Embedding and automating conditional logics in classical higher-order logic"],"prefix":"10.1007","volume":"66","author":[{"given":"Christoph","family":"Benzm\u00fcller","sequence":"first","affiliation":[]},{"given":"Dov","family":"Gabbay","sequence":"additional","affiliation":[]},{"given":"Valerio","family":"Genovese","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Rispoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,25]]},"reference":[{"key":"9320_CR1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/2272982","volume":"37","author":"PB Andrews","year":"1972","unstructured":"Andrews, P.B.: General models and extensionality. J. Symb. Log. 37, 395\u2013397 (1972)","journal-title":"J. Symb. Log."},{"key":"9320_CR2","unstructured":"Andrews, P.B.: Church\u2019s type theory. In: The Stanford Encyclopedia Of Philosophy (2009)"},{"key":"9320_CR3","doi-asserted-by":"crossref","unstructured":"Benzm\u00fcller, C.: Verifying the modal logic cube is an easy task (for higher-order automated reasoners). In: Verification, Induction, Termination Analysis\u2014Festschrift C. Walther. LNCS, vol. 6463, pp. 117\u2013128. Springer (2010)","DOI":"10.1007\/978-3-642-17172-7_7"},{"key":"9320_CR4","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1093\/jigpal\/jzp080","volume":"18","author":"C Benzm\u00fcller","year":"2010","unstructured":"Benzm\u00fcller, C., Paulson, L.C.: Multimodal and intuitionistic logics in simple type theory. Log. J. IGPL 18, 881\u2013892 (2010)","journal-title":"Log. J. IGPL"},{"issue":"1","key":"9320_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(94)90096-5","volume":"68","author":"C Boutilier","year":"1994","unstructured":"Boutilier, C.: Conditional logics of normality: a modal approach. Artif. Intell. 68(1), 87\u2013154 (1994)","journal-title":"Artif. Intell."},{"key":"9320_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic: An Introduction","author":"BF Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)"},{"key":"9320_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. J. Symb. Log. 5, 56\u201368 (1940)","journal-title":"J. Symb. Log."},{"key":"9320_CR8","unstructured":"Crocco, G., Lamarre, P.: On the connection between non-monotonic inference systems and conditional logics. In: KR, pp. 565\u2013571 (1992)"},{"key":"9320_CR9","unstructured":"Genovese, V., Giordano, L., Gliozzi, V., Pozzato, G.L.: A constructive conditional logic for access control: a preliminary report. In: Proc. of ECAI 2010, pp. 1073\u20131074 (2010)"},{"key":"9320_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-8966-5","volume-title":"Topics in Conditional Logic","author":"D Nute","year":"1980","unstructured":"Nute, D.: Topics in Conditional Logic. Reidel, Dordrecht (1980)"},{"issue":"4","key":"9320_CR11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3166\/jancl.18.427-473","volume":"18","author":"N Olivetti","year":"2008","unstructured":"Olivetti, N., Pozzato, G.L.: Theorem proving for conditional logics: CondLean and GoalDuck. J. Appl. Non-class. Log. 18(4), 427\u2013473 (2008)","journal-title":"J. Appl. Non-class. Log."},{"key":"9320_CR12","doi-asserted-by":"crossref","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) (2007)","DOI":"10.1145\/1276920.1276924"},{"key":"9320_CR13","unstructured":"Pozzato, G.L.: Conditional and Preferential Logics: Proof Methods and Theorem Proving. Frontiers in Artificial Intelligence and Applications, vol. 208. IOS press (2010)"},{"key":"9320_CR14","unstructured":"Schr\u00f6der, L., Pattinson, D., Hausmann, D.: Optimal tableaux for conditional logics with cautious monotonicity. In: Proc. of ECAI 2010, pp. 707\u2013712 (2010)"},{"key":"9320_CR15","first-page":"98","volume-title":"Studies in Logical Theory, American Philosophical Quarterly, Monograph Series no.2","author":"R Stalnaker","year":"1968","unstructured":"Stalnaker, R.: A theory of conditionals. In: Rescher, N. (ed.) Studies in Logical Theory, American Philosophical Quarterly, Monograph Series no.2, pp. 98\u2013112. Blackwell, Oxford (1968)"},{"issue":"4","key":"9320_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10817-009-9143-8","volume":"43","author":"G Sutcliffe","year":"2009","unstructured":"Sutcliffe, G.: The tptp problem library and associated infrastructure. J. Autom. Reason. 43(4), 337\u2013362 (2009)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"9320_CR17","first-page":"1","volume":"3","author":"G Sutcliffe","year":"2010","unstructured":"Sutcliffe, G., Benzm\u00fcller, C.: Automated reasoning in higher-order logic using the TPTP THF infrastructure. J. Form. Reason. 3(1), 1\u201327 (2010)","journal-title":"J. Form. Reason."},{"key":"9320_CR18","unstructured":"Raths, T., Otten, J.: Implementing and evaluating theorem provers for first-order modal logics. In: Giese, M. (ed.) Proceedings of FTP 2011\u2014International Workshop on First-Order Theorem Proving, Bern, Switzerland, 4 Jul 2011. CEUR Workshop Proceedings, 2011. See also the online results at http:\/\/www.cs.uni-potsdam.de\/ti\/iltp\/qmltp\/"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9320-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-012-9320-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-012-9320-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T00:56:14Z","timestamp":1562201774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-012-9320-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,25]]},"references-count":18,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9320"],"URL":"https:\/\/doi.org\/10.1007\/s10472-012-9320-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,25]]}}}