Filters








545 Hits in 7.2 sec

A novel approach to Controlled Query Evaluation in DL-Lite (DISCUSSION PAPER)

Domenico Lembo, Riccardo Rosati, Domenico Fabio Savo
2019 Sistemi Evoluti per Basi di Dati  
In Controlled Query Evaluation (CQE) confidential data are protected through a declarative policy and a (optimal) censor, which guarantees that answers to queries are maximized without disclosing secrets  ...  In this paper we consider CQE over Description Logic ontologies and study query answering over all optimal censors.  ...  Introduction In Controlled Query Evaluation (CQE), a policy, i.e., a set of logical assertions, regulates the access to a database or knowledge base by specifying the information that must be kept secret  ... 
dblp:conf/sebd/LemboRS19 fatcat:s3w7huw6ezfqlf3cqidbdj6gm4

Revisiting Controlled Query Evaluation in Description Logics

Domenico Lembo, Riccardo Rosati, Domenico Fabio Savo
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
Controlled Query Evaluation (CQE) is a confidentiality-preserving framework in which private information is protected through a policy, and a (optimal) censor guarantees that answers to queries are maximized  ...  In this paper we instead consider query answering over all possible optimal censors.  ...  We thank the reviewers for pointing out a potential problem in the proof of Theorem 8 in the submitted version of the paper.  ... 
doi:10.24963/ijcai.2019/247 dblp:conf/ijcai/LemboRS19 fatcat:s63vqjluuzbkhk65igco2onkfm

Beyond OWL 2 QL in OBDA: Rewritings and Approximations

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Savo, Alessandro Solimando, Guohui Xiao
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The aim of this paper is to overcome these limitations of DL-Lite_R, and extend OBDA to more expressive ontology languages, while still leveraging the underlying relational technology for query answering  ...  Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings.  ...  This paper is supported by the EU under the large-scale integrating project (IP) Optique (Scalable End-user Access to Big Data), grant agreement n. FP7-318338.  ... 
doi:10.1609/aaai.v30i1.10102 fatcat:rch3rbfwefhkjarsp23uh4lag4

Semantic Enrichment of GSM-Based Artifact-Centric Models

Riccardo De Masellis, Domenico Lembo, Marco Montali, Dmitry Solomakhin
2014 Journal on Data Semantics  
We provide a comprehensive framework for semantic GSM artifacts, discuss in detail its properties, and present main software engineering architectures it is able to capture.  ...  For one of these scenarios we also describe a concrete instantiation of the framework and its application to a real-world use case in the energy domain, investigated in the context of the EU project ACSI  ...  Interestingly, query answering of UCQ in DL-Lite is FOL-rewritable, as shown by Calvanese et al (2007b) . As a consequence of this, also query answering of ECQ queries in DL-Lite is FOL-rewritable.  ... 
doi:10.1007/s13740-014-0036-6 fatcat:b4vxac2gdjdxlh6swfjud5y6yu

ForBackBench: A Benchmark for Chasing vs. Query-Rewriting

Afnan G. Alhazmi, Tom Blount, George Konstantinidis
2022 Proceedings of the VLDB Endowment  
In the process, we also present a syntactic restriction of linear Tuple Generating Dependencies that precisely captures DL-Lite ' , a correspondence previously uninvestigated.  ...  In this paper we provide an original methodology and a benchmark infrastructure -a set of test scenarios, generator and translator tools, and an experimental infrastructure -to allow the translation and  ...  A. Alhazmi was parially supported by the Fundamental Research Funds for Saudi Culture Mission in UK. We thank James Errington and Nathan Bharkhda for helping with early features of the implementation.  ... 
dblp:journals/pvldb/AlhazmiBK22 fatcat:hx3were5ezcoxjc3l4dgbbbchy

Query Answering from Traditional Dance Videos: Case Study of Zapin Dances

Sihem Belabbes, Chi Wee Tan, Tri-Thuc Vo, Yacine Izza, Karim Tabia, Sylvain Lagrue, Salem Benferhat
2019 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)  
In order to build video training sets and to enrich the proposed ontology, manual video annotation is performed based on background knowledge formalized in an ontology, representing a semantics of a traditional  ...  The aim of this paper is to highlight two important issues related to the annotation and querying of Intangible Cultural Heritage video datasets.  ...  We provide a brief reminder on DL-Lite, then discuss query answering. A.  ... 
doi:10.1109/ictai.2019.00239 dblp:conf/ictai/BelabbesTVITLB19 fatcat:w3mkoky56zc75boqi2iisejvtm

Virtual OBDA over Expressive Ontologies: Rewritings and Approximations

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao
2016 International Workshop on Description Logics  
In this paper we extend virtual OBDA to more expressive ontology languages than that of DL-LiteR, which is the logic underpinning the W3C ontology language OWL 2.  ...  This paper is an abridged version of [5]. 1 Recall that FO queries constitute the core of SQL.  ...  We thank Martin Rezk for insightful discussions, and Benjamin Cogrel and Elem Güzel for help with the experimentation.  ... 
dblp:conf/dlog/BotoevaCSSSX16 fatcat:76wjsbgxujb3bgkhawdga7r4yq

Improving Data Management using Domain Knowledge

Magdalena Ortiz
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
First, we consider the problem of ontology-mediated query answering (OMQA), where queries in a standard database query language are enriched with an ontology expressing background knowledge about the domain  ...  The second direction we discuss proposes to use ontologies to manage evolving data.  ...  Acknowledgments The presented work was done jointly with several co-authors, to whom I am very grateful.  ... 
doi:10.24963/ijcai.2018/814 dblp:conf/ijcai/Ortiz18 fatcat:mlvcs354sbhz3ku5okazsydwoy

Managing Data through the Lens of an Ontology

Maurizio Lenzerini
2018 The AI Magazine  
access to all relevant data for the business at an acceptable cost, is huge.  ...  Indeed, it is not surprising that data scientists spend a comparatively large amount of time in the data preparation phase of a project, compared with the data minining and knowledge discovery phase.  ...  paper in the last decade.  ... 
doi:10.1609/aimag.v39i2.2802 fatcat:6zqwnid4qzbcnfhrxg223eamb4

Open WorldReasoning inSemantics-Aware AccessControl: aPreliminaryStudy

Ernesto Damiani, S. David, Sabrina De Capitani di Vimercati, Cristiano Fugazza, Pierangela Samarati
2005 Semantic Web Applications and Perspectives  
With this example, we also show that a general problem such as ontology mapping can take advantage of the enhanced semantics underlying OWL Lite and OWL DL to handle under-specified concepts.  ...  Then we translate the principle underlying the Little House Problem of DL into a real-world use case: by applying Open World Reasoning to the Knowledge Base modelling a Virtual Organization, we derive  ...  The mapping of OWL DL vocabulary terms to SHOIN (D) (and of OWL Lite to SHIF(D)), along with a discussion over their complexity and the proof of reducing reasoning in OWL ontologies to Description Logics  ... 
dblp:conf/swap/DamianiDVFS05 fatcat:3hwxjje56fbilaet5twirjtcdq

Beyond OWL 2 QL in OBDA: Rewritings and Approximations (Extended Version) [article]

Elena Botoeva, Diego Calvanese, Valerio Santarelli, Domenico Fabio Savo, Alessandro Solimando, Guohui Xiao
2015 arXiv   pre-print
The aim of this paper is to overcome these limitations of DL-Lite_R, and extend OBDA to more expressive ontology languages, while still leveraging the underlying relational technology for query answering  ...  Ontology-based data access (OBDA) is a novel paradigm facilitating access to relational data, realized by linking data sources to an ontology by means of declarative mappings.  ...  This paper is supported by the EU under the large-scale integrating project (IP) Optique (Scalable End-user Access to Big Data), grant agreement n. FP7-318338.  ... 
arXiv:1511.08412v2 fatcat:mymb4pc7sve3reboso4wll5dgi

Backwards State-space Reduction for Planning in Dynamic Knowledge Bases

Valerio Senni, Michele Stawowy
2014 Electronic Proceedings in Theoretical Computer Science  
The plan goal is given in terms of satisfaction of a DL query.  ...  We evaluate the effectiveness of our ABP+FPI algorithm in the reduction of the explored planning domain by comparing it to a standard forward planning algorithm and applying both of them to a concrete  ...  The research presented in this paper has been partially funded by the EU project ASCENS (nr.257414) and by the Italian MIUR PRIN project CINA (2010LHT4KM).  ... 
doi:10.4204/eptcs.159.8 fatcat:ojwsbc4hunhxtj7uf7nvnbc2fu

Towards a Unifying Approach to Representing and Querying Temporal Data in Description Logics [chapter]

Víctor Gutiérrez-Basulto, Szymon Klarman
2012 Lecture Notes in Computer Science  
Further, we advocate a controlled use of epistemic semantics in order to warrant practical query answering.  ...  Establishing a generic approach to representing and querying temporal data in the context of Description Logics (DLs) is an important, and still open challenge.  ...  In Section 6 we discuss similarities to existing approaches and outline some future research directions. We conclude the paper in Section 7.  ... 
doi:10.1007/978-3-642-33203-6_8 fatcat:2np2ygklbfh73awl5gu2ycze44

Reasoning with uncertain information and trust

Murat Sensoy, Geeth de Mel, Achille Fokoue, Timothy J. Norman, Jeff Z. Pan, Yuqing Tang, Nir Oren, Katia Sycara, Lance Kaplan, Tien Pham, Barbara D. Broome, David L. Hall (+1 others)
2013 Next-Generation Analyst  
In this paper, we combine DL-Lite with DST to allow scalable reasoning over uncertain semantic knowledge bases.  ...  A limitation of standard Description Logics is its inability to reason with uncertain and vague knowledge.  ...  Governments are authorized to reproduce and distribute for Government purposes notwithstanding any copyright notation hereon.  ... 
doi:10.1117/12.2015667 fatcat:2swbkhiadvd6bbklh7lf5526yq

A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

Thomas Lukasiewicz
2010 IEEE Transactions on Knowledge and Data Engineering  
(see Sections 2 and 10 for a detailed comparison to previous approaches to dl-programs).  ...  As shown in [33], ontology entailment in OWL Lite (resp., OWL DL) reduces to knowledge base (un)satisfiability in the description logic SHIF(D) (resp., SHOIN (D)).  ...  In this section, we discuss only the works that are most closely related to the framework of this paper.  ... 
doi:10.1109/tkde.2010.111 fatcat:okrzhm37b5du3efa34rbcephpq
« Previous Showing results 1 — 15 out of 545 results