IANDC 2007 | Sciweavers

12

IANDC
2007

111views more IANDC 2007»

Expressiveness and complexity of graph logic

13 years 4 months ago

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

claim paper

Read More »

12

click to vote

IANDC
2007

74views more IANDC 2007»

Fast congruence closure and extensions

13 years 4 months ago

Download www.lsi.upc.es

Robert Nieuwenhuis, Albert Oliveras

claim paper

Read More »

11

click to vote

IANDC
2007

77views more IANDC 2007»

One-unambiguity of regular expressions with numeric occurrence indicators

13 years 4 months ago

Download www.cs.uku.fi

Pekka Kilpeläinen, Rauno Tuhkanen

claim paper

Read More »

8

click to vote

IANDC
2007

52views more IANDC 2007»

A general lock-free algorithm using compare-and-swap

13 years 4 months ago

Download dissertations.ub.rug.nl

Hui Gao, Wim H. Hesselink

claim paper

Read More »

11

click to vote

IANDC
2007

66views more IANDC 2007»

Quantitative temporal logics over the reals: PSpace and below

13 years 4 months ago

Download www.csc.liv.ac.uk

In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisﬁability by at least one exponential: while common qualitat...

Carsten Lutz, Dirk Walther, Frank Wolter

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers