Management of Uncertain Data in Event Graphs

Bellandi, Valerio; Frati, Fulvio; Siccardi, Stefano; Zuccotti, Filippo

doi:10.1007/978-3-031-08971-8_47

Cited by 4 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[11]). Both techniques pave the way to the introduction of uncertainty in the evaluation of mentions in association with referred entities, and specific methods for uncertainty management (as outlined for instance in [12]) might be used to deal with the resulting scenarios.…”

Section: Basic Usage Of An Entity Registrymentioning

confidence: 99%

An Entity Registry: A Model for a Repository of Entities Found in a Document Set

Bellandi¹,

Siccardi²

2023

Natural Language Processing, Information Retrieval and AI

View full text Add to dashboard Cite

This paper proposes a conceptual structure for a repository of entities that can be found by usual procedures of Natural Language Processing, that is the search for entities mentioned in text, their identification, possibly through the link to entries in Background Knowledge Basis (BKG) and theconstruction of a Knowledge Basis or Graph to host the information found in this process. We address applications where a BKG is of little help, because the involved entities are not so relevant to be included in any, being for instance ordinary people or small companies. Therefore, we rely on the entities’ attributes and relationships for unique identification, disambiguation, knowledge checking and any other relevant operation. One of the final goals achieved by the proposed method is the ability to merge knowledge collected in separate bases, once they are referred to the same Entity Registry.

show abstract

Section: Basic Usage Of An Entity Registrymentioning

confidence: 99%

An Entity Registry: A Model for a Repository of Entities Found in a Document Set

Bellandi¹,

Siccardi²

2023

Natural Language Processing, Information Retrieval and AI

View full text Add to dashboard Cite

show abstract

Sequent Systems on Undirected Graphs

Acclavio

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce logical connectives allowing us to extend the well-known correspondence between classical propositional formulas and cographs. We define sequent systems operating on formulas containing such connectives, and we prove, using an analyticity argument based on cut-elimination, that our systems provide conservative extensions of multiplicative linear logic (without and with mix) and classical propositional logic. We conclude by showing that one of our systems captures graph isomorphism as logical equivalence and that it is sound and complete for the graphical logic $$\textsf{GS}$$ GS .

show abstract