Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Tommaso Cucinotta

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Praveen Bushipaka

> Home > Persons > Tommaso Cucinotta

Publications

2023
[c76]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icail/MarinoLBCC23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icail/MarinoLBCC23
Gabriele Marino, Daniele Licari, Praveen Bushipaka, Giovanni Comandé, Tommaso Cucinotta:
Automatic Rhetorical Roles Classification for Legal Documents using LEGAL-TransformerOverBERT. ASAIL@ICAIL 2023: 28-36
[c75]
- view
  authority control:
- export record
  dblp key:
  - conf/icail/LicariBMCC23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icail/LicariBMCC23
Daniele Licari, Praveen Bushipaka, Gabriele Marino, Giovanni Comandé, Tommaso Cucinotta:
Legal Holding Extraction from Italian Case Documents using Italian-LEGAL-BERT Text Summarization. ICAIL 2023: 148-156
[c71]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/ital-ia/BushipakaLMCC23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ital-ia/BushipakaLMCC23
Praveen Bushipaka, Daniele Licari, Gabriele Marino, Giovanni Comandé, Tommaso Cucinotta:
AI-Assisted Legal Holding Extraction. Ital-IA 2023: 235-239

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.