Sciweavers

3032 search results - page 161 / 607
» Description Logic Rules
Sort
View
103
Voted
TIME
2005
IEEE
15 years 6 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
107
Voted
ECOWS
2007
Springer
15 years 6 months ago
WSMO-Lite: Lightweight Semantic Descriptions for Services on the Web
The current Web service technology brought a new potential to the Web of services. However, the success of Web services still depends on resolving three fundamental challenges, na...
Tomas Vitvar, Jacek Kopecký, Maciej Zaremba...
76
Voted
VLDB
1990
ACM
69views Database» more  VLDB 1990»
15 years 4 months ago
Concept Description Language for Statistical Data Modeling
In this paper we describe a new language for statistical data modelling, which offers a general framework for the representation of elementary and summarydata.Thereare threemain c...
Tiziana Catarci, Giovanna D'Angiolini, Maurizio Le...
124
Voted
CIE
2006
Springer
15 years 4 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
IDA
2005
Springer
15 years 6 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli