Sciweavers

237 search results - page 25 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
CSL
2007
Springer
14 years 1 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
AGILE
2007
Springer
127views GIS» more  AGILE 2007»
14 years 1 months ago
Space-contained conflict revision, for geographic information
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
Omar Doukari, Robert Jeansoulin
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 4 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
ECAL
2007
Springer
14 years 1 months ago
From Solitary to Collective Behaviours: Decision Making and Cooperation
In a social scenario, establishing whether a collaboration is required to achieve a certain goal is a complex problem that requires decision making capabilities and coordination am...
Vito Trianni, Christos Ampatzis, Anders Lyhne Chri...