Representing Sequences in Description Logics Using Suffix Trees

Daniel Kudenko; Haym Hirsh

Representing Sequences in Description Logics Using Suffix Trees

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequencesu sing suffix trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range 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 subsumptionc heckingi n this representation, and computingt he least commonsu bsumer 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 additional types of information, such as sequence lengths and the existence and number of occurrences of palindromes
in a sequence.

Original language	Undefined/Unknown
Pages	141-145
Publication status	Published - 1996

Cite this

@conference{43272ac623fa4f0faccd84cc69929a9b,

title = "Representing Sequences in Description Logics Using Suffix Trees",

abstract = "This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequencesu sing suffix trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range 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 subsumptionc heckingi n this representation, and computingt he least commonsu bsumer 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 additional types of information, such as sequence lengths and the existence and number of occurrences of palindromes in a sequence.",

author = "Daniel Kudenko and Haym Hirsh",

year = "1996",

language = "Undefined/Unknown",

pages = "141--145",

}

TY - CONF

T1 - Representing Sequences in Description Logics Using Suffix Trees

AU - Kudenko, Daniel

AU - Hirsh, Haym

PY - 1996

Y1 - 1996

N2 - This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequencesu sing suffix trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range 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 subsumptionc heckingi n this representation, and computingt he least commonsu bsumer 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 additional types of information, such as sequence lengths and the existence and number of occurrences of palindromes in a sequence.

AB - This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequencesu sing suffix trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range 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 subsumptionc heckingi n this representation, and computingt he least commonsu bsumer 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 additional types of information, such as sequence lengths and the existence and number of occurrences of palindromes in a sequence.

M3 - Paper

SP - 141

EP - 145

ER -