4850 search results - page 177 / 970 » Proof and Computation in Geometry |
154
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
139
click to vote
LICS
2006
IEEE
16 years 15 days ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
154
click to vote
AAAI
1990
15 years 7 months ago
1990
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
167
click to vote
CSL
2007
Springer
16 years 20 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
173
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...