Representing Sequences in Description Logics

12 years 11 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approachsupports the representation ofarange of types of information about a sequence, such as the locations and numbers of occurrences of all subsequences of the sequence. Moreover, subsequence testing and pattern matching reduces to subsumption checking inthis representation, and computing the least common subsumer of two terms supports the application of inductive learning to sequences. Finally, we describe a simple addition to our approach, using the same set of DL operators, that extends our representation to handle additionaltypes of information, such as sequence lengths and the existence and number of occurrences of palindromes in a sequence.
Haym Hirsh, Daniel Kudenko
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1997
Where AAAI
Authors Haym Hirsh, Daniel Kudenko
Comments (0)