45,050 Hits in 5.6 sec

How to Decide Query Containment under Constraints Using a Description Logic [chapter]

Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies
Logic for Programming and Automated Reasoning  
Discussion In this paper we have sketched how the problem of query containment under constraints can be decided using a KB (schema plus ABox) satisfiability tester for the SHIQ description logic, and we  ...  Introduction Query containment under constraints is the problem of determining whether the result of one query is contained in the result of another query for every database satisfying a given set of constraints  ... 
doi:10.1007/3-540-44404-1_21 dblp:conf/lpar/HorrocksSTT00 fatcat:sk6cha7c3vhlvfqejjsx76vetm

How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?

Michael Benedikt
2018 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - SIGMOD/PODS '18  
The purpose of this article is to reflect on the use of reasoning for rewriting and simplifying relational database queries.  ...  We undertake a review of some of the results and reasoning algorithms that have been developed with a motivation from query evaluation, and add to this a look at open problems in the area as well as a  ...  I want to express my deep gratitude to Marcelo Arenas, Michaël Cadilhac, Phokion Kolaitis, Dan Olteanu, and Victor Vianu for extensive feedback on this work.  ... 
doi:10.1145/3196959.3196989 dblp:conf/pods/Benedikt18 fatcat:fmx4gidgbzb6fpxtvrsy4eyskm

Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements

Vitaliy L. Khizder, David Toman, Grant E. Weddell
2007 International Workshop on Description Logics  
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consistency for DLF .  ...  This is accomplished indirectly by adding an additional concept constructor for rooted path equality, which has the added benefit of increasing the utility of DLF for reasoning about query containment  ...  Description logics have also been used for reasoning about query containment in the presence of rich database schema [5, 10] .  ... 
dblp:conf/dlog/KhizderTW07 fatcat:eyw4qnhlbjhb5aqlibkklnz63u

A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries [chapter]

Alessandro Artale, Enrico Franconi, Frank Wolter, Michael Zakharyaschev
2002 Lecture Notes in Computer Science  
Checking query containment of non-recursive Datalog queries under DLR constraints is decidable in 2EXPTIME [9] .  ...  is EXPSPACE-complete, and (3) the problem of checking query containment of non-recursive Datalog queries under DLR − U S constraints is decidable in 2EXPTIME with an EXPSPACE lower bound.  ...  This result is the first decidability result we are aware of on containment of temporal conjunctive queries under expressive constraints.  ... 
doi:10.1007/3-540-45757-7_9 fatcat:4vgmyrocprg5tfcxebna63xny4

Query Answering over Complete Data with Conceptual Constraints

Nhung Ngo
2016 Proceedings of the 2016 on SIGMOD'16 PhD Symposium - SIGMOD'16 PhD  
We first study the complexity of query answering problem under description logic constraints in the presence of complete data and show that complete data makes query answering become harder than query  ...  To deal with the problem, the ontology-based data access approach uses ontologies to capture both constraints and databases.  ...  Acknowledgement This research is partially supported by Free University of Bolzano, under project ORMiE.  ... 
doi:10.1145/2926693.2929899 dblp:conf/sigmod/Ngo16 fatcat:o6f6vjbbnbeyrn5vzv4kdu54ny

Knowledge Representation using Schema Tuple Queries

Michael Minock
2003 Knowledge Representation Meets Databases  
These properties enable the determination of query containment, equivalence and disjointness. Given this, the identified query class possesses many of the desirable properties of description logics.  ...  In particular a subclass of the schema tuple queries is identified that is decidable for satisfiability and is closed over syntactic query difference.  ...  Description Logics The description logics [7] [13] community has investigated 'query' containment under the name of concept subsumption.  ... 
dblp:conf/krdb/Minock03 fatcat:gkjxbfhbuvfmhlryanva2a4hqu

Conjunctive Query Containment and Answering under Description Logics Constraints [article]

Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini
2005 arXiv   pre-print
We show that query answering under Description Logic constraints can be reduced to query containment, and illustrate how such a reduction provides upper bound results with respect to both combined and  ...  We provide a method for query containment under Description Logic constraints, thus showing that the problem is decidable, and analyze its computational complexity.  ...  We present the following results on both query containment and query answering: (1) We provide a method for query containment under Description Logic constraints, thus showing that the problem is decidable  ... 
arXiv:cs/0507067v1 fatcat:q7sn62kerbccjcaanh6svb3ttm

XML reasoning made practical

Pierre Geneves, Nabil Layaida
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
It can also be used in type-checkers and optimizing compilers that need to perform all kinds of compile-time analyses involving XPath queries and XML tree constraints.  ...  The tool can be used in query optimizers, in order to prove soundness of query rewriting.  ...  Then, we will demonstrate how to check for XPath expressions emptiness under type constraints, as well as path containment and equivalence.  ... 
doi:10.1109/icde.2010.5447786 dblp:conf/icde/GenevesL10 fatcat:euz7evgi2zcbboho44ojbvwx44

Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints

Franz Baader, Bartosz Bednarczyk, Sebastian Rudolph
2019 International Workshop on Description Logics  
We prove that decidability of querying can be regained if global and local constraints are not mixed and the global constraints are appropriately restricted. locally, i.e., they refer to the role successors  ...  The logic ALCSCC ++ As in [1, 4] , we use the quantifier-free fragment of Boolean Algebra with Presburger Arithmetic (QFBAPA) to express our constraints.  ...  Let R be an RCBox with a model I. Then pump(I) is a model of R. Now we explain how to use the pumping method from the Definition 4 to erase non-tree query matches and obtain a counter-model. Lemma 6.  ... 
dblp:conf/dlog/BaaderBR19 fatcat:tc2h7f4imjhtrnvel7zhbd6dcy

Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules

2010 Theory and Practice of Logic Programming  
The product of this joint effort has been a set of logic-based formalisms, such as the Relational Calculus (Codd 1970), Datalog (Ceriet al. 1990), Description Logics (Baaderet al. 2007), etc., capturing  ...  Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboulet al. 1995).  ...  We also like to thank all the reviewers, whose comments and criticisms have very much helped us in the production of this special issue.  ... 
doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e

Semantic Technologies for Situation Awareness

Franz Baader, Stefan Borgwardt, Patrick Koopmann, Veronika Thost, Anni-Yasmin Turhan
2020 Künstliche Intelligenz  
The general idea was to formalize situations as ontology-mediated queries, but in order to express the relevant situations, both the employed ontology language and the query language had to be extended  ...  The project "Semantic Technologies for Situation Awareness" was concerned with detecting certain critical situations from data obtained by observing a complex hard- and software system, in order to trigger  ...  contributions to this project, and all the other members of the CRC HAEC for their cooperation.  ... 
doi:10.1007/s13218-020-00694-3 fatcat:xcoxluhqdvbjvfbelzrrjesvpi

Effective support of databases with ontological dependencies: Relational languages instead of description logics

L. A. Kalinichenko
2012 Programming and computer software  
compared to the description logics.  ...  The paper provides a brief survey of the languages for efficient support of access to the databases satisfying the ontological dependencies.  ...  ACKNOWLEDGMENTS This work was supported in part by the Russian Foundation for Basic Research (project nos. 10 07 00342 a and 11 07 00402 a) and by the Presidium of the Russian Academy of Sciences (the  ... 
doi:10.1134/s0361768812060059 fatcat:aezozh4o6rctjft47p3uny4lnm

Conjunctive query containment and answering under description logic constraints

Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini
2008 ACM Transactions on Computational Logic  
We provide a method for query containment under description logic constraints, thus showing that the problem is decidable, and analyze its computational complexity.  ...  Conjunctive query containment and answering under description logic constraints.  ...  We present the following results on both query containment and query answering: (1) We provide a method for query containment under description logic constraints, thus showing that the problem is decidable  ... 
doi:10.1145/1352582.1352590 fatcat:ctcywbpwqnc6rn5pt47yob2mnu

First Order Rewritability for Ontology Mediated Querying in Horn-DLFD

David Toman, Grant E. Weddell
2020 International Workshop on Description Logics  
In addition, since data that populates OMQ is commonly residing in relational database systems, we show how constraints enforced by such systems can be used to expand the scope of rewritable queries.  ...  In this paper, we study the problem of the existence of FO rewritings for a given Horn-DLFD theory (TBox) in terms of Beth definability, and show how Craig interpolation can then be used to effectively  ...  Summary and Conclusions We have shown how the combined combined approach to OMQ can be used to determine when query answering mediated by a Horn-DLFD TBox can be reduced to a first order query over a plain  ... 
dblp:conf/dlog/TomanW20 fatcat:cy2k5nyatjhnrlm6qid3cc774q

Decidability of First-Order Logic Queries over Views [chapter]

James Bailey, Guozhu Dong
1999 Lecture Notes in Computer Science  
In addition to new areas, our work also has relevance to extensions of results for related problems such as query containment, trigger termination, implication of dependencies and reasoning in description  ...  We study the problem of deciding satis ability of rst order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language.  ...  Given any description of a 2CM and its computation, we can show how to a) encode this description in database relations and b) de ne queries to check this description.  ... 
doi:10.1007/3-540-49257-7_7 fatcat:bkgobifjrre4jnkzq3qnek2cay
« Previous Showing results 1 — 15 out of 45,050 results