发布求助
文献互助 智能选刊 最新文献

Sistemi Evoluti per Basi di Dati最新文献

筛选
英文 中文
Extracting Large Scale Spatio-Temporal Descriptions from Social Media 从社交媒体中提取大尺度时空描述
Sistemi Evoluti per Basi di Dati Pub Date : 2022-06-27 DOI: 10.48550/arXiv.2206.13281
C. Bono, B. Pernici
{"title":"Extracting Large Scale Spatio-Temporal Descriptions from Social Media","authors":"C. Bono, B. Pernici","doi":"10.48550/arXiv.2206.13281","DOIUrl":"https://doi.org/10.48550/arXiv.2206.13281","url":null,"abstract":"The ability to track large-scale events as they happen is essential for understanding them and coordinating reactions in an appropriate and timely manner. This is true, for example, in emergency management and decision-making support, where the constraints on both quality and latency of the extracted information can be stringent. In some contexts, real-time and large-scale sensor data and forecasts may be available. We are exploring the hypothesis that this kind of data can be augmented with the ingestion of semi-structured data sources, like social media. Social media can diffuse valuable knowledge, such as direct witness or expert opinions, while their noisy nature makes them not trivial to manage. This knowledge can be used to complement and confirm other spatio-temporal descriptions of events, highlighting previously unseen or undervalued aspects. The critical aspects of this investigation, such as event sensing, multilingualism, selection of visual evidence, and geolocation, are currently being studied as a foundation for a unified spatio-temporal representation of multi-modal descriptions. The paper presents, together with an introduction on the topics, the work done so far on this line of research, also presenting case studies relevant to the posed challenges, focusing on emergencies caused by natural disasters.","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121555856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Preference-based Inconsistency-Tolerant Query Answering under Existential Rules (Discussion Paper) 存在规则下基于偏好的容错查询应答(讨论文件)
Sistemi Evoluti per Basi di Dati Pub Date : 2020-07-01 DOI: 10.24963/kr.2020/21
M. Calautti, S. Greco, Cristian Molinaro, I. Trubitsyna
{"title":"Preference-based Inconsistency-Tolerant Query Answering under Existential Rules (Discussion Paper)","authors":"M. Calautti, S. Greco, Cristian Molinaro, I. Trubitsyna","doi":"10.24963/kr.2020/21","DOIUrl":"https://doi.org/10.24963/kr.2020/21","url":null,"abstract":"Query answering over inconsistent knowledge bases is a problem that has attracted a great deal of interest over the years.\u0000Different inconsistency-tolerant semantics have been proposed, and most of them are based on the notion of repair, that is, a \"maximal\" consistent subset of the database.\u0000In general, there can be several repairs, so it is often natural and desirable to express preferences among them.\u0000In this paper, we propose a framework for querying inconsistent knowledge bases under user preferences for existential rule languages.\u0000We provide generalizations of popular inconsistency-tolerant semantics taking preferences into account and study the data and combined complexity of different relevant problems.","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114445113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Explanations for Inconsistency-Tolerant Query Answering under Existential Rules 存在规则下容错查询应答的解释
Sistemi Evoluti per Basi di Dati Pub Date : 2020-04-03 DOI: 10.1609/AAAI.V34I03.5682
Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro
{"title":"Explanations for Inconsistency-Tolerant Query Answering under Existential Rules","authors":"Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro","doi":"10.1609/AAAI.V34I03.5682","DOIUrl":"https://doi.org/10.1609/AAAI.V34I03.5682","url":null,"abstract":"Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over the last decades. While several semantics of query answering have been proposed, and their complexity is rather well-understood, little attention has been paid to the problem of explaining query answers. Explainability has recently become a prominent problem in different areas of AI. In particular, explaining query answers allows users to understand not only what is entailed by an inconsistent knowledge base, but also why. In this paper, we address the problem of explaining query answers for existential rules under three popular inconsistency-tolerant semantics, namely, the ABox repair, the intersection of repairs, and the intersection of closed repairs semantics. We provide a thorough complexity analysis for a wide range of existential rule languages and for different complexity measures.","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs 基于基数修复的Datalog+/-不一致容错查询应答的复杂性
Sistemi Evoluti per Basi di Dati Pub Date : 2019-07-17 DOI: 10.1609/AAAI.V33I01.33012962
Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari
{"title":"Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs","authors":"Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari","doi":"10.1609/AAAI.V33I01.33012962","DOIUrl":"https://doi.org/10.1609/AAAI.V33I01.33012962","url":null,"abstract":"Querying inconsistent ontological knowledge bases is an important problem in practice, for which several inconsistencytolerant query answering semantics have been proposed, including query answering relative to all repairs, relative to the intersection of repairs, and relative to the intersection of closed repairs. In these semantics, one assumes that the input database is erroneous, and the notion of repair describes a maximally consistent subset of the input database, where different notions of maximality (such as subset and cardinality maximality) are considered. In this paper, we give a precise picture of the computational complexity of inconsistencytolerant (Boolean conjunctive) query answering in a wide range of Datalog± languages under the cardinality-based versions of the above three repair semantics.","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Positive Unlabeled Link Prediction via Transfer Learning for Gene Network Reconstruction (Discussion Paper) 基于迁移学习的正向无标记链接预测用于基因网络重构(讨论文件)
Sistemi Evoluti per Basi di Dati Pub Date : 2018-10-29 DOI: 10.1007/978-3-030-01851-1_2
P. Mignone, Gianvito Pio
{"title":"Positive Unlabeled Link Prediction via Transfer Learning for Gene Network Reconstruction (Discussion Paper)","authors":"P. Mignone, Gianvito Pio","doi":"10.1007/978-3-030-01851-1_2","DOIUrl":"https://doi.org/10.1007/978-3-030-01851-1_2","url":null,"abstract":"","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130254986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Complexity of Approximate Query Answering under Inconsistency in Datalog+/- Datalog+/-不一致条件下的近似查询回答复杂度
Sistemi Evoluti per Basi di Dati Pub Date : 2018-07-01 DOI: 10.24963/IJCAI.2018/265
Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro
{"title":"Complexity of Approximate Query Answering under Inconsistency in Datalog+/-","authors":"Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro","doi":"10.24963/IJCAI.2018/265","DOIUrl":"https://doi.org/10.24963/IJCAI.2018/265","url":null,"abstract":"Several semantics have been proposed to query inconsistent ontological knowledge bases, including the intersection of repairs and the intersection of closed repairs as two approximate inconsistency-tolerant semantics. In this paper, we analyze the complexity of conjunctive query answering under these two semantics for a wide range of Datalog+/- languages. We consider both the standard setting, where errors may only be in the database, and the generalized setting, where also the rules of a Datalog+/- knowledge base may be erroneous.","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133766659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Ontology-based Linked Data Summarization in Semantics-aware Recommender Systems 语义感知推荐系统中基于本体的关联数据摘要
Sistemi Evoluti per Basi di Dati Pub Date : 2018-06-03 DOI: 10.1007/978-3-319-93417-4_9
T. D. Noia, Corrado Magarelli, A. Maurino, M. Palmonari, A. Rula
{"title":"Ontology-based Linked Data Summarization in Semantics-aware Recommender Systems","authors":"T. D. Noia, Corrado Magarelli, A. Maurino, M. Palmonari, A. Rula","doi":"10.1007/978-3-319-93417-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-93417-4_9","url":null,"abstract":"","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126015409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Exposing Open Street Map in the Linked Data cloud 在关联数据云中公开开放的街道地图
Sistemi Evoluti per Basi di Dati Pub Date : 2016-08-02 DOI: 10.1007/978-3-319-42007-3_29
V. W. Anelli, A. Calí, T. D. Noia, A. Maurino, M. Palmonari, A. Ragone
{"title":"Exposing Open Street Map in the Linked Data cloud","authors":"V. W. Anelli, A. Calí, T. D. Noia, A. Maurino, M. Palmonari, A. Ragone","doi":"10.1007/978-3-319-42007-3_29","DOIUrl":"https://doi.org/10.1007/978-3-319-42007-3_29","url":null,"abstract":"","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132549197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
The View-Update Problem for Indefinite Databases 不定数据库的视图更新问题
Sistemi Evoluti per Basi di Dati Pub Date : 2012-05-21 DOI: 10.1007/978-3-642-33353-8_11
Luciano Caroprese, I. Trubitsyna, M. Truszczynski, E. Zumpano
{"title":"The View-Update Problem for Indefinite Databases","authors":"Luciano Caroprese, I. Trubitsyna, M. Truszczynski, E. Zumpano","doi":"10.1007/978-3-642-33353-8_11","DOIUrl":"https://doi.org/10.1007/978-3-642-33353-8_11","url":null,"abstract":"","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
ChaseT: A Tool For Checking Chase Termination ChaseT:一个检查Chase终止的工具
Sistemi Evoluti per Basi di Dati Pub Date : 2011-10-10 DOI: 10.1007/978-3-642-23963-2_40
A. D. Francesco, Francesca Spezzano, I. Trubitsyna
{"title":"ChaseT: A Tool For Checking Chase Termination","authors":"A. D. Francesco, Francesca Spezzano, I. Trubitsyna","doi":"10.1007/978-3-642-23963-2_40","DOIUrl":"https://doi.org/10.1007/978-3-642-23963-2_40","url":null,"abstract":"","PeriodicalId":312822,"journal":{"name":"Sistemi Evoluti per Basi di Dati","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116947431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信