{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:31Z","timestamp":1725851971966},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_23","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"390-407","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Focused and Synthetic Nested Sequents"],"prefix":"10.1007","author":[{"given":"Kaustuv","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Marin","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J-M Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. Logic Comput. 2(3), 297\u2013347 (1992)","journal-title":"J. Logic Comput."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications: European Logic Colloquium, pp. 1\u201332. Clarendon Press (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"ND Belnap Jr","year":"1982","unstructured":"Belnap Jr., N.D.: Display logic. J. Philos. Logic 11, 375\u2013417 (1982)","journal-title":"J. Philos. Logic"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-16242-8_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T Brock-Nannestad","year":"2010","unstructured":"Brock-Nannestad, T., Sch\u00fcrmann, C.: Focused natural deduction. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 157\u2013171. Springer, Heidelberg (2010)"},{"issue":"6","key":"23_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00153-009-0137-3","volume":"48","author":"K Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Arch. Math. Logic 48(6), 551\u2013577 (2009)","journal-title":"Arch. Math. Logic"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-89439-1_33","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K Chaudhuri","year":"2008","unstructured":"Chaudhuri, K.: Focusing strategies in the sequent calculus of synthetic connectives. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 467\u2013481. Springer, Heidelberg (2008)"},{"key":"23_CR7","unstructured":"Chaudhuri, K., Guenot, N., Stra\u00dfburger, L.: The focused calculus of structures. In: Computer Science Logic: 20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), pp. 159\u2013173. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Sept 2011"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1093\/logcom\/exu030","volume":"26","author":"Kaustuv Chaudhuri","year":"2014","unstructured":"Chaudhuri, K., Hetzl, S., Miller, D.: A multi-focused proof system isomorphic to expansion proofs. J. Logic Comput., June 2014. doi: 10.1093\/logcom\/exu030","journal-title":"Journal of Logic and Computation"},{"key":"23_CR9","unstructured":"Chaudhuri, K., Marin, S., Stra\u00dfburger, L.: Focused and Synthetic Nested Sequents. Technical report, Inria (2016). https:\/\/hal.inria.fr\/hal-01251722"},{"key":"23_CR10","series-title":"International Federation for Information Processing","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-0-387-09680-3_26","volume-title":"Fifth International Conference on Theoretical Computer Science","author":"K Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Miller, D., Saurin, A.: Canonical sequent proofs via multi-focusing. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) IFIP-TCS 2008. IFIP, vol. 273, pp. 383\u2013396. Springer, Heidelberg (2008)"},{"issue":"2\u20133","key":"23_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-007-9091-0","volume":"40","author":"K Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. J. Autom. Reasoning 40(2\u20133), 133\u2013177 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.apal.2011.09.004","volume":"163","author":"M Fitting","year":"2012","unstructured":"Fitting, M.: Prefixed tableaus and nested sequents. Ann. Pure Appl. Logic 163, 291\u2013313 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"23_CR13","unstructured":"Garson, J.: Modal logic. Stanford University, In The Stanford Encyclopedia of Philosophy (2008)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01053026","volume":"53","author":"R Kashima","year":"1994","unstructured":"Kashima, R.: Cut-free sequent calculi for some tense logics. Stud. Logica. 53(1), 119\u2013136 (1994)","journal-title":"Stud. Logica."},{"key":"23_CR15","unstructured":"Laurent, O.: \u00c9tude de la Polarisation en Logique. Ph.D. thesis, Univiversit Aix-Marseille II (2002)"},{"key":"23_CR16","unstructured":"Laurent, O.: A proof of the focalization property in linear logic (2004) (Unpublished note)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-319-08587-6_23","volume-title":"Automated Reasoning","author":"B Lellmann","year":"2014","unstructured":"Lellmann, B.: Axioms vs hypersequent rules with context restrictions: theory and applications. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS, vol. 8562, pp. 307\u2013321. Springer, Heidelberg (2014)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-662-48899-7_39","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B Lellmann","year":"2015","unstructured":"Lellmann, B., Pimentel, E.: Proof search in nested sequent calculi. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR-20 2015. LNCS, vol. 9450, pp. 558\u2013574. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48899-7_39"},{"issue":"46","key":"23_CR19","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2009.07.041","volume":"410","author":"C Liang","year":"2009","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theoret. Comput. Sci. 410(46), 4747\u20134768 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR20","unstructured":"Marin, S., Stra\u00dfburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Advances in Modal Logic (AIML-10) (2014)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-89439-1_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S McLaughlin","year":"2008","unstructured":"McLaughlin, S., Pfenning, F.: Imogen: focusing the polarized inverse method for intuitionistic propositional logic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 174\u2013181. Springer, Heidelberg (2008)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic 51, 125\u2013157 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-662-48899-7_19","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Miller","year":"2015","unstructured":"Miller, D., Volpe, M.: Focused labeled proof systems for modal logic. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR-20 2015. LNCS, vol. 9450, pp. 266\u2013280. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48899-7_19"},{"issue":"5\u20136","key":"23_CR24","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logic. J. Philos. Logic 34(5\u20136), 507\u2013544 (2005)","journal-title":"J. Philos. Logic"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0960129501003322","volume":"11","author":"F Pfenning","year":"2001","unstructured":"Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11, 511\u2013540 (2001). Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA 1999)","journal-title":"Math. Struct. Comput. Sci."},{"key":"23_CR26","series-title":"Trends in Logic","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-1-4020-9084-4_3","volume-title":"Towards Mathematical Philosophy","author":"F Poggiolesi","year":"2009","unstructured":"Poggiolesi, F.: The method of tree-hypersequents for modal propositional logic. In: Makinson, D., Malinowski, J., Wansing, H. (eds.) Towards Mathematical Philosophy. Trends in Logic, vol. 28, pp. 31\u201351. Springer, New York (2009)"},{"key":"23_CR27","unstructured":"Reed, J., Pfenning, F.: Focus-preserving embeddings of substructural logics in intuitionistic logic. Draft manuscript, January 2010"},{"issue":"3","key":"23_CR28","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2629678","volume":"15","author":"RJ Simmons","year":"2014","unstructured":"Simmons, R.J.: Structural focalization. ACM Trans. Comput. Log. 15(3), 21:1\u201321:33 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"23_CR29","unstructured":"Simpson, A.: The proof theory and semantics of intuitionistic modal logic. Ph.D thesis, University of Edinburgh (1994)"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-37075-5_14","volume-title":"Foundations of Software Science and Computation Structures","author":"L Stra\u00dfburger","year":"2013","unstructured":"Stra\u00dfburger, L.: Cut elimination in nested sequents for intuitionistic modal logics. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 209\u2013224. Springer, Heidelberg (2013)"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Zeilberger, N.: Focusing and higher-order abstract syntax. In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, San Francisco, California, USA, January 7\u201312, pp. 359\u2013369. ACM (2008)","DOI":"10.1145\/1328438.1328482"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T04:49:30Z","timestamp":1718426970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}