Sciweavers

83

IGPL
2000

82views more IGPL 2000»

The Computational Complexity of Hybrid Temporal Logics

15 years 2 months ago

The Computational Complexity of Hybrid Temporal Logics

Download www.loria.fr

Carlos Areces, Patrick Blackburn, Maarten Marx

claim paper

Read More »

94

Voted

IGPL
2000

68views more IGPL 2000»

Reachability Logic: An Efficient Fragment of Transitive Closure Logic

15 years 2 months ago

Reachability Logic: An Efficient Fragment of Transitive Closure Logic

Download www.cs.nott.ac.uk

Natasha Alechina, Neil Immerman

claim paper

Read More »