{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:29:43Z","timestamp":1725748183847},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405365"},{"type":"electronic","value":"9783642405372"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40537-2_11","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T12:33:51Z","timestamp":1378902831000},"page":"104-118","source":"Crossref","is-referenced-by-count":3,"title":["A Terminating Evaluation-Driven Variant of G3i"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Ferrari","sequence":"first","affiliation":[]},{"given":"Camillo","family":"Fiorentini","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Fiorino","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press (1997)","DOI":"10.1093\/oso\/9780198537793.001.0001"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11780342_19","volume-title":"Logical Approaches to Computational Barriers","author":"R. Dyckhoff","year":"2006","unstructured":"Dyckhoff, R., Lengrand, S.: LJQ: A Strongly Focused Calculus for Intuitionistic Logic. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 173\u2013185. Springer, Heidelberg (2006)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10817-012-9252-7","volume":"51","author":"M. Ferrari","year":"2013","unstructured":"Ferrari, M., Fiorentini, C., Fiorino, G.: Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models. Journal of Automated Reasoning\u00a051(2), 129\u2013149 (2013)","journal-title":"Journal of Automated Reasoning"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2159531.2159536","volume":"13","author":"M. Ferrari","year":"2012","unstructured":"Ferrari, M., Fiorentini, C., Fiorino, G.: Simplification rules for intuitionistic propositional tableaux. ACM Transactions on Computational Logic (TOCL)\u00a013(2), 14:1\u201314:23 (2012)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Olivetti, N.: Goal-Directed Proof Theory. Springer (2000)","DOI":"10.1007\/978-94-017-1713-7"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-61208-4_14","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"A. Heuerding","year":"1996","unstructured":"Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol.\u00a01071, pp. 210\u2013225. Springer, Heidelberg (1996)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BFb0027414","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J.M. Howe","year":"1997","unstructured":"Howe, J.M.: Two loop detection mechanisms: A comparision. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol.\u00a01227, pp. 188\u2013200. Springer, Heidelberg (1997)"},{"key":"11_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-69778-0_24","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"F. Massacci","year":"1998","unstructured":"Massacci, F.: Simplification: A general constraint propagation technique for propositional and modal tableaux. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol.\u00a01397, pp. 217\u2013231. Springer, Heidelberg (1998)"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/9783110886726.225","volume-title":"Symposia Gaussiana, Conference\u00a0A","author":"L. Pinto","year":"1995","unstructured":"Pinto, L., Dyckhoff, R.: Loop-free construction of counter-models for intuitionistic propositional logic. In: Behara, M., et al. (eds.) Symposia Gaussiana, Conference\u00a0A, pp. 225\u2013232. Walter de Gruyter, Berlin (1995)"},{"key":"11_CR10","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol.\u00a043. Cambridge University Press (1996)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40537-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T20:18:43Z","timestamp":1715977123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40537-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405365","9783642405372"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40537-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}