EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2

First Page		Document Content
Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics		EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Download Document from Source Website File Size: 419,52 KB Share Document on Facebook

	1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP) DocID: 1ukgD - View Document
	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone: DocID: 1roWY - View Document
	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin DocID: 1rd10 - View Document
	Microsoft PowerPoint - perspCompatibility Mode] DocID: 1r0cq - View Document