Sciweavers

DLOG
2007

On Ordering Descriptions in a Description Logic

13 years 6 months ago
On Ordering Descriptions in a Description Logic
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination with binary trees to efficiently search a database that corresponds to a finite set of concept descriptions. The language consists of a pair of ordering constructors that support a form of exogenous indexing in which search criteria is independent of data, and a form of endogenous indexing in which the data itself provides search criteria. Our language can be refined in the same way as a description logic in that greater expressiveness and consequent richer search capability is achieved by adding additional ordering constructors.
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2007
Where DLOG
Authors Jeffrey Pound, Lubomir Stanchev, David Toman, Grant E. Weddell
Comments (0)