• Corpus ID: 10920836

Matching in Description Logics with Existential Restrictions

  title={Matching in Description Logics with Existential Restrictions},
  author={Franz Baader and Ralf K{\"u}sters},
  booktitle={Description Logics},
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of description logics, originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. Previous work has concentrated on (sub-)languages of CLASSIC, which in particular do not allow for existential restrictions. In this work, we present sound and complete decision algorithms for the solvability of matching problems and… 

Figures from this paper

Reasoning in description logics with variables: preliminary results regarding the EL logic

The main technical results are derived by establishing a correspondance between the EL logic and finite variable automata.

Matching under Side Conditions in Description Logics

The present paper closes the gap on matching under additional side conditions for the DL and its sublanguages by closing the gap for matching in Description Logics.

Matching with Respect to General Concept Inclusions in the Description Logic EL

The general case is solved: it is shown that matching in EL w.r.t. general TBoxes is NP-complete by introducing a goal-oriented matching algorithm that uses non-deterministic rules to transform a given matching problem into a solved form by a polynomial number of rule applications.

Unification in a Description Logic with Transitive Closure of Roles

It is shown that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles, and that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic.

Matching in the Description Logic FL0 with respect to General TBoxes (Extended abstract)

Matching is the special case of unification where one of the expressions to be unified has no variables and thus remains unchanged under substitutions and both matching and unification have been investigated in detail for the inexpressive DLs FL0 and EL.

Implementing Matching in ALN

An implementation of an existing polynomial time matching algorithm for the DL ALN is presented and Benchmarks using randomly generated matching problems indicate a relatively good performance even on large matching problems.

Non-Standard Inferences in Description Logics : The Story So Far

It has now reached a point where it makes sense to motivate these inferences within a uniform application framework, and an overview of the results obtained so far is given, to describe the remaining open problems, and give perspectives for future research in this direction.

Computing Least Common Subsumers for FLE+

An implementation of an existing matching algorithm for the DL ALE is presented and first results on benchmarks w.r.t. randomly generated matching problems show that the implementation performs well even on relatively large matching problems.

What’s new in Description Logics

  • F. Baader
  • Computer Science
  • 2011
This paper first reviews the DL research leading to the very expressive DLs with practical inference procedures underlying OWL, and then sketches the recent development of light-weight DLs and novel inference procedures.

Matching in Hybrid Terminologies

This paper provides the first in-depth investigation of the non-standard inferences least-common subsumer, and matching in hybrid EL-TBoxes; providing sound and complete algorithms for both inference services.



Matching in Description Logics

A new approach to performing matching is proposed, based on a ‘concept-centred’ normal form, rather than the more standard ‘structural subsumption’normal form for concepts, so that matching can be performed using arbitrary concept patterns of the description language, thus removing restrictions from previous work.

Computing Least Common Subsumers in Description Logics with Existential Restrictions

The main new contribution of this paper is the treatment of description logics with existential restrictions, based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisins between these trees.

Unification of Concept Terms in Description Logics

This work shows that this inference problem for description logics is of interest for applications, and presents first decidability and complexity results for a small concept description language.

Computing Least Common Subsumers in Description Logics

This paper introduces a new operation for description logics: computing the "least common subsumer" of a pair of descriptions, which computes the largest set of commonalities between two descriptions.

“What’s not in a name?” Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases

A formal framework for the integration of KBs is set up which enables us to investigate the potential and limits of using structural information (in contrast to just thesaurus information involving identifier strings).

Explaining reasoning in description logics

Four major issues in explaining the conclusions of procedurally implemented deductive systems are explored and a meta-language for describing interesting aspects of complicated objects is used to limit the amount of information that should be presented or explained.

Asking Queries about Frames

This paper investigates the algorithms required when answers are deduced by matching queries against a "structural normal form" of descriptions, and introduces a useful refinement of the notion of structural subsumption.

Computers and Intractability: A Guide to the Theory of NP-Completeness

It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.

CLASSIC: a structural data model for objects

The kind of language of descriptions and queries presented here provides a new arena for the search for languages that are more expressive than conventional DBMS languages, but for which query processing is still tractable.

Knowledge Representation in Process Engineering

This paper investigates how the powerful inference services provided by a DL system can support the users of this frame-based system, and considers extensions of description languages that are necessary to represent the relevant process engineering knowledge.