Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345

First Page		Document Content
Date: 2013-07-29 01:10:58 Automated theorem proving Boolean algebra NP-complete problems Constraint programming Logic in computer science Boolean satisfiability problem Davis–Putnam algorithm Satisfiability Unit propagation Theoretical computer science Mathematics Computational complexity theory		Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345 Add to Reading List Source URL: www.cse.unsw.edu.au Download Document from Source Website File Size: 620,87 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