12 search results - page 2 / 3 » A Logical Characterisation of Linear Time on Nondeterministi... |
BIRTHDAY
2010
Springer
13 years 3 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
FOSSACS
2006
Springer
13 years 10 months ago
2006
Springer
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
POPL
2008
ACM
14 years 6 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
STACS
2007
Springer
14 years 10 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...