2302 search results - page 250 / 461 » Basic Description Logics |
272
click to vote
PODS
2009
ACM
16 years 6 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
150
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...
178
click to vote
CSFW
1999
IEEE
15 years 10 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
179
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
153
click to vote
PERCOM
2009
ACM
16 years 6 months ago
2009
ACM
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...