Sciweavers

33 search results - page 2 / 7
» Least Common Subsumption as a connective
Sort
View
EWCBR
1998
Springer
13 years 9 months ago
Study and Formalization of a Case-Based Reasoning System Using a Description Logic
In this paper the C-CLASSIC Description Logic is used to design the retrieval and selection tasks of a Case-Based Reasoning system with homogeneous, explicit and formal criteria. T...
Sylvie Salotti, Véronique Ventos
DLOG
2003
13 years 6 months ago
Extensions to Description Logics
This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics a...
Franz Baader, Ralf Küsters, Frank Wolter
AAAI
1997
13 years 6 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 t...
Haym Hirsh, Daniel Kudenko
COMSIS
2006
141views more  COMSIS 2006»
13 years 5 months ago
Common Web Application Attack Types and Security Using ASP.NET
Web applications security is one of the most daunting tasks today, because of security shift from lower levels of ISO OSI model to application level, and because of current situati...
Bojan Jovicic, Dejan Simic
DM
2007
86views more  DM 2007»
13 years 5 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik