1435 search results - page 157 / 287 » Description Logics |
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
133
click to vote
SIGIR
1999
ACM
15 years 8 months ago
1999
ACM
This paper claims that Belief Revision can be seen as a theoretical framework for document ranking in Extended Boolean Models. For a model of Information Retrieval based on propos...
128
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
164
click to vote
AMAI
2004
Springer
15 years 4 months ago
2004
Springer
Prototyping is a valuable technique to help software engineers explore the design space while gaining insight on the dynamics of the system. In this paper, we describe a method for...
151
click to vote
HICSS
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also prese...