Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber

First Page		Document Content
Date: 2005-09-13 07:36:36 Theoretical computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Isabelle Constructible universe LCF Mathematics (SAT -UNSAT)		Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber Add to Reading List Source URL: user.it.uu.se Download Document from Source Website File Size: 351,69 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