Resolution versus Search: Two Strategies for SAT Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine

First Page		Document Content
Date: 2000-11-01 13:42:40 Mathematics Automated theorem proving Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Conjunctive normal form Unit propagation Resolution Theoretical computer science Constraint programming Applied mathematics		Resolution versus Search: Two Strategies for SAT Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine Add to Reading List Source URL: www.ics.uci.edu Download Document from Source Website File Size: 727,31 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