550 search results - page 6 / 110 » Context Semantics, Linear Logic and Computational Complexity |
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
107
click to vote
FOSSACS
2007
Springer
15 years 1 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
NAACL
2010
14 years 7 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
ICTAC
2007
Springer
15 years 3 months ago
2007
Springer
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LT...
TCS
2011
14 years 4 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 ...