From Tetherless World Wiki
Citation: Franz Baader and Alexander Borgida and Ralf Küsters and Deborah L. McGuinness. (1999) Matching in Description Logics. In Journal of Logic and Computation -- Special Issue on Description Logics. Volume 9, number 3, ,,June,1999.
| Publication article ( Edit )
|
| type | Article
|
| bibtype | article
|
| Bibtex basics
|
| author | Franz Baader and Alexander Borgida and Ralf Küsters and Deborah L. McGuinness
|
| title | Matching in Description Logics
|
| journal | Journal of Logic and Computation -- Special Issue on Description Logics. Volume 9, number 3
|
| year | 1999
|
| month | June
|
| Bibtex more
|
| Access Paper
|
| abstract | Matching concepts against patterns (concepts with variables) is a relatively new operation that has been introduced in the context of concept description languages (description logics). The original goal was to help filter out unimportant aspects of complicated concepts appearing in large industrial knowledge bases. We propose anew approach to performing matching, based on a 'concept-centred' normal form, rather than the more standard 'structural subsumption' normal form for concepts. As a result, matching can be performed (in polynomial time) using arbitrary concept patterns of the description language ALN, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional 'side conditions', which were motivated by practical needs.
|
| KSL Technical Report ID: KSL-99-13
|
Facts about Matching in Description LogicsRDF feed
| Abstract | Matching concepts against patterns (concep … Matching concepts against patterns (concepts with variables) is a relatively new operation that has been introduced in the context of concept description languages (description logics). The original goal was to help filter out unimportant aspects of complicated concepts appearing in large industrial knowledge bases. We propose anew approach to performing matching, based on a 'concept-centred' normal form, rather than the more standard 'structural subsumption' normal form for concepts. As a result, matching can be performed (in polynomial time) using arbitrary concept patterns of the description language ALN, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional 'side conditions', which were motivated by practical needs. , which were motivated by practical needs. |
| Author | Franz Baader and Alexander Borgida and Ralf Küsters and Deborah L. McGuinness + |
| Bibtype | article + |
| Has author | Franz Baader and Alexander Borgida and Ralf Küsters and Deborah L. McGuinness + |
| Has identifier | KSL-99-13 + |
| Has publishing details | ,,June,1999 + |
| Has title | Matching in Description Logics + |
| Has where published | Journal of Logic and Computation -- Special Issue on Description Logics. Volume 9, number 3 + |
| Has year | 1999 + |
| Journal | Journal of Logic and Computation -- Special Issue on Description Logics. Volume 9, number 3 + |
| Ksl tr id | KSL-99-13 + |
| Month | June + |
| Process note | NO + |
| Title | Matching in Description Logics + |
| Year | 1999 + |
