275 search results - page 17 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
CSL
1999
Springer
13 years 12 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
LPAR
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
JACM
2010
13 years 6 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...