13 search results - page 3 / 3 » Undecidability of Propositional Separation Logic and Its Nei... |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
BIRTHDAY
2010
Springer
13 years 4 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...