Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

AICOM
2010

favoriteEmaildiscussreport

64views more AICOM 2010»

Practical algorithms for unsatisfiability proof and core generation in SAT solvers

13 years 5 months ago

Practical algorithms for unsatisfiability proof and core generation in SAT solvers

Download www.lsi.upc.edu

Roberto Javier Asín Achá, Robert Nie

Real-time Traffic

AICOM 2010 |

claim paper

Related Content

» OnTheFly Resolve Trace Minimization

» Finding Minimal Unsatisfiable Cores of Declarative Specifications

» On Finding All Minimally Unsatisfiable Subformulas

» Reduction of interpolants for logic synthesis

» On Resolution Proofs for Combinational Equivalence

» QB or Not QB An Efficient Execution Verification Tool for Memory Orderings

» SMTbased bounded model checking for multithreaded software in embedded systems

» Deciding BitVector Arithmetic with Abstraction

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	AICOM
Authors	Roberto Javier Asín Achá, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell

Comments (0)