Sciweavers

77 search results - page 3 / 16
» Guarded Fixed Point Logic
Sort
View
CCCG
2009
13 years 3 months ago
Wireless Localization with Vertex Guards is NP-hard
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
Tobias Christ, Michael Hoffmann
TACS
2001
Springer
13 years 9 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
HVC
2007
Springer
107views Hardware» more  HVC 2007»
13 years 11 months ago
On the Characterization of Until as a Fixed Point Under Clocked Semantics
Modern hardware designs are typically based on multiple clocks. While a singly-clocked hardware design is easily described in standard temporal logics, describing a multiply-clocke...
Dana Fisman
LPNMR
2005
Springer
13 years 10 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
FUIN
2010
97views more  FUIN 2010»
13 years 3 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant