To Encode or to Propagate? The Best Choice for Each Constraint in SAT Ignasi Ab´ıo1 , Robert Nieuwenhuis2 , Albert Oliveras2 , Enric Rodr´ıguez-Carbonell2 , Peter J. Stuckey3 1

First Page		Document Content
Date: 2013-07-22 05:26:24 Theoretical computer science Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Constraint satisfaction Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Decomposition method Constraint		To Encode or to Propagate? The Best Choice for Each Constraint in SAT Ignasi Ab´ıo1 , Robert Nieuwenhuis2 , Albert Oliveras2 , Enric Rodr´ıguez-Carbonell2 , Peter J. Stuckey3 1 Add to Reading List Source URL: www.lsi.upc.edu Download Document from Source Website File Size: 160,96 KB Share Document on Facebook

	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon DocID: 1rsZm - View Document
	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract DocID: 1qYdf - View Document
	Boolean Lexicographic Optimization Joao Marques-Silva1 , Josep Argelich2 , Ana Grac¸a3 , and Inˆes Lynce3 1 2 CSI/CASL, University College Dublin, Ireland DocID: 1qMyc - View Document
	Solving Satisfiability Problems with Qualitative Preferences: a New Approach Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea DIST - Universit`a di Genova, Italy. email:{emanuele,enrico,marco}@dist.unige.it Abstra DocID: 1qDJG - View Document
	Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2 DocID: 1qp8W - View Document