<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Computational complexity theory / Operations research / Logic in computer science / Mathematical optimization / NP-complete problems / Boolean algebra / Maximum satisfiability problem / Boolean satisfiability problem / Constraint satisfaction / Solver
Date: 2012-12-16 04:54:55
Theoretical computer science
Mathematics
Computational complexity theory
Operations research
Logic in computer science
Mathematical optimization
NP-complete problems
Boolean algebra
Maximum satisfiability problem
Boolean satisfiability problem
Constraint satisfaction
Solver

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Add to Reading List

Source URL: www.mancoosi.org

Download Document from Source Website

File Size: 91,96 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Mathematics / Computational complexity theory / Operations research / Logic in computer science / Mathematical optimization / NP-complete problems / Boolean algebra / Maximum satisfiability problem / Boolean satisfiability problem / Constraint satisfaction / Solver

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Theoretical computer science / Automated planning and scheduling / Logic in computer science / Mathematics / Computational complexity theory / Boolean algebra / Electronic design automation / Formal methods / Boolean satisfiability problem / Maximum satisfiability problem / Planning Domain Definition Language / Satz

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

Theoretical computer science / Mathematics / Mathematical optimization / Numerical analysis / Combinatorial optimization / Operations research / Constraint programming / Logic in computer science / Maximum satisfiability problem / Linear programming / Constrained optimization / Solver

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

Theoretical computer science / Logic in computer science / Mathematics / Maximum satisfiability problem / Boolean satisfiability problem / DPLL algorithm

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

Theoretical computer science / Logic in computer science / Combinatorial optimization / Maximum satisfiability problem / Unit propagation / Constraint programming / Mathematics / Mathematical logic

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