{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:07:49Z","timestamp":1743149269552,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432637"},{"type":"electronic","value":"9783031432644"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43264-4_10","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:03:02Z","timestamp":1694041382000},"page":"150-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lorenzen-Style Strategies as\u00a0Proof-Search Strategies"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Catta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-030-86059-2_25","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M Acclavio","year":"2021","unstructured":"Acclavio, M., Catta, D., Stra\u00dfburger, L.: Game semantics for constructive modal logic. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 428\u2013445. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86059-2_25"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Acclavio, M., Catta, D., Stra\u00dfburger, L.: Towards a denotational semantics for proofs in constructive modal logic (2021). https:\/\/hal.archives-ouvertes.fr\/hal-03201439. Preprint","DOI":"10.1007\/978-3-030-86059-2_25"},{"key":"10_CR3","unstructured":"Alama, J., Knoks, A., Uckelman, S.: Dialogues games for classical logic (short paper), pp. 82\u201386. Universiteit Bern (2011)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"JM Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2, 297\u2013347 (1992)","journal-title":"J. Log. Comput."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Barrio, E., Clerbout, N., Rahman, S.: Introducing consistency in a dialogical framework for paraconsistent logic (online 2018). Log. J. IGPL\/Log. J. IGPL 28(5), 953\u2013972 (2020). https:\/\/halshs.archives-ouvertes.fr\/halshs-01689148","DOI":"10.1093\/jigpal\/jzy069"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Booth, R., Gabbay, D.M., Kaci, S., Rienstra, T., van der Torre, L.W.N.: Abduction and dialogical proof in argumentation and logic programming. In: Schaub, T., Friedrich, G., O\u2019Sullivan, B. (eds.) ECAI 2014\u201321st European Conference on Artificial Intelligence, 18\u201322 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 117\u2013122. IOS Press (2014). https:\/\/doi.org\/10.3233\/978-1-61499-419-0-117","DOI":"10.3233\/978-1-61499-419-0-117"},{"key":"10_CR7","unstructured":"Catta, D.: From strategies to derivations and back an easy completeness proof for first order intuitionistic dialogical logic (2022). https:\/\/hal.archives-ouvertes.fr\/hal-03188862. Working paper or preprint"},{"key":"10_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-63787-3_7","volume-title":"Natural Language Processing in Artificial Intelligence\u2014NLPinAI 2020","author":"D Catta","year":"2021","unstructured":"Catta, D., Moot, R., Retor\u00e9, C.: Dialogical argumentation and textual entailment. In: Loukanova, R. (ed.) Natural Language Processing in Artificial Intelligence\u2014NLPinAI 2020. SCI, vol. 939, pp. 191\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-63787-3_7"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-88853-4_17","volume-title":"Logic, Language, Information, and Computation","author":"D Catta","year":"2021","unstructured":"Catta, D., Stevens-Guille, S.J.: Lorenzen won the game, Lorenz did too: dialogical logic for ellipsis and anaphora resolution. In: Silva, A., Wassermann, R., de Queiroz, R. (eds.) WoLLIC 2021. LNCS, vol. 13038, pp. 269\u2013286. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88853-4_17"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/01445340.2019.1586623","volume":"40","author":"M Crubellier","year":"2019","unstructured":"Crubellier, M., Marion, M., McConaughey, Z., Rahman, S.: Dialectic, the dictum de omni and ecthesis. Hist. Philos. Logic 40(3), 207\u2013233 (2019)","journal-title":"Hist. Philos. Logic"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics & abstract machines. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 27\u201330 July 1996, pp. 394\u2013405. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561456","DOI":"10.1109\/LICS.1996.561456"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0168-0072(85)90016-8","volume":"28","author":"W Felscher","year":"1985","unstructured":"Felscher, W.: Dialogues, strategies, and intuitionistic provability. Ann. Pure Appl. Logic 28(3), 217\u2013254 (1985). https:\/\/doi.org\/10.1016\/0168-0072(85)90016-8","journal-title":"Ann. Pure Appl. Logic"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-45206-5_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"CG Ferm\u00fcller","year":"2003","unstructured":"Ferm\u00fcller, C.G.: Parallel dialogue games and hypersequents for intermediate logics. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS (LNAI), vol. 2796, pp. 48\u201364. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45206-5_7"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ferm\u00fcller, C.G.: Connecting sequent calculi with Lorenzen-style dialogue games. In: Paul Lorenzen-Mathematician and Logician, pp. 115\u2013141 (2021)","DOI":"10.1007\/978-3-030-65824-3_8"},{"key":"10_CR15","volume-title":"Intuitionistic Logic, Model Theory and Forcing","author":"M Fitting","year":"1969","unstructured":"Fitting, M.: Intuitionistic Logic, Model Theory and Forcing. North-Holland Pub. Co., Amsterdam (1969)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H Herbelin","year":"1995","unstructured":"Herbelin, H.: A $$\\lambda $$-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 61\u201375. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0022247"},{"key":"10_CR17","unstructured":"Herbelin, H.: S\u00e9quents qu\u2019on calcule: de l\u2019interpr\u00e9tation du calcul des s\u00e9quents comme calcul de $$\\lambda $$-termes et comme calcul de strat\u00e9gies gagnantes. Phd thesis, Universit\u00e9 Paris 7 (1995). https:\/\/tel.archives-ouvertes.fr\/tel-00382528\/file\/These-Her95.pdf"},{"key":"10_CR18","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science, vol. 42. Cambridge University Press (1997). Corrected edition, 2008"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285\u2013408 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2917, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540100929171","DOI":"10.1006\/inco.2000.2917"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-37343-5_18","volume-title":"Knowledge Engineering, Machine Learning and Lattice Computing with Applications","author":"M Kacprzak","year":"2013","unstructured":"Kacprzak, M., Budzynska, K.: Reasoning about dialogical strategies. In: Gra\u00f1a, M., Toro, C., Howlett, R.J., Jain, L.C. (eds.) KES 2012. LNCS (LNAI), vol. 7828, pp. 171\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37343-5_18"},{"key":"10_CR21","first-page":"187","volume":"4","author":"P Lorenzen","year":"1958","unstructured":"Lorenzen, P.: Logik und agon. Atti Del XII Congresso Internazionale Filosofia 4, 187\u2013194 (1958)","journal-title":"Atti Del XII Congresso Internazionale Filosofia"},{"key":"10_CR22","unstructured":"Lorenzen, P., Lorenz, K.: Dialogische Logik. Wissenschaftliche Buchgesellschaft [Abt. Verlag] (1978)"},{"key":"10_CR23","unstructured":"Mcconaughey, Z.: Existence, meaning and the law of excluded middle. A dialogical approach to Hermann Weyl\u2019s philosophical considerations. Klesis - Revue Philos. 46 (2020). https:\/\/hal.archives-ouvertes.fr\/hal-03036825"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-0-387-98197-0_6","volume-title":"Argumentation in Artificial Intelligence","author":"S Modgil","year":"2009","unstructured":"Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Simari, G.R., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 105\u2013129. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0_6"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Pavlova, A.: Dialogue games for minimal logic. Log. Log. Philos. 30(2), 281\u2013309 (2020). https:\/\/doi.org\/10.12775\/LLP.2020.022, https:\/\/apcz.umk.pl\/LLP\/article\/view\/LLP.2020.022","DOI":"10.12775\/LLP.2020.022"},{"issue":"6","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1093\/logcom\/exi046","volume":"15","author":"H Prakken","year":"2005","unstructured":"Prakken, H.: Coherence and flexibility in dialogue games for argumentation. J. Log. and Comput. 15(6), 1009\u20131040 (2005). https:\/\/doi.org\/10.1093\/logcom\/exi046","journal-title":"J. Log. and Comput."},{"issue":"3\u20134","key":"10_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF00118496","volume":"4","author":"H Prakken","year":"1996","unstructured":"Prakken, H., Sartor, G.: A dialectical model of assessing conflicting arguments in legal reasoning. Artif. Intell. Law 4(3\u20134), 331\u2013368 (1996). https:\/\/doi.org\/10.1007\/BF00118496","journal-title":"Artif. Intell. Law"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Rahman, S., Clerbout, N.: Constructive type theory and the dialogical approach to meaning. Baltic Int. Yearb. Cogn. Log. Commun. 8, 1\u201372 (2013). https:\/\/doi.org\/10.4148\/1944-3676.1077, https:\/\/halshs.archives-ouvertes.fr\/halshs-01225723","DOI":"10.4148\/1944-3676.1077"},{"key":"10_CR29","unstructured":"Rahman, S., Clerbout, N., Keiff, L.: On dialogues and natural deduction. In: Primiero, G. (ed.) Acts of Knowledge: History and Philosophy of Logic, pp. 301\u2013336. College Publications, Tributes (2009). https:\/\/halshs.archives-ouvertes.fr\/halshs-00713187"},{"key":"10_CR30","unstructured":"Sticht, M.: Multi-agent dialogue games and dialogue sequents for proof search and scheduling. In: Fiorentini, C., Momigliano, A. (eds.) Proceedings of the 31st Italian Conference on Computational Logic, Milano, Italy, 20\u201322 June 2016. CEUR Workshop Proceedings, vol. 1645, pp. 21\u201336. CEUR-WS.org (2016). https:\/\/ceur-ws.org\/Vol-1645\/paper_20.pdf"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Stra\u00dfburger, L., Heijltjes, W., Hughes, D.J.D.: Intuitionistic proofs without syntax. In: LICS 2019\u201334th Annual ACM\/IEEE Symposium on Logic in Computer Science. pp. 1\u201313. IEEE, Vancouver (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785827, https:\/\/hal.inria.fr\/hal-02386878","DOI":"10.1109\/LICS.2019.8785827"},{"key":"10_CR32","unstructured":"Troelstra, A., van Dalen, D.: Constructivism in Mathematics (vol. 2). Studies in Logic and the Foundations of Mathematics, vol. 123. North-Holland (1988)"},{"key":"10_CR33","volume-title":"Basic Proof Theory","author":"A Troelstra","year":"1996","unstructured":"Troelstra, A., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, USA (1996)"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43264-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:43:04Z","timestamp":1710330184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43264-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432637","9783031432644"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43264-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vadimmalvone.github.io\/eumas2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PhD - Short Papers (20 submissions; 16 short papers accepted for proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}