Sciweavers

551 search results - page 45 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
WOLLIC
2009
Springer
15 years 4 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
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...
Hugo Herbelin, Gyesik Lee
LORI
2009
Springer
15 years 4 months ago
An Update Operator for Strategic Ability
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...
Paolo Turrini, Jan Broersen, Rosja Mastop, John-Ju...
CSFW
2008
IEEE
15 years 4 months ago
An Authorization Logic With Explicit Time
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...
Henry DeYoung, Deepak Garg, Frank Pfenning
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
15 years 4 months ago
Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards
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...
Stephen Kloder, Seth Hutchinson
ICALP
2003
Springer
15 years 3 months ago
Sophistication Revisited
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...
Luis Antunes 0002, Lance Fortnow