1011 search results - page 54 / 203 » The three dimensions of proofs |
163
click to vote
CSL
2004
Springer
15 years 10 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...
165
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
128
click to vote
ACL
1994
15 years 7 months ago
1994
We present an efficient procedure for cost-based abduction, which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algor...
135
click to vote
IANDC
2006
15 years 6 months ago
2006
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
131
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...