68 search results - page 4 / 14 » Three Tactic Theorem Proving |
APPROX
2009
Springer
14 years 11 days ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
CSL
2004
Springer
13 years 9 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
ECAI
2004
Springer
13 years 9 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...