842 search results - page 42 / 169 » Linear logic |
LCC
1994
14 years 1 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
CADE
1992
Springer
14 years 1 months ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
ACTA
2004
13 years 9 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
FUIN
2010
13 years 6 months ago
2010
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...