Sciweavers

IANDC
2007
111views more  IANDC 2007»
13 years 11 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
IANDC
2007
74views more  IANDC 2007»
13 years 11 months ago
Fast congruence closure and extensions
Robert Nieuwenhuis, Albert Oliveras
IANDC
2007
77views more  IANDC 2007»
13 years 11 months ago
One-unambiguity of regular expressions with numeric occurrence indicators
Pekka Kilpeläinen, Rauno Tuhkanen
IANDC
2007
66views more  IANDC 2007»
13 years 11 months ago
Quantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
Carsten Lutz, Dirk Walther, Frank Wolter