30 search results - page 1 / 6 » Two Techniques for Minimizing Resolution Proofs |
SAT
2010
Springer
14 years 2 months ago
2010
Springer
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
CADE
2000
Springer
14 years 3 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
ARITH
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
MICCAI
2009
Springer
15 years 2 days ago
2009
Springer
In this paper, we present a novel algorithm for non-rigidly registering two high angular resolution diffusion weighted MRIs (HARDI), each represented by a Gaussian mixture field (G...