1916 search results - page 130 / 384 » Reasoning with class algebra |
TWC
2008
15 years 20 days ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
ENTCS
2000
15 years 18 days ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
136
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequ...
95
Voted
IFIP
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of detecting covert channels within security-enforcing object-capability patterns. Traditional formalisms for reasoning about the security properties of obj...
117
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...