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

@inproceedings{Baader2014MatchingWR,
title={Matching with Respect to General Concept Inclusions in the Description Logic EL},
booktitle={Description Logics},
year={2014}
}
• Published in Description Logics 22 September 2014
• Computer Science
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL. The next big challenge was then to further extend these results from matching and unification without a TBox to…
7 Citations

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

• Computer Science
Description Logics
• 2018
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.

### Quantitative Variants of Language Equations and their Applications to Description Logics

It is shown that approximate unification in description logics FL 0 can be reduced to approximately solving language equations, and devised algorithms for solving the latter problem for particular distance measures, and acquired a tight complexity bound for the general case.

### Weak Subsumption in the EL-Description Logic with Refreshing Variables (Extended Abstract)

• Computer Science
Description Logics
• 2021
This work supports cyclic pattern definitions and considers a new semantics for variables, called refreshing semantics in contrast to the classical (non refreshing) semantics used in the literature, which lies in the valuation of variables that appear in the scope of a terminological cycle.

### Dismatching and Local Disunification in EL

• Computer Science
RTA
• 2015
It is shown that dismatching can be reduced to local dis unification, and two complementary NP-algorithms for finding local solutions of (general) disunification problems are provided.

### Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)

• Computer Science, Mathematics
LPAR
• 2020
An approach for generating proofs for expressive DLs based on a non-standard reasoning task called forgetting is developed and implemented and compared the obtained proofs with proofs generated by the DL reasoner ELK, finding that forgetting-based proofs are often better w.r.t. different measures of proof complexity.

### Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification

• Computer Science
Log. Methods Comput. Sci.
• 2016
It is first shown that dismatching can be reduced to local disunification, and then provided two complementary NP-algorithms for finding local solutions of dis unification problems.

• Computer Science
• 2019
The advanced query faclilities for SPECIAL’s policies and compliance checking address the following two types of problems: 1. given an observed behavior, find the consent that allows that behavior;

## References

SHOWING 1-10 OF 22 REFERENCES

### Matching in Description Logics

• Computer Science
J. Log. Comput.
• 1999
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.

### Matching in Description Logics with Existential Restrictions

• Computer Science
Description Logics
• 1999
This work presents sound and complete decision algorithms for the solvability of matching problems and for computing sets of matchers for matching problems in description logics with existential restrictions.

### Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else?

It is shown that even admitting general concept inclusion (GCI) axioms and role hierarchies in ℇL terminologies preserves the polynomial time upper bound for subsumption, and implication of the first result is that reasoning over the widely used medical terminology SNOMED is possible in polynometric time.

### A Goal-Oriented Algorithm for Unification in ℇℒℋR+ w.r.t. Cycle-Restricted Ontologies

• Computer Science
Australasian Conference on Artificial Intelligence
• 2012
A goal-oriented NP unification algorithm for EL is extended in two directions: on the one hand, general concept inclusion axioms (GCIs) are added, and on the other hand, role hierarchies and transitive roles are added.

### Extending Unification in EL Towards General TBoxes

• Computer Science
KR
• 2012
This paper makes a considerable step towards addressing the problem of unification in Description Logic EL of general concept inclusion axioms, but the GCIs the new unification algorithm can deal with still need to satisfy a certain cycle restriction.

### Pushing the EL Envelope

• Computer Science
IJCAI
• 2005
This work will extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability and show that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIME-complete.

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

• Computer Science
• 1999
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).

### Unification in the Description Logic EL

• Computer Science, Philosophy
Description Logics
• 2009
This paper shows that unification in Description Logic-unification is NP-complete, and thus has the same complexity as $\mathcal{EL}$-matching, and shows that there are unification problems that have no finite complete set of unifiers.

### Unification of Concept Terms in Description Logics

• Computer Science, Philosophy
Description Logics
• 1997
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.

### CLASSIC: a structural data model for objects

• Computer Science
SIGMOD '89
• 1989
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.