Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes

No abstract is available for this paper.

• Publication year

  2008

• Venue

  European Conference on Artificial Intelligence

• Publication date

  2008-06-27

• Fields of study

  Computer Science

• Identifiers
  DOI 10.3233/978-1-58603-891-5-25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Terminological Cycles in a Description Logic with Existential Restrictions

  2009cited by this paper
• Pushing the EL Envelope Further

  2008cited by this paper
• Complexity of Subsumption in Extensions of EL

  2007cited by this paper
• Data Complexity of Query Answering in Description Logics

  2006cited by this paper
• Pushing the EL Envelope

  2005influential reference
• Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else?

  2004cited by this paper
• The Description Logic Handbook: Theory, Implementation, and Applications

  2003influential reference
• Subsumption of concepts in $DL$ ${\cal FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete

  2003cited by this paper
• Containment and equivalence for an XPath fragment

  2002cited by this paper
• Description Logics with Concrete Domains-A Survey

  2002cited by this paper
• Gene Ontology: tool for the unification of biology

  2000cited by this paper
• Complexity of Terminological Reasoning Revisited

  1999cited by this paper
• Tractable and Decidable Fragments of Conceptual Graphs

  1999cited by this paper
• The Complexity of Concept Languages

  1997cited by this paper
• Reasoning with Inclusion Axioms in Description Logics: Algorithms and Complexity

  1996cited by this paper
• Terminological Cycles and the Propositional µ-Calculus

  1994cited by this paper
• The Complexity of Existential Quantification in Concept Languages

  1992cited by this paper
• Attributive Concept Descriptions with Complements

  1991cited by this paper
• Terminological Reasoning is Inherently Intractable

  1990cited by this paper

• Logics for Conceptual Data Modelling: A Review

  2024cites this paper
• Tractable Compliance Checking with Negation

  2021cites this paper
• Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)

  2020cites this paper
• Concept Contraction in the Description Logic EL

  2020cites this paper
• Real Time Reasoning in OWL2 for GDPR Compliance

  2020cites this paper
• Fast Compliance Checking in an OWL2 Fragment

  2018cites this paper
• Explaining and predicting abnormal expenses at large scale using knowledge graph based reasoning

  2017cites this paper
• Argument Mining

  2016cites this paper
• Temporalized EL Ontologies for Accessing Temporal Data: Complexity of Atomic Queries

  2016cites this paper
• AI for Traffic Analytics

  2016cites this paper
• On Decidability and Tractability of Querying in Temporal EL

  2016influential citation
• Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms

  2015cites this paper
• Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes

  2015influential citation
• The Complexity of Temporal Description Logics with Rigid Roles and Restricted TBoxes: In Quest of Saving a Troublesome Marriage

  2015cites this paper
• Smart traffic analytics in the semantic web with STAR-CITY: Scenarios, system and lessons learned in Dublin City

  2014cites this paper
• Foundations of Fuzzy Logic and Semantic Web Languages

  2013cites this paper
• On the Top-k Retrieval Problem for Ontology-Based Access to Databases

  2013cites this paper
• Computing the Stratified Semantics of Logic Programs over Big Data through Mass Parallelization

  2013cites this paper
• Model-theoretic inseparability and modularity of description logic ontologies

  2013cites this paper
• On the complexity of model checking counter automata

  2012cites this paper
• An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL

  2012cites this paper
• Model-theoretic characterisations of description logics

  2012cites this paper
• Ontologies and terminologies: Continuum or dichotomy?

  2012cites this paper
• Scalable Nonmonotonic Reasoning over RDF Data Using MapReduce

  2012cites this paper
• Large scale nonmonotonic reasoning

  2012cites this paper
• Applying Semantic Web Technologies for Diagnosing Road Traffic Congestions

  2012influential citation
• Tractable Reasoning in a Fragment of Separation Logic

  2011cites this paper
• Enriching EL-Concepts with Greatest Fixpoints

  2010cites this paper
• Tractable Extensions of the Description Logic EL with Numerical Datatypes

  2010cites this paper
• Employing description logics in Ambient Intelligence for modeling and reasoning about complex situations

  2009cites this paper
• Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics

  2009cites this paper
• Semantic Modularity and Module Extraction in Description Logics

  2008cites this paper
• Logical Difference and Module Extraction with CEX and MEX

  2008cites this paper