Back to Results
First PageMeta Content
Logic in computer science / NP-complete problems / Automated theorem proving / Constraint programming / Electronic design automation / Boolean satisfiability problem / Resolution / Conjunctive normal form / Satisfiability Modulo Theories / Theoretical computer science / Mathematics / Applied mathematics


Conflict-Guided Simplification for SAT Michael L. Case1,2 , Sanjit A. Seshia1 , Alan Mishchenko1 , and Robert K. Brayton1 1 2
Add to Reading List

Document Date: 2008-01-31 13:42:07

Open Document

File Size: 292,58 KB

Share Result on Facebook

City

Austin / /

Company

RTL / IBM / Berkeley IBM Systems / Intel / Technology Group / /

Facility

University of California / /

IndustryTerm

logic network / internal verification tool / search space / verification systems / /

OperatingSystem

Linux / /

Organization

University of California / Berkeley / US Federal Reserve / /

Product

Bounded Model Checking / /

ProvinceOrState

California / /

Technology

assignment Algorithm / Conflict-Guided Simplification algorithm / DPLL-style SAT algorithms / 3 Algorithm / CAV / finite state machine / Linux / /

SocialTag