Sciweavers

3053 search results - page 529 / 611
» A Logic of Abstract Argumentation
Sort
View
LICS
2007
IEEE
14 years 3 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
LICS
2007
IEEE
14 years 3 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICC
2007
IEEE
132views Communications» more  ICC 2007»
14 years 3 months ago
Topology Reconstruction and Characterisation of Wireless Ad Hoc Networks
Abstract— Wireless ad hoc networks provide a useful communications infrastructure for the mobile battlefield. In this paper we apply and develop passive radio frequency signal s...
Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roug...
CAV
2007
Springer
86views Hardware» more  CAV 2007»
14 years 3 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
COCOA
2007
Springer
14 years 3 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle