2813 search results - page 209 / 563 » Formalizing Architectural Connection |
164
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
198
Voted
LORI
2009
Springer
16 years 1 months ago
2009
Springer
Coalition Logic does not explicitly talk about the effects of a coalitional move on the strategic ability of the remaining players, while in Game Theory reasoning patterns involvi...
193
Voted
CSFW
2008
IEEE
16 years 1 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
161
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
196
click to vote
ICALP
2003
Springer
16 years 5 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...