Rewriting Guarded Existential Rules into Small Datalog Programs
暂无分享,去创建一个
Magdalena Ortiz | Mantas Simkus | Shqiponja Ahmetaj | Magdalena Ortiz | M. Simkus | Shqiponja Ahmetaj
[1] Magdalena Ortiz,et al. Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates , 2016, IJCAI.
[2] Carsten Lutz,et al. The Combined Approach to Ontology-Based Data Access , 2011, IJCAI.
[3] Boris Motik,et al. Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.
[4] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[5] Georg Gottlob,et al. Expressiveness of guarded existential rule languages , 2014, PODS.
[6] Carsten Lutz,et al. Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes) , 2013, IJCAI.
[7] Boris Motik,et al. Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..
[8] Thomas Schwentick,et al. Rewriting Ontological Queries into Small Nonrecursive Datalog Programs , 2011, Description Logics.
[9] Marco Manna,et al. Guarded-Based Disjunctive Tuple-Generating Dependencies , 2016, ACM Trans. Database Syst..
[10] Georg Gottlob,et al. Polynomial Combined Rewritings for Existential Rules , 2014, KR.
[11] Georg Gottlob,et al. On the Complexity of Ontological Reasoning under Disjunctive Existential Rules , 2012, MFCS.
[12] Thomas Eiter,et al. Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.
[13] Thomas Schwentick,et al. The price of query rewriting in ontology-based data access , 2014, Artif. Intell..
[14] Balder ten Cate,et al. Queries with Guarded Negation , 2012, Proc. VLDB Endow..
[15] Erich Grädel,et al. On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.
[16] Catriel Beeri,et al. A Proof Procedure for Data Dependencies , 1984, JACM.
[17] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.
[18] Carsten Lutz,et al. Inverse Roles Make Conjunctive Queries Hard , 2007, Description Logics.
[19] Yavor Nenov,et al. Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning , 2014, AAAI.
[20] Andrea Calì,et al. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.
[21] Georg Gottlob,et al. Polynomial Rewritings for Linear Existential Rules , 2015, IJCAI.
[22] Johan van Benthem,et al. Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..
[23] Michael Benedikt,et al. Rewriting Guarded Negation Queries , 2013, MFCS.
[24] Sebastian Rudolph,et al. Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 , 2010, KR.
[25] Alin Deutsch,et al. Reformulation of XML Queries and Constraints , 2003, ICDT.
[26] Giorgos Stoilos,et al. Optimising Resolution-Based Rewriting Algorithms for DL Ontologies , 2013, Description Logics.