Fusions of Description Logics and Abstract Description Systems

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion. Though description logics are closely related to modal logics, they are not necessarily normal. In addition, ABox reasoning in description logics is not covered by the results from modal logics. In this paper, we extend the decidability transfer results from normal modal logics to a large class of description logics. To cover different description logics in a uniform way, we introduce abstract description systems, which can be seen as a common generalization of description and modal logics, and show the transfer results in this general setting.

• Publication year

  2011

• Venue

  Journal of Artificial Intelligence Research

• Publication date

  2011-06-09

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1613/jair.919arXiv 1106.1802
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Connecting Abstract Description Systems

  2002cited by this paper
• Âóùöòòð Óó Öøø¬ Blockin

  2002cited by this paper
• On Expressive Number Restrictions in Description Logics

  2001cited by this paper
• Modal Logic

  2001cited by this paper
• Dynamic logic

  2001influential reference
• Interval-based Temporal Reasoning with General TBoxes

  2001cited by this paper
• Practical Reasoning for Very Expressive Description Logics

  2000cited by this paper
• The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach

  2000cited by this paper
• The Computational Complexity of Hybrid Temporal Logics

  2000cited by this paper
• Mary Likes all Cats

  2000influential reference
• Reasoning with Concrete Domains

  1999cited by this paper
• Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees

  1999cited by this paper
• A Description Logic with Transitive and Converse Roles and Role Hierarchies

  1998cited by this paper
• A Note on Encoding Inverse Roles and Functional Restrictions in ALC Knowledge Bases

  1998cited by this paper
• The Art of Computer Programming: Volume 3: Sorting and Searching

  1998cited by this paper
• Using an Expressive Description Logic: FaCT or Fiction?

  1998cited by this paper
• The Complexity of Concept Languages

  1997cited by this paper
• Fusions of Modal Logics Revisited

  1996cited by this paper
• A Concept Language Extended with Different Kinds of Transitive Roles

  1996cited by this paper
• What's in an Aggregate: Foundations for Description Logics with Tuples and Sets

  1995cited by this paper
• Description Logics in Data Management

  1995cited by this paper
• Implementing and Testing Expressive Description Logics: a Preliminary Report

  1995cited by this paper
• Counting Objects

  1995cited by this paper
• Deduction in Concept Languages: From Subsumption to Instance Checking

  1994cited by this paper
• Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus

  1994cited by this paper
• Boosting the Correspondence between Description Logics and Propositional Dynamic Logics

  1994cited by this paper
• Universal algebra

  1993cited by this paper
• On the complexity of the instance checking problem in concept languages with existential quantification

  1993cited by this paper
• Reasoning with Individuals in Concept Languages

  1993cited by this paper
• Modal logic with names

  1993cited by this paper
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations

  1993cited by this paper
• Extensions of Concept Languages for a Mechanical Engineering Application

  1992cited by this paper
• Using the Universal Modality: Gains and Questions

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

  1992cited by this paper
• The KL-ONE family

  1992cited by this paper
• Counting objects in generalized quantifier theory, modal logic and knowledge representation

  1992cited by this paper
• Attributive Concept Descriptions with Complements

  1991cited by this paper
• A Correspondence Theory for Terminological Logics: Preliminary Report

  1991influential reference
• Living wiht Classic: When and How to Use a KL-ONE-Like Language

  1991cited by this paper
• Tractable Concept Languages

  1991cited by this paper
• A Scheme for Integrating Concrete Domains into Concept Languages

  1991cited by this paper
• Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles

  1991influential reference
• Properties of independently axiomatizable bimodal logics

  1991cited by this paper
• Qualifying Number Restrictions in Concept Languages

  1991cited by this paper
• Principles of semantic networks

  1991cited by this paper
• A Terminological Knowledge Representation System with Complete Inference Algorithms

  1991cited by this paper
• Concept Logics

  1990cited by this paper
• Terminological Reasoning is Inherently Intractable

  1990cited by this paper
• Subsumption algorithms for concept languages

  1990influential reference
• Duality between modal algebras and neighbourhood frames

  1989influential reference
• Varieties of Complex Algebras

  1989cited by this paper
• Subsumption in KL-ONE is Undecidable

  1989cited by this paper
• Subsumption in KL-ONE is undecidable

  1989cited by this paper
• Computational Complexity of Terminological Reasoning in BACK

  1988cited by this paper
• Expressiveness and tractability in knowledge representation and reasoning 1

  1987cited by this paper
• An Overview of the KL-ONE Knowledge Representation System

  1985cited by this paper
• Nondeterministic Propositional Dynamic Logic with intersection is decidable

  1984cited by this paper
• The art of computer programming

  1983cited by this paper
• Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness

  1982cited by this paper
• Propositional logics of programs: systems, models, and complexity

  1980cited by this paper
• Propositional Dynamic Logic of Regular Programs

  1979cited by this paper
• The undecidability of the domino problem

  1966cited by this paper
• Boolean Algebras with Operators

  1952cited by this paper

• Fusions of One-Variable First-Order Modal Logics

  2026cites this paper
• Fine-Grained Complexity of Ontology Mediated Queries (Invited Paper)

  2025cites this paper
• A Literature Survey on Modern Heuristic Optimization with AI Applications

  2021cites this paper
• Artificial Intelligence - Way Forward in Livestock Industry

  2020cites this paper
• Semantic Ontology Alignment: Survey and Analysis

  2020cites this paper
• Modular Structures and Atomic Decomposition in Ontologies

  2020cites this paper
• On Finite Entailment of Non-Local Queries in Description Logics

  2020cites this paper
• 1 Des ription Logi s with Con rete Domains | A Survey

  2019influential citation
• Networked Ontologies with Contextual Alignments

  2019influential citation
• A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction

  2019cites this paper
• Ontology Partitioning Using E-Connections Revisited

  2018cites this paper
• On Query Answering in Description Logics with Number Restrictions on Transitive Roles

  2017cites this paper
• Number Restrictions on Transitive Roles in Description Logics with Nominals

  2017cites this paper
• A Categorical Approach to Networks of Aligned Ontologies

  2017cites this paper
• An ontology for human-like interaction systems

  2016cites this paper
• Towards Resolution-based Reasoning for Connected Logics

  2014cites this paper
• Ontology, Semantics and Reputation

  2013cites this paper
• The modular structure of an ontology : atomic decomposition and its applications

  2013cites this paper
• Agreement Technologies

  2013cites this paper
• Towards Resolution-based Reasoning for

  2013cites this paper
• Combinations and completeness transfer for quantified modal logics

  2011cites this paper
• On P/NP Dichotomies for EL Subsumption under Relational Constraints

  2011cites this paper
• Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0

  2011cites this paper
• Fuzzy Ontology Building and Integration for Fuzzy Inference Systems in Weather Forecast Domain

  2011cites this paper
• Miroslav Janíček Continuous Planning for Communicative Grounding in Situated Dialogue Institute of Formal and Applied Linguistics

  2010cites this paper
• Import-by-query: ontology reasoning under access limitations

  2009cites this paper
• Modular Knowledge Representation and Reasoning in the Semantic Web

  2009cites this paper
• Reasoning about Sensors and Compositions

  2009cites this paper
• Linear Dimensionality Reduction for Multi-label Classification

  2009cites this paper
• Ontology Integration Using epsilon-Connections

  2009cites this paper
• Branching Temporal Description Logics : Reasoning about CTL ALC and CTL

  2009cites this paper
• Distributive Lattice-Structured Ontologies

  2009cites this paper
• Representing ontologies using description logics, description graphs, and rules

  2009cites this paper
• International Masters Programme in Computational Logic Institute for Theoretical Computer Science Computer Science

  2009cites this paper
• A comprehensive combination framework

  2008influential citation
• Privacy-Preserving Query Answering in Logic-based Information Systems

  2008cites this paper
• Temporal Description Logics: A Survey

  2008cites this paper
• Structured objects in owl: representation and reasoning

  2008cites this paper
• Sémantique des réseaux de connaissances : gestion de l'hétérogénéité fondée sur le principe de médiation. (Semantics of Networked Knowledge: Managing Heterogeneity by Mediation)

  2008cites this paper
• Combination Methods for Verification Problems

  2008cites this paper
• ombination methods for software verification. (Méthodes de combinaison pour la vérification de logiciels)

  2008cites this paper
• Combination methods for software verification

  2008cites this paper
• A Literature Review on Artificial Intelligence

  2008cites this paper
• How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited

  2007cites this paper
• Combining modal logics

  2007cites this paper
• Modular Ontology Languages Revisited

  2007cites this paper
• Providing Universal Accessibility Using Connecting Ontologies: A Holistic Approach

  2007cites this paper
• A new descriptor selection scheme for SVM in unbalanced class problem: a case study using skin sensitisation dataset

  2007cites this paper
• Is Your RBox Safe ? Technical Report

  2007cites this paper
• Description Logics with Approximate Definitions - Precise Modeling of Vague Concepts

  2007cites this paper
• Description logic

  2007cites this paper
• A Logic for Concepts and Similarity

  2007cites this paper
• Noetherianity and Combination Problems

  2007cites this paper
• Pellet: A practical OWL-DL reasoner

  2007cites this paper
• A Distributed and Fuzzy Extension of Description Logics

  2006cites this paper
• D2.1.2.2.v1 Report on realizing practical approximate and distributed reasoning for ontologies

  2006cites this paper
• Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics

  2006cites this paper
• Will my Ontologies Fit Together?

  2006cites this paper
• Recent Advances in Combined Decision Problems

  2006cites this paper
• Combining OWL ontologies using epsilon-Connections

  2006cites this paper
• Keys, Nominals, and Concrete Domains

  2005cites this paper
• How Not to Combine Modal Logics

  2005cites this paper
• Combining description and similarity logics

  2005cites this paper
• Temporal Description Logics

  2005cites this paper
• Satisfiability of ATEL with Common and Distributed Knowledge is ExpTime-Complete

  2005cites this paper
• Connecting many-sorted theories

  2005cites this paper
• A Comprehensive Framework for Combined Decision Procedures

  2005influential citation
• 'Closer' representation and reasoning

  2005cites this paper
• A Scheme for Integrating Datatype Groups into Description Logics

  2005cites this paper
• Connecting Many-Sorted Structures and Theories Through Adjoint Functions

  2005cites this paper
• Tableau Algorithms for E-Connections of Description Logics

  2005cites this paper
• A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics

  2004influential citation
• The lattice approach to ontology language interoperability

  2004cites this paper
• Description Logics: Reasoning Support for the Semantic Web

  2004cites this paper
• E-connections of abstract description systems

  2004cites this paper
• Working with Multiple Ontologies on the Semantic Web

  2004cites this paper
• Resasoning about Concepts and Similarity

  2003cites this paper
• Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics

  2003influential citation
• Reasoning about distances

  2003cites this paper
• Weak Conditional Logics of Normality

  2003cites this paper
• E-connections of Description Logics

  2003cites this paper
• Ontology-Based Information Sharing in Weakly Structured Environments

  2003cites this paper
• The 'Family of Languages' Approach to Semantic Interoperability

  2003cites this paper
• A Tableau Algorithm for Reasoning about Concepts and Similarity

  2003cites this paper
• Connecting Abstract Description Systems

  2002influential citation
• The complexity of description logics with concrete domains

  2002influential citation
• A Scheme for Integrating Datatype Groups into

  2002cites this paper
• A Note on Relativised Products of Modal Logics

  2002cites this paper
• Proceedings of the Workshop on Knowledge Transformation for the Semantic Web KTSW 2002

  2002cites this paper
• Logics in Artificial Intelligence

  2002influential citation
• Connecting Abstract Description Systems

  2002cites this paper
• On Fibring Semantics for BDI Logics

  2002cites this paper
• Proceedings of the 2001 Workshop on Applications of Description Logics

  2001cites this paper
• NEXP TIME-complete description logics with concrete domains

  2001cites this paper