1391 search results - page 226 / 279 » Completeness of Neighbourhood Logic |
170
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
279
click to vote
ICLP
2009
Springer
16 years 6 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
257
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
154
click to vote
CCS
2009
ACM
16 years 6 months ago
2009
ACM
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...
158
click to vote
COORDINATION
2009
Springer
16 years 6 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...