## Rewriting concepts using terminologies (2000)

### Cached

### Download Links

- [www-lti.informatik.rwth-aachen.de]
- [www-lti.informatik.rwth-aachen.de]
- [www-lti.informatik.rwth-aachen.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000 |

Citations: | 42 - 6 self |

### BibTeX

@INPROCEEDINGS{Baader00rewritingconcepts,

author = {Franz Baader and Ralf Küsters and Ralf Molitor},

title = {Rewriting concepts using terminologies},

booktitle = {Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000},

year = {2000},

pages = {297--308},

publisher = {Morgan Kaufmann Publishers}

}

### Years of Citing Articles

### OpenURL

### Abstract

The problem of rewriting a concept given a terminology can informally be stated as follows: given a terminology T (i.e., a set of concept definitions) and a concept description C that does not contain concept names defined in T, can this description be rewritten into a "related better " description E by using (some of) the names defined in T? In this paper, we first introduce a general framework for the rewriting problem in description logics, and then concentrate on one specific instance of the framework, namely the minimal rewriting problem (where "better " means shorter, and "related " means equivalent). We investigate the complexity of the decision problem induced by the minimal rewriting problem for the languages FL 0, ALN, ALE, and ALC, and then introduce an algorithm for computing (minimal) rewritings for the language ALE. (In the full paper, a similar algorithm is also developed for ALN.) Finally, we sketch other interesting instances of the framework.

### Citations

11413 |
Computers and Intractability : A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...unds for the complexity of the minimal rewriting decision problem for the DLs FL 0 , ALN , ALE , and ALC. NP-Hardness for FL 0 , ALN , and ALE We give a reduction of the NP-complete problem SETCOVER (=-=Garey and Johnson, 1979-=-) to the minimal rewriting decision problem in FL 0 . An instance of the SETCOVER problem is of the following form: Instance: A finite set U = fu 1 ; : : : ; un g, a family F = fF i ` U j 1sismg of no... |

296 | Basic description logics
- Baader, Nutt
- 2003
(Show Context)
Citation Context ...the subsumption and the instance problem, are now well-investigated. More recently, new types of inference problems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; =-=Baader et al., 1999-=-a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences... |

165 | A semantics and complete algorithm for subsumption in the CLASSIC description logic - Borgida, Patel-Schneider - 1994 |

154 | Terminological reasoning is inherently intractable - Nebel - 1990 |

95 | H.: Learning the CLASSIC description logic: Theoretical and experimental results
- Cohen, Hirsh
- 1994
(Show Context)
Citation Context ...oblems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; Baader et al., 1999a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; =-=Cohen and Hirsh, 1994-=-; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences, algorithms that solve these nonstandard problems produce concept descriptions as output, which are then retur... |

94 | Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics
- Baader
- 2003
(Show Context)
Citation Context ...the subsumption and the instance problem, are now well-investigated. More recently, new types of inference problems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; =-=Baader et al., 1999-=-a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences... |

94 |
Rewriting queries using views in description logics
- Beeri, Levy, et al.
- 1997
(Show Context)
Citation Context ...ever, also other interesting instances of the general rewriting framework introduced in Section 3. Rewriting queries using views The problem of rewriting queries using views in DLs, as considered in (=-=Beeri et al., 1997-=-), is one such instance. As source and TBox-DL, that paper considers the language ALN and its extension ALCNR, 2 i.e., L s = L t = ALN or L s = L t = ALCNR, and as destination DL L d = fu; tg. The rew... |

92 | Computing least common subsumers in description logics
- Cohen, Borgida, et al.
- 1992
(Show Context)
Citation Context ...ypes of inference problems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; Baader et al., 1999a; Baader and Kusters, 2000) and computing the least common subsumer (=-=Cohen et al., 1992-=-; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences, algorithms that solve these nonstandard problems produce concept descriptions as outpu... |

76 | Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles
- Baader
- 2003
(Show Context)
Citation Context ...uced and investigated, like matching (Borgida and McGuinness, 1996; Baader et al., 1999a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; =-=Baader and Kusters, 1998-=-; Baader et al., 1999b). In contrast to the standard inferences, algorithms that solve these nonstandard problems produce concept descriptions as output, which are then returned to the user for inspec... |

51 | The complexity of existential quantification in concept languages
- Donini, Lenzerini, et al.
- 1992
(Show Context)
Citation Context ...mplexity results for the restricted equivalence problem for FL 0 (in P) and ALN (in \Delta p 2 ), and ffl known complexity results for the equivalence problem modulo TBox for ALE and ALC (in PSPACE) (=-=Donini et al., 1992-=-; Lutz, 1999). It should be noted that there are two independent sources of complexity for the minimal rewriting problem. On the one hand, we have to decide equivalence modulo TBox in order to test wh... |

48 | Unification of concept terms in description logics - Baader, Narendran |

42 | Using automata theory for characterizing the semantics of terminological cycles - Baader |

31 | Complexity of terminological reasoning revisited, in
- Lutz
- 1999
(Show Context)
Citation Context ...the restricted equivalence problem for FL 0 (in P) and ALN (in \Delta p 2 ), and ffl known complexity results for the equivalence problem modulo TBox for ALE and ALC (in PSPACE) (Donini et al., 1992; =-=Lutz, 1999-=-). It should be noted that there are two independent sources of complexity for the minimal rewriting problem. On the one hand, we have to decide equivalence modulo TBox in order to test whether a comp... |

29 | Asking queries about frames
- Borgida, McGuiness
- 1996
(Show Context)
Citation Context ...dard inference problems, like the subsumption and the instance problem, are now well-investigated. More recently, new types of inference problems have been introduced and investigated, like matching (=-=Borgida and McGuinness, 1996-=-; Baader et al., 1999a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to th... |

28 | Terminological knowledge representation systems in a process engineering application - Sattler - 1998 |

20 | Matching in description logics with existential restrictions
- Baader, Küsters
- 2000
(Show Context)
Citation Context ...e instance problem, are now well-investigated. More recently, new types of inference problems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; Baader et al., 1999a; =-=Baader and Kusters, 2000-=-) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences, algorithms that solve the... |

13 | Knowledge representation in process engineering - Baader, Sattler - 1996 |

6 | Rewriting concepts using terminologies -- revisited
- Baader, Kusters, et al.
- 2000
(Show Context)
Citation Context ...the subsumption and the instance problem, are now well-investigated. More recently, new types of inference problems have been introduced and investigated, like matching (Borgida and McGuinness, 1996; =-=Baader et al., 1999-=-a; Baader and Kusters, 2000) and computing the least common subsumer (Cohen et al., 1992; Cohen and Hirsh, 1994; Baader and Kusters, 1998; Baader et al., 1999b). In contrast to the standard inferences... |

5 | Structural subsumption considered from an automata theoretic point of view - Baader, Küsters, et al. - 1998 |