Polynomial Rewritings for Linear Existential Rules
暂无分享,去创建一个
[1] Andrea Calì,et al. Towards more expressive ontology languages: The query answering problem , 2012, Artif. Intell..
[2] Stanislav Kikot,et al. Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies , 2011, RR.
[3] Carsten Lutz,et al. The Combined Approach to Ontology-Based Data Access , 2011, IJCAI.
[4] Carsten Lutz,et al. The Combined Approach to Query Answering in DL-Lite , 2010, KR.
[5] Andrea Calì,et al. A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..
[6] Thomas Schwentick,et al. The price of query rewriting in ontology-based data access , 2014, Artif. Intell..
[7] Carsten Lutz,et al. Conjunctive Query Answering in the Description Logic EL Using a Relational Database System , 2009, IJCAI.
[8] Georg Gottlob,et al. Polynomial Combined Rewritings for Existential Rules , 2014, KR.
[9] Andrea Calì,et al. A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.
[10] Diego Calvanese,et al. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.
[11] Serge Abiteboul,et al. Foundations of Databases , 1994 .