132 search results - page 12 / 27 » Lower bounds for modal logics |
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or...
101
click to vote
DLOG
2011
14 years 1 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
LPAR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
TCS
2011
14 years 5 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
CORR
2004
Springer
14 years 10 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...