Ontologies and Data Management: A Brief Survey

Information systems have to deal with an increasing amount of data that is heterogeneous, unstructured, or incomplete. In order to align and complete data, systems may rely on taxonomies and background knowledge that are provided in the form of an ontology. This survey gives an overview of research work on the use of ontologies for accessing incomplete and/or heterogeneous data.

[1]  Jean Christoph Jung,et al.  Ontology-Based Access to Probabilistic Data with OWL QL , 2012, SEMWEB.

[2]  Ralf Möller,et al.  A Stream-Temporal Query Language for Ontology Based Data Access , 2014, Description Logics.

[3]  Heiner Stuckenschmidt,et al.  Structure-Based Partitioning of Large Ontologies , 2009, Modular Ontologies.

[4]  Balder ten Cate,et al.  Guarded Negation , 2011, Advances in Modal Logic.

[5]  Thomas Schwentick,et al.  Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151) , 2017, Dagstuhl Manifestos.

[6]  Sebastian Rudolph,et al.  Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting , 2019, Description Logics.

[7]  Davide Bresolin,et al.  Horn Fragments of the Halpern-Shoham Interval Temporal Logic , 2016, ACM Trans. Comput. Log..

[8]  Renate A. Schmidt,et al.  On Concept Forgetting in Description Logics with Qualified Number Restrictions , 2018, Description Logics.

[9]  Boris Motik,et al.  Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.

[10]  Patrick Koopmann,et al.  Count and Forget : Uniform Interpolation of SHQ-Ontologies — Long Version ? , 2014 .

[11]  Ian Horrocks,et al.  Module Extraction in Expressive Ontology Languages via Datalog Reasoning , 2016, J. Artif. Intell. Res..

[12]  Thomas Lukasiewicz,et al.  A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web , 2007, IEEE Transactions on Knowledge and Data Engineering.

[13]  Marvin Minsky,et al.  A framework for representing knowledge" in the psychology of computer vision , 1975 .

[14]  Yongsheng Gao,et al.  Ontology Extraction for Large Ontologies via Modularity and Forgetting , 2019, K-CAP.

[15]  Laura Giordano,et al.  A non-monotonic Description Logic for reasoning about typicality , 2013, Artif. Intell..

[16]  Diego Calvanese,et al.  Containment of Regular Path Queries under Description Logic Constraints , 2011, IJCAI.

[17]  Hans Tompits,et al.  Forgetting in Managing Rules and Ontologies , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[18]  Jean Christoph Jung,et al.  Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming , 2019, CIKM.

[19]  Yevgeny Kazakov,et al.  Abstraction Refinement for Ontology Materialization , 2014, Description Logics.

[20]  Rafael Peñaloza,et al.  Probabilistic Query Answering in the Bayesian Description Logic BEL , 2015, SUM.

[21]  Jianfeng Du,et al.  Extending description logics with uncertainty reasoning in possibilistic logic , 2007, Int. J. Intell. Syst..

[22]  Thomas Eiter,et al.  Conjunctive query answering in the description logic SH using knots , 2012, J. Comput. Syst. Sci..

[23]  Alon Y. Halevy,et al.  P-CLASSIC: A Tractable Probablistic Description Logic , 1997, AAAI/IAAI.

[24]  Franz Baader,et al.  Temporal query entailment in the Description Logic SHQ , 2015, J. Web Semant..

[25]  Kent A. Spackman,et al.  SNOMED RT: a reference terminology for health care , 1997, AMIA.

[26]  Manfred Jaeger,et al.  Probabilistic Reasoning in Terminological Logics , 1994, KR.

[27]  Pavel Klinov,et al.  Pronto: A Practical Probabilistic Description Logic Reasoner , 2010, UniDL.

[28]  Ian Horrocks,et al.  Sequoia: A Consequence Based Reasoner for SROIQ , 2019, Description Logics.

[29]  Thomas Lukasiewicz,et al.  P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web , 2002, JELIA.

[30]  Michael Benedikt,et al.  Querying Visible and Invisible Information , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[31]  Sebastian Rudolph,et al.  Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 , 2010, KR.

[32]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[33]  Diego Calvanese,et al.  Identification Constraints and Functional Dependencies in Description Logics , 2001, IJCAI.

[34]  Franz Baader,et al.  Query and Predicate Emptiness in Ontology-Based Data Access , 2016, J. Artif. Intell. Res..

[35]  Joachim Quantz,et al.  A Preference Semantics for Defaults in Terminological Logics , 1992, International Conference on Principles of Knowledge Representation and Reasoning.

[36]  Ian Horrocks,et al.  OptiqueVQS: A visual query system over ontologies for industry , 2018, Semantic Web.

[37]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[38]  Carsten Lutz,et al.  First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics , 2016, Description Logics.

[39]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

[40]  Ian Horrocks,et al.  MORe: Modular Combination of OWL Reasoners for Ontology Classification , 2012, SEMWEB.

[41]  Christof Peltason.  The BACK system—an overview , 1991, SGAR.

[42]  Ian Horrocks,et al.  The Combined Approach to Query Answering Beyond the OWL 2 Profiles , 2015, IJCAI.

[43]  Boris Konev,et al.  Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies , 2014, Description Logics.

[44]  Jens Lehmann,et al.  DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia , 2015, Semantic Web.

[45]  Magdalena Ortiz,et al.  Closed Predicates in Description Logics: Results on Combined Complexity , 2016, AMW.

[46]  Luca Pulina,et al.  Temporal and Spatial OBDA with Many-Dimensional Halpern-Shoham Logic , 2016, IJCAI.

[47]  Carsten Lutz,et al.  The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.

[48]  Umberto Straccia,et al.  Defeasible Inheritance-Based Description Logics , 2011, IJCAI.

[49]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

[50]  Boris Konev,et al.  Decomposing Description Logic Ontologies , 2010, KR.

[51]  Carsten Lutz,et al.  Data Complexity in the EL Family of Description Logics , 2007, LPAR.

[52]  Diego Calvanese,et al.  Verification of Evolving Graph-structured Data under Expressive Path Constraints , 2016, ICDT.

[53]  James A. Hendler,et al.  The National Cancer Institute's Thésaurus and Ontology , 2003, J. Web Semant..

[54]  Magdalena Ortiz,et al.  Revisiting the Hardness of Query Answering in Expressive Description Logics , 2014, RR.

[55]  Ralf Möller,et al.  On Bounded-Memory Stream Data Processing with Description Logics , 2019, Description Logic, Theory Combination, and All That.

[56]  Riccardo Rosati,et al.  On Conjunctive Query Answering in EL , 2007, Description Logics.

[57]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[58]  Carsten Lutz,et al.  The Complexity of Circumscription in DLs , 2009, J. Artif. Intell. Res..

[59]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

[60]  Pablo Barceló,et al.  Querying Regular Graph Patterns , 2014, JACM.

[61]  Ulrike Sattler,et al.  Theoretical Foundations of Defeasible Description Logics , 2019, ArXiv.

[62]  Carsten Lutz,et al.  Temporalising Tractable Description Logics , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[63]  Bernhard Hollunder.  An alternative proof method for possibilistic logic and its application to terminological logics , 1994, Int. J. Approx. Reason..

[64]  Michaël Thomazo,et al.  Answering Conjunctive Regular Path Queries over Guarded Existential Rules , 2017, IJCAI.

[65]  Albrecht Schmiedel,et al.  Temporal Terminological Logic , 1990, AAAI.

[66]  Filip Murlak,et al.  Finite Query Answering in Expressive Description Logics with Transitive Roles , 2018, KR.

[67]  Thomas Lukasiewicz,et al.  Basic Probabilistic Ontological Data Exchange with Existential Rules , 2016, AAAI.

[68]  Fabio Gagliardi Cozman,et al.  Loopy Propagation in a Probabilistic Description Logic , 2008, SUM.

[69]  Rafael Peñaloza,et al.  Fuzzy Description Logics - A Survey , 2017, SUM.

[70]  Jan Chomicki,et al.  Efficient checking of temporal integrity constraints using bounded history encoding , 1995, TODS.

[71]  Ralf Küsters,et al.  Extensions to Description Logics , 2003, Description Logic Handbook.

[72]  Luciano Serafini,et al.  Contextualized knowledge repositories for the Semantic Web , 2012, J. Web Semant..

[73]  John F. Sowa,et al.  Principles of semantic networks , 1991 .

[74]  Asunción Gómez-Pérez,et al.  Ontological Engineering: Principles, Methods, Tools and Languages , 2006, Ontologies for Software Engineering and Software Technology.

[75]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[76]  Sergio Tessaris,et al.  Supporting the Design of Ontologies for Data Access , 2008, Description Logics.

[77]  Bart De Schutter,et al.  30th AAAI Conference on Artificial Intelligence, AAAI 2016 , 2016, AAAI 2016.

[78]  Guido Governatori,et al.  Defeasible Description Logics , 2004, RuleML.

[79]  Franz Baader,et al.  Metric Temporal Description Logics with Interval-Rigid Names , 2020, ACM Trans. Comput. Log..

[80]  Magdalena Ortiz,et al.  Reasoning and Query Answering in Description Logics , 2012, Reasoning Web.

[81]  Diego Calvanese,et al.  The MASTRO system for ontology-based data access , 2011, Semantic Web.

[82]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[83]  Renate A. Schmidt,et al.  Role Forgetting for ALCOQH(universal role)-Ontologies Using an Ackermann-Based Approach , 2017, Description Logics.

[84]  Frank van Harmelen,et al.  Contextualizing ontologies , 2004, J. Web Semant..

[85]  Jeff Z. Pan,et al.  Concept and Role Forgetting in ALC Ontologies , 2009, ISWC 2009.

[86]  Ian Horrocks,et al.  A proposal for an owl rules language , 2004, WWW '04.

[87]  Boris Konev,et al.  Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies , 2009, IJCAI.

[88]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[89]  Ian Horrocks,et al.  An Introduction to Description Logic , 2017 .

[90]  Katarina Britz,et al.  Reachability modules for the Description Logic SRIQ , 2013 .

[91]  Boris Motik,et al.  Hypertableau Reasoning for Description Logics , 2009, J. Artif. Intell. Res..

[92]  Sebastian Rudolph,et al.  ELP: Tractable Rules for OWL 2 , 2008, SEMWEB.

[93]  Davide Bresolin,et al.  Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification , 2008, LPAR.

[94]  Frank Wolter,et al.  Decidable and undecidable fragments of first-order branching temporal logics , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[95]  E. Muñoz,et al.  Horn Fragments of the Halpern-Shoham Interval Temporal Logic , 2017 .

[96]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[97]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[98]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[99]  Jochen Heinsohn,et al.  Probabilistic Description Logics , 1994, UAI.

[100]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[101]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[102]  Philipp M. Yelland.  An Alternative Combination of Bayesian Networks and Description Logics , 2000, KR.

[103]  Boris Motik,et al.  The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases , 2014, J. Artif. Intell. Res..

[104]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[105]  Paulo Cesar G. da Costa,et al.  Of Starships and Klingons: Bayesian Logic for the 23rd Century , 2005, UAI.

[106]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[107]  Mark A. Musen,et al.  Traversing Ontologies to Extract Views , 2009, Modular Ontologies.

[108]  Meghyn Bienvenu,et al.  Mixed-World Reasoning with Existential Rules under Active Domain Semantics (Abstract) , 2019, Description Logics.

[109]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[110]  Samantha Bail,et al.  A Corpus of OWL DL Ontologies , 2013, Description Logics.

[111]  Michael Benedikt,et al.  Rewriting Guarded Negation Queries , 2013, MFCS.

[112]  Carsten Lutz,et al.  Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics , 2011, IJCAI.

[113]  Pavel Klinov,et al.  Empirical Study of Logic-Based Modules: Cheap Is Cheerful , 2013, Description Logics.

[114]  Ana Ozaki,et al.  Learning Description Logic Ontologies: Five Approaches. Where Do They Stand? , 2020, KI - Künstliche Intelligenz.

[115]  Andreas Pieris,et al.  Making Cross Products and Guarded Ontology Languages Compatible , 2017, IJCAI.

[116]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[117]  Franz Baader,et al.  CEL - A Polynomial-Time Reasoner for Life Science Ontologies , 2006, IJCAR.

[118]  Andrea Calì,et al.  A general Datalog-based framework for tractable query answering over ontologies , 2012, J. Web Semant..

[119]  Thomas Lukasiewicz,et al.  Expressive probabilistic description logics , 2008, Artif. Intell..

[120]  Jens Claßen,et al.  Verification of Knowledge-Based Programs over Description Logic Actions , 2015, IJCAI.

[121]  Markus Krötzsch,et al.  Wikidata , 2014, Commun. ACM.

[122]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[123]  Frank Wolter,et al.  On Non-local Propositional and Weak Monodic Quantified CTL , 2004, J. Log. Comput..

[124]  Thomas Lukasiewicz,et al.  Probabilistic Default Reasoning with Conditional Constraints , 2000, Annals of Mathematics and Artificial Intelligence.

[125]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[126]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[127]  Enrico Franconi,et al.  Query Answering with DBoxes is Hard , 2011, M4M/LAMAS.

[128]  Riccardo Rosati,et al.  A Broad Class of First-Order Rewritable Tuple-Generating Dependencies , 2012, Datalog.

[129]  Jan Nößner,et al.  ELOG: A Probabilistic Reasoner for OWL EL , 2011, RR.

[130]  Stefan Schlobach,et al.  ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$ , 2010, Journal of Automated Reasoning.

[131]  Boris Motik,et al.  Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions , 2018, J. Artif. Intell. Res..

[132]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[133]  J. Bruijn,et al.  Effective query rewriting with ontologies over DBoxes , 2009, IJCAI 2009.

[134]  Bijan Parsia,et al.  Finding All Justifications of OWL DL Entailments , 2007, ISWC/ASWC.

[135]  Georg Gottlob,et al.  Expressiveness of guarded existential rule languages , 2014, PODS.

[136]  Sebastian Rudolph,et al.  Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ , 2011, IJCAI.

[137]  Carsten Lutz,et al.  Conservative Extensions in Expressive Description Logics , 2007, IJCAI.

[138]  Magdalena Ortiz,et al.  Rewriting Guarded Existential Rules into Small Datalog Programs , 2018, ICDT.

[139]  Boris Motik,et al.  OWL Datatypes: Design and Implementation , 2008, SEMWEB.

[140]  Thomas Lukasiewicz,et al.  Explanations for Ontology-Mediated Query Answering in Description Logics (Extended Abstract) , 2020, Description Logics.

[141]  奥村 エルネスト純.  会議報告：The 33rd AAAI Conference on Artificial Intelligence（AAAI 2019） , 2019 .

[142]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[143]  David Toman.  On completeness of multi-dimensional first-order temporal logics , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[144]  D. Nardi,et al.  An Introduction to Description Logic , 2017 .

[145]  Sebastian Rudolph,et al.  Temporally Attributed Description Logics , 2019, Description Logic, Theory Combination, and All That.

[146]  Marcelo Finger,et al.  Description Logic, Theory Combination, and All That , 2019, Lecture Notes in Computer Science.

[147]  Thomas Schwentick,et al.  The price of query rewriting in ontology-based data access , 2014, Artif. Intell..

[148]  Boris Motik.  Resolution-Based Reasoning for Ontologies , 2009, Handbook on Ontologies.

[149]  Alasdair J. G. Gray,et al.  Enabling Ontology-Based Access to Streaming Data Sources , 2010, SEMWEB.

[150]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[151]  Rafael Peñaloza,et al.  Similarity-based relaxed instance queries , 2015, J. Appl. Log..

[152]  Stefan Borgwardt,et al.  Temporal Query Answering in the Description Logic EL , 2015, IJCAI.

[153]  Kate Revoredo,et al.  Learning Probabilistic Description Logics: A Framework and Algorithms , 2011, MICAI.

[154]  G. Gottlob,et al.  Query Answering in the Description Logic Horn-SHIQ ⋆ , 2008 .

[155]  Andrea Calì,et al.  Towards more expressive ontology languages: The query answering problem , 2012, Artif. Intell..

[156]  Carsten Lutz,et al.  Deciding inseparability and conservative extensions in the description logic EL , 2010, J. Symb. Comput..

[157]  Bijan Parsia,et al.  Modularity and Web Ontologies , 2006, KR.

[158]  Rafael Peñaloza.  Explaining Axiom Pinpointing , 2019, Description Logic, Theory Combination, and All That.

[159]  Diego Calvanese,et al.  Regular Path Queries in Expressive Description Logics with Nominals , 2009, IJCAI.

[160]  Thomas Lukasiewicz,et al.  Tightly integrated probabilistic description logic programs for representing ontology mappings , 2008, Annals of Mathematics and Artificial Intelligence.

[161]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[162]  Carlos A. Hurtado,et al.  Edinburgh Research Explorer Expressive Languages for Path Queries over Graph-Structured Data , 2012 .

[163]  Carsten Lutz,et al.  Conjunctive Query Answering in the Description Logic EL Using a Relational Database System , 2009, IJCAI.

[164]  Carsten Lutz,et al.  The Combined Approach to OBDA: Taming Role Hierarchies using Filters , 2012, SSWS+HPCSW@ISWC.

[165]  Saturation-based decision procedures for extensions of the guarded fragment , 2006 .

[166]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[167]  Diego Calvanese,et al.  Verification of relational data-centric dynamic systems with external services , 2012, PODS.

[168]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[169]  Carsten Lutz,et al.  Ontology-Based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP , 2014, ACM Trans. Database Syst..

[170]  Mario Piattini,et al.  Ontologies for Software Engineering and Software Technology , 2010 .

[171]  Franz Baader,et al.  Runtime verification using the temporal description logic ALC-LTL revisited , 2014, J. Appl. Log..

[172]  Magdalena Ortiz,et al.  Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog , 2019, Artif. Intell..

[173]  Eric Mays,et al.  K-Rep system overview , 1991, SGAR.

[174]  Fabio Gagliardi Cozman,et al.  Satisfiability in EL with Sets of Probabilistic ABoxes , 2011, Description Logics.

[175]  Diego Calvanese,et al.  Nested Regular Path Queries in Description Logics , 2014, KR.

[176]  Jean Christoph Jung,et al.  Answering Regular Path Queries over SQ Ontologies , 2018, AAAI.

[177]  Diego Calvanese,et al.  Reasoning over Extended ER Models , 2007, ER.

[178]  Churn-Jung Liau,et al.  Possibilistic Reasoning - A Mini-Survey and Uniform Semantics , 1996, Artif. Intell..

[179]  Alex Borgiday.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996 .

[180]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[181]  Georg Gottlob,et al.  Polynomial Combined Rewritings for Existential Rules , 2014, KR.

[182]  Franz Baader,et al.  Integrating Description Logics and Action Formalisms: First Results , 2005, Description Logics.

[183]  Pablo Barceló,et al.  Containment for Rule-Based Ontology-Mediated Queries , 2017, PODS.

[184]  Sebastian Rudolph,et al.  Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

[185]  Carsten Lutz,et al.  The Combined Approach to Query Answering in DL-Lite , 2010, KR.

[186]  Jan Chomicki,et al.  Querying ATSQL databases with temporal logic , 1996, TODS.

[187]  Ian Horrocks,et al.  OWL rules: A proposal and prototype implementation , 2005, J. Web Semant..

[188]  Carsten Lutz,et al.  Probabilistic Description Logics for Subjective Uncertainty , 2010, KR.

[189]  Szymon Klarman,et al.  Description logics of context , 2016, J. Log. Comput..

[190]  Evgenij Thorstensen,et al.  Mapping Repair in Ontology-based Data Access Evolving Systems (Extended Abstract) , 2017, WSP/WOMoCoE@ISWC.

[191]  Phiniki Stouppa,et al.  Data Privacy for Knowledge Bases , 2009, LFCS.

[192]  Carsten Lutz,et al.  Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics , 2006, KR.

[193]  Franz Baader,et al.  Small is Again Beautiful in Description Logics , 2010, KI - Künstliche Intelligenz.

[194]  Renate A. Schmidt,et al.  Role Forgetting for ALCOQH ( O )-Ontologies Using an Ackermann-Based Approach , 2017 .

[195]  Sebastian Rudolph,et al.  Conjunctive Queries for a Tractable Fragment of OWL 1.1 , 2007, ISWC/ASWC.

[196]  Carsten Lutz,et al.  Foundations of instance level updates in expressive description logics , 2011, Artif. Intell..

[197]  David Toman,et al.  FunDL - A Family of Feature-Based Description Logics, with Applications in Querying Structured Data Sources , 2019, Description Logic, Theory Combination, and All That.

[198]  Riccardo Rosati,et al.  Improving Query Answering over DL-Lite Ontologies , 2010, KR.

[199]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[200]  Thomas Andreas Meyer,et al.  Reachability Modules for the Description Logic $\mathcal{SRIQ}$ , 2013, LPAR.

[201]  Marie-Laure Mugnier,et al.  Data Access With Horn Ontologies: Where Description Logics Meet Existential Rules , 2020, KI - Künstliche Intelligenz.

[202]  Riccardo Rosati,et al.  The Limits of Querying Ontologies , 2007, ICDT.

[203]  Stefan Schlobach,et al.  ABox Abduction in the Description Logic ALC , 2011, J. Autom. Reason..

[204]  Frank Wolter,et al.  First-Order Rewritability of Temporal Ontology-Mediated Queries , 2015, IJCAI.

[205]  Joseph Y. Halpern.  An Analysis of First-Order Logics of Probability , 1989, IJCAI.

[206]  Sebastian Rudolph,et al.  (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL , 2014, Artif. Intell..

[207]  Diego Calvanese,et al.  Answering regular path queries in expressive Description Logics via alternating tree-automata , 2014, Inf. Comput..

[208]  Markus Krötzsch,et al.  Attributed Description Logics: Reasoning on Knowledge Graphs , 2018, IJCAI.

[209]  KoymansRon.  Specifying real-time properties with metric temporal logic , 1990 .

[210]  Carsten Lutz.  Interval-based Temporal Reasoning with General TBoxes , 2001, IJCAI.

[211]  Thomas Eiter,et al.  Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses , 2008, AAAI.

[212]  Diego Calvanese,et al.  Foundations of data-aware process analysis: a database theory perspective , 2013, PODS.

[213]  Stanislav Kikot,et al.  Ontology-Mediated Queries , 2016, J. ACM.

[214]  Project Acronym : Optique Project Title : Scalable End-user Access to Big Data Instrument : Integrated Project Scheme : Information & Communication Technologies Deliverable D 5 . 1 A Semantics for Temporal and Stream-Based Query Answering in an OBDA Context , 2013 .

[215]  Alon Y. Halevy,et al.  Combining Horn Rules and Description Logics in CARIN , 1998, Artif. Intell..

[216]  Filip Murlak,et al.  Ontology Focusing: Knowledge-enriched Databases on Demand , 2020, ECAI.

[217]  Ulrike Sattler,et al.  A Case for Abductive Reasoning over Ontologies , 2006, OWLED.

[218]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[219]  Marco Manna,et al.  Guarded-Based Disjunctive Tuple-Generating Dependencies , 2016, ACM Trans. Database Syst..

[220]  Diego Calvanese,et al.  Explanation in the DL-LiteFamily of Description Logics , 2008, OTM Conferences.

[221]  Carsten Lutz,et al.  Query Containment in Description Logics Reconsidered , 2012, KR.

[222]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[223]  Cesare Tinelli,et al.  Description Logic, Theory Combination, and All That , 2019, Lecture Notes in Computer Science.

[224]  James A. Hendler,et al.  Handbook of Semantic Web Technologies , 2011, Handbook of Semantic Web Technologies.

[225]  Birte Glimm,et al.  Embracing Change by Abstraction Materialization Maintenance for Large ABoxes , 2018, IJCAI.

[226]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[227]  Carsten Lutz,et al.  Quantitative temporal logics over the reals: PSpace and below , 2007, Inf. Comput..

[228]  Pavel Klinov.  Pronto: A Non-monotonic Probabilistic Description Logic Reasoner , 2008, ESWC.

[229]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[230]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[231]  Carsten Lutz,et al.  Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes) , 2013, IJCAI.

[232]  Diego Calvanese,et al.  View-based query answering in Description Logics: Semantics and complexity , 2012, J. Comput. Syst. Sci..

[233]  Boris Motik,et al.  Tractable query answering and rewriting under description logic constraints , 2010, J. Appl. Log..

[234]  Anni-Yasmin Turhan,et al.  Elastiq: Answering Similarity-threshold Instance Queries in EL , 2015, Description Logics.

[235]  Frank Wolter,et al.  Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk) , 2017, TIME.

[236]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[237]  R. Parikh.  Beliefs, belief revision, and splitting languages , 1999 .

[238]  Boris Konev,et al.  Semantic Modularity and Module Extraction in Description Logics , 2008, ECAI.

[239]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[240]  Yannis E. Ioannidis,et al.  BalOnSe: Temporal Aspects of Dance Movement and Its Ontological Representation , 2017, ESWC.

[241]  I. Ceylan.  The Bayesian Ontology Language BEL , 2016 .

[242]  Carsten Lutz,et al.  The Complexity of Conjunctive Query Answering in Expressive Description Logics , 2008, IJCAR.

[243]  Georg Lausen,et al.  Ontologies in F-logic , 2004, Handbook on Ontologies.

[244]  Jeff Z. Pan,et al.  Uniform Interpolation for ALC\mathcal{ALC} Revisited , 2009, Australasian Conference on Artificial Intelligence.

[245]  Jean Christoph Jung,et al.  Complexity of Branching Temporal Description Logics , 2012, ECAI.

[246]  Riccardo Rosati,et al.  Query-Based Comparison of Mappings in Ontology-Based Data Access , 2016, KR.

[247]  Boris Konev,et al.  Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey , 2016, RW.

[248]  Rafael Peñaloza,et al.  Decidability and Complexity of Fuzzy Description Logics , 2016, KI - Künstliche Intelligenz.

[249]  Meghyn Bienvenu,et al.  A Short Survey on Inconsistency Handling in Ontology-Mediated Query Answering , 2020, KI - Künstliche Intelligenz.

[250]  Enrico Franconi,et al.  Temporal Description Logics , 2005, Handbook of Temporal Reasoning in Artificial Intelligence.

[251]  Jeff Z. Pan,et al.  Uniform Interpolation for ALC Revisited , 2009, Australasian Conference on Artificial Intelligence.

[252]  Sebastian Rudolph,et al.  Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! , 2010, J. Artif. Intell. Res..

[253]  Renate A. Schmidt,et al.  ABox Abduction via Forgetting in ALC , 2019, AAAI.

[254]  Thomas Lukasiewicz,et al.  Existential Rules and Bayesian Networks for Probabilistic Ontological Data Exchange , 2015, RuleML.

[255]  David Toman,et al.  On Keys and Functional Dependencies as First-Class Citizens in Description Logics , 2006, IJCAR.

[256]  Stefan Borgwardt,et al.  Temporalizing rewritable query languages over knowledge bases , 2015, J. Web Semant..

[257]  Piero A. Bonatti,et al.  Rational closure for all description logics , 2019, Artif. Intell..

[258]  Sebastian Rudolph,et al.  The Triguarded Fragment of First-Order Logic , 2018, LPAR.

[259]  Thomas Lukasiewicz,et al.  Explanations for Query Answers under Existential Rules , 2019, IJCAI.

[260]  Magdalena Ortiz,et al.  Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms , 2015, J. Artif. Intell. Res..

[261]  Luca Pulina,et al.  Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers , 2009, IJCAI.

[262]  Carsten Lutz,et al.  The Combined Approach to Ontology-Based Data Access , 2011, IJCAI.

[263]  Mario Alviano,et al.  Stable Model Semantics for Tuple-Generating Dependencies Revisited , 2017, PODS.

[264]  Julian Seidenberg.  Web Ontology Segmentation: Extraction, Transformation, Evaluation , 2009, Modular Ontologies.

[265]  Szymon Klarman,et al.  ABox abduction in ALC using a DL tableau , 2012, SAICSIT '12.

[266]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning about Actions and Plans , 1998, J. Artif. Intell. Res..

[267]  Thomas Eiter,et al.  Query answering in description logics with transitive roles , 2009, IJCAI 2009.

[268]  Sebastian Rudolph,et al.  Description Logic Rules , 2010, ECAI.

[269]  Evgeny Kharlamov,et al.  Querying industrial stream-temporal data: An ontology-based visual approach , 2017, J. Ambient Intell. Smart Environ..

[270]  Matthias Knorr,et al.  Reconciling OWL and Non-monotonic Rules for the Semantic Web , 2012, ECAI.

[271]  Yavor Nenov,et al.  Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner , 2015, Description Logics.

[272]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[273]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[274]  Magdalena Ortiz,et al.  Combining Rules and Ontologies into Clopen Knowledge Bases , 2018, AAAI.

[275]  Magdalena Ortiz,et al.  Resilient Logic Programs: Answer Set Programs Challenged by Ontologies , 2020, AAAI.

[276]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[277]  Carsten Lutz,et al.  A Description Logic of Change , 2007, Description Logics.

[278]  Diego Calvanese,et al.  Reasoning about Explanations for Negative Query Answers in DL-Lite , 2013, J. Artif. Intell. Res..

[279]  Diego Calvanese,et al.  Data Complexity of Query Answering in Expressive Description Logics via Tableaux , 2008, Journal of Automated Reasoning.

[280]  Rafael Peñaloza,et al.  The Bayesian Ontology Reasoner is BORN! , 2015, ORE.

[281]  Enrico Franconi,et al.  Fixpoints in Temporal Description Logics , 2011, IJCAI.

[282]  Yevgeny Kazakov,et al.  Consequence-Driven Reasoning for Horn SHIQ Ontologies , 2009, IJCAI.

[283]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[284]  Dan Suciu,et al.  Query containment for conjunctive queries with regular expressions , 1998, PODS.

[285]  Rafael Peñaloza,et al.  Axiom Pinpointing in General Tableaux , 2007, TABLEAUX.

[286]  Daniel L. Rubin,et al.  BioPortal: A Web Portal to Biomedical Ontologies , 2008, AAAI Spring Symposium: Symbiotic Relationships between Semantic Web and Knowledge Engineering.

[287]  Franz Baader,et al.  LTL over description logic axioms , 2008, TOCL.

[288]  Diego Calvanese,et al.  Dependencies: Making Ontology Based Data Access Work , 2011, AMW.

[289]  Magdalena Ortiz,et al.  Relaxing and Restraining Queries for OBDA , 2019, AAAI.

[290]  John F. Sowa,et al.  Handbook of Knowledge Representation Edited Conceptual Graphs 5.1 from Existential Graphs to Conceptual Graphs , 2022 .

[291]  Willem Conradie,et al.  Definitorially Complete Description Logics , 2006, KR.

[292]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries , 2002, JELIA.

[293]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[294]  Jean Christoph Jung,et al.  On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles , 2019, Description Logics.

[295]  Ralf Möller,et al.  Ontology Based Data Access on Temporal and Streaming Data , 2014, Reasoning Web.

[296]  Giorgio Orsi,et al.  Datalog and Its Extensions for Semantic Web Databases , 2012, Reasoning Web.

[297]  Boris Motik,et al.  HermiT: An OWL 2 Reasoner , 2014, Journal of Automated Reasoning.

[298]  Ulrike Sattler,et al.  The complexity of finite model reasoning in description logics , 2005, Inf. Comput..

[299]  Frank Wolter,et al.  Logic-based ontology comparison and module extraction, with an application to DL-Lite , 2010, Artif. Intell..

[300]  Klaus Schild,et al.  Combining Terminological Logics with Tense Logic , 1993, EPIA.

[301]  Chiara Del Vescovo,et al.  The Modular Structure of an Ontology: Atomic Decomposition , 2011, IJCAI.

[302]  Clare Dixon,et al.  Theorem Proving for Metric Temporal Logic over the Naturals , 2017, CADE.

[303]  Diego Calvanese,et al.  Reasoning on UML class diagrams , 2005, Artif. Intell..

[304]  Michael Zakharyaschev,et al.  Ontology-Based Data Access: Ontop of Databases , 2013, SEMWEB.

[305]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[306]  Boris Konev,et al.  Formal Properties of Modularisation , 2009, Modular Ontologies.

[307]  Santiago Figueira,et al.  Finite Controllability for Ontology-Mediated Query Answering of CRPQ , 2020, KR.

[308]  Ian Horrocks,et al.  How to Decide Query Containment Under Constraints Using a Description Logic , 2000, LPAR.

[309]  Petr Hájek,et al.  Handbook of mathematical fuzzy logic , 2011 .

[310]  Ian Horrocks,et al.  Foundations of ontology-based data access under bag semantics , 2019, Artif. Intell..

[311]  Ignazio Palmisano,et al.  Chainsaw: a Metareasoner for Large Ontologies , 2012, ORE.

[312]  Gabriele Kern-Isberner,et al.  A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective , 2018, KI - Künstliche Intelligenz.

[313]  Thomas Eiter,et al.  Reasoning on \textitDL-Lite_ℛ with Defeasibility in ASP , 2019, RuleML+RR.

[314]  Thomas Schwentick,et al.  Rewriting Ontological Queries into Small Nonrecursive Datalog Programs , 2011, Description Logics.

[315]  Marcel Lippmann,et al.  Decidable Description Logics of Context with Rigid Roles , 2015, FroCos.

[316]  Markus Krötzsch,et al.  The Combined Approach to Query Answering in Horn-ALCHOIQ (Extended Abstract) , 2019, Description Logics.

[317]  Ulrike Sattler,et al.  Which Kind of Module Should I Extract? , 2009, Description Logics.

[318]  Diego Calvanese,et al.  Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[319]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[320]  Patrick Koopmann,et al.  Count and Forget: Uniform Interpolation of $\mathcal{SHQ}$ -Ontologies , 2014, IJCAR.

[321]  Thomas Andreas Meyer,et al.  Semantic Foundation for Preferential Description Logics , 2011, Australasian Conference on Artificial Intelligence.

[322]  Bijan Parsia,et al.  Laconic and Precise Justifications in OWL , 2008, SEMWEB.

[323]  Umberto Straccia,et al.  Towards Top-k Query Answering in Description Logics: The Case of DL-Lite , 2006, JELIA.

[324]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[325]  Jean Christoph Jung,et al.  On Metric Temporal Description Logics , 2016, ECAI.

[326]  Michael Jackman,et al.  Conceptual graphs , 1988 .

[327]  Thomas R. Gruber,et al.  Toward principles for the design of ontologies used for knowledge sharing? , 1995, Int. J. Hum. Comput. Stud..

[328]  Stephan Tobies,et al.  The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics , 2011, ArXiv.

[329]  Thomas Eiter,et al.  Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.

[330]  Boris Motik,et al.  Stream Reasoning in Temporal Datalog , 2017, AAAI.

[331]  Vasant Honavar,et al.  Package-Based Description Logics , 2009, Modular Ontologies.

[332]  Georg Gottlob,et al.  Querying the Guarded Fragment , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[333]  Diego Calvanese,et al.  Ontology-Based Data Access: A Survey , 2018, IJCAI.

[334]  Thomas Lukasiewicz,et al.  Tractable Reasoning with Bayesian Description Logics , 2008, SUM.

[335]  Georg Gottlob,et al.  Query Answering in the Description Logic Horn- , 2008, JELIA.

[336]  Sebastian Rudolph,et al.  Mixing Materialization and Query Rewriting for Existential Rules , 2014, ECAI.

[337]  Enrico Franconi,et al.  A survey of temporal extensions of description logics , 2001, Annals of Mathematics and Artificial Intelligence.

[338]  Michaël Thomazo,et al.  An Introduction to Ontology-Based Query Answering with Existential Rules , 2014, Reasoning Web.

[339]  Patrick Koopmann,et al.  Uniform Interpolation and Forgetting for ALC Ontologies with ABoxes , 2014, AAAI.

[340]  Stefano Spaccapietra,et al.  An Overview of Modularity , 2009, Modular Ontologies.

[341]  Jean Christoph Jung,et al.  Temporalized EL Ontologies for Accessing Temporal Data: Complexity of Atomic Queries , 2016, IJCAI.

[342]  Georg Gottlob,et al.  Conjunctive Query Answering in Probabilistic Datalog+/- Ontologies , 2011, RR.

[343]  Ian Horrocks,et al.  15 Years of Consequence-Based Reasoning , 2019, Description Logic, Theory Combination, and All That.

[344]  Fahiem Bacchus,et al.  Representing and reasoning with probabilistic knowledge - a logical approach to probabilities , 1991 .

[345]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[346]  Markus Krötzsch,et al.  The Incredible ELK , 2013, Journal of Automated Reasoning.

[347]  Riccardo Rosati.  Finite Model Reasoning in DL-Lite , 2008, ESWC.

[348]  Ian Horrocks,et al.  Extracting Modules from Ontologies: A Logic-based Approach , 2009, OWLED.

[349]  Luciano Serafini,et al.  Composing Modular Ontologies with Distributed Description Logics , 2009, Modular Ontologies.

[350]  Boris Motik,et al.  Introducing Nominals to the Combined Query Answering Approaches for EL , 2013, Description Logics.

[351]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[352]  Sergio Tessaris,et al.  Quelo: an Ontology-Driven Query Interface , 2011, Description Logics.

[353]  Balder ten Cate,et al.  Unary negation , 2013, Log. Methods Comput. Sci..

[354]  Andrea Calì,et al.  Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web , 2009, J. Data Semant..

[355]  Michaël Thomazo.  Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Compact Rewritings for Existential Rules ∗ , 2022 .

[356]  Diego Calvanese,et al.  Conjunctive query containment and answering under description logic constraints , 2008, TOCL.

[357]  Anni-Yasmin Turhan,et al.  Reasoning in the Defeasible Description Logic εℒ - computing standard inferences under rational and relevant semantics , 2018, Int. J. Approx. Reason..

[358]  Stefano Spaccapietra,et al.  Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization , 2009, Modular Ontologies.

[359]  Alessandro Artale,et al.  Tractable Interval Temporal Propositional and Description Logics , 2015, AAAI.

[360]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[361]  Bijan Parsia,et al.  Easy Keys for OWL , 2008, OWLED.

[362]  Heiner Stuckenschmidt,et al.  Log-Linear Description Logics , 2011, IJCAI.

[363]  Thomas Eiter,et al.  Linking Open-World Knowledge Bases Using Nonmonotonic Rules , 2015, LPNMR.

[364]  Jorge Pérez,et al.  Relative Expressiveness of Nested Regular Expressions , 2012, AMW.

[365]  Jianfeng Du,et al.  Towards Practical ABox Abduction in Large Description Logic Ontologies , 2012, Int. J. Semantic Web Inf. Syst..

[366]  Riccardo Rosati,et al.  On the decidability and complexity of integrating ontologies and rules , 2005, J. Web Semant..

[367]  Adrian Nuradiansyah.  Reasoning in Description Logic Ontologies for Privacy Management , 2020, KI - Künstliche Intelligenz.

[368]  Riccardo Rosati,et al.  DL+log: Tight Integration of Description Logics and Disjunctive Datalog , 2006, KR.

[369]  Jean Christoph Jung,et al.  Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes , 2015, IJCAI.

[370]  Pascal Hitzler,et al.  Local Closed World Semantics: Grounded Circumscription for Description Logics , 2011, RR.

[371]  Birte Glimm,et al.  Konclude: System description , 2014, J. Web Semant..

[372]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[373]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[374]  Egor V. Kostylev,et al.  XPath for DL Ontologies , 2015, AAAI.

[375]  U. Hustadt,et al.  A Survey of Decidable First-Order Fragments and Description Logics , 2004 .

[376]  Umberto Straccia,et al.  Rational Closure for Defeasible Description Logics , 2010, JELIA.

[377]  Yun Peng,et al.  A probabilistic extension to ontology language OWL , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[378]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[379]  Michael R. Genesereth,et al.  Knowledge Interchange Format , 1991, KR.

[380]  Carsten Lutz,et al.  Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics , 2016, KR.

[381]  Jianfeng Du,et al.  A Tractable Approach to ABox Abduction over Description Logic Ontologies , 2014, AAAI.

[382]  Bijan Parsia,et al.  Ontology Integration Using epsilon-Connections , 2009, Modular Ontologies.

[383]  José Júlio Alferes,et al.  Local closed world reasoning with description logics under the well-founded semantics , 2011, Artif. Intell..

[384]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[385]  Didier Dubois,et al.  Possibilistic logic : a retrospective and prospective view , 2003 .

[386]  Markus Krötzsch,et al.  The Incredible ELK - From Polynomial Procedures to Efficient Reasoning with ℰℒ Ontologies , 2014, J. Autom. Reason..

[387]  Jean Christoph Jung,et al.  Lightweight Description Logics and Branching Time: A Troublesome Marriage , 2014, KR.

[388]  Evgeny Kharlamov,et al.  Faceted search over RDF-based knowledge graphs , 2016, J. Web Semant..

[389]  Jean Christoph Jung,et al.  Querying the Unary Negation Fragment with Regular Path Expressions , 2018, ICDT.

[390]  Filip De Turck,et al.  Personalized Robotic Intervention Strategy by Using Semantics for People with Dementia in Nursing Homes , 2017, AnSWeR@ESWC.

[391]  Maurizio Lenzerini,et al.  On Instance-level Update and Erasure in Description Logic Ontologies , 2009, J. Log. Comput..

[392]  Giorgos Stoilos,et al.  Optimising Resolution-Based Rewriting Algorithms for DL Ontologies , 2013, Description Logics.

[393]  Michael Zakharyaschev,et al.  Ontology-Based Data Access with a Horn Fragment of Metric Temporal Logic , 2017, AAAI.

[394]  Steffen Staab,et al.  Handbook on Ontologies (International Handbooks on Information Systems) , 2004 .

[395]  Michael Zakharyaschev,et al.  Querying Log Data with Metric Temporal Logic , 2017, J. Artif. Intell. Res..

[396]  Kathryn B. Laskey,et al.  PR-OWL - a language for defining probabilistic ontologies , 2017, Int. J. Approx. Reason..

[397]  Carsten Lutz,et al.  Ontology-Mediated Queries with Closed Predicates , 2015, IJCAI.

[398]  Carsten Lutz,et al.  An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL , 2012, KR.

[399]  Diego Calvanese,et al.  Plan Synthesis for Knowledge and Action Bases , 2016, IJCAI.

[400]  Carsten Lutz,et al.  Finite Model Reasoning in Horn Description Logics , 2014, KR.

[401]  Robert Mac Gregor,et al.  THE EVOLVING TECHNOLOGY OF CLASSIFICATION-BASED KNOWLEDGE REPRESENTATION SYSTEMS , 1991 .

[402]  Boris Motik,et al.  Reconciling description logics and rules , 2010, JACM.