13383 search results - page 243 / 2677 » Abstractions from proofs |
152
click to vote
AML
2005
15 years 6 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
157
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
187
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
170
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
180
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...