281 search results - page 23 / 57 » The Proof Complexity of Linear Algebra |
LICS
1997
IEEE
14 years 4 days ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
CP
2000
Springer
13 years 11 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
FAC
2002
13 years 7 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
ICFEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
AML
2008
13 years 8 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...