MaxSAT is a very popular language for discrete optimization with many domains of
application. While there has been a lot of progress in MaxSAT solvers during the last …

There is increasing awareness in the planning community that the burden of specifying
complete domain models is too high, which impedes the applicability of planning technology …

Some clausal form transformation algorithms used in SAT solving cannot be used in
MaxSAT solving because they preserve satisfiability but do not preserve the minimum …

The Implicit Hitting Set (HS) approach has shown very effective for MaxSAT solving.
However, only preliminary promising results have been obtained for the very similar …

Motivated by the success of preprocessing in Boolean satisfiability (SAT) solving,
development and analysis of preprocessing in maximum satisfiability (MaxSAT)—the …

Computationally hard optimization problems are commonplace not only in theory but also in
practice in many real-world domains. Even determining whether a solution exists can be NP …

A Pesquisa Operacional (PO) engloba o desenvolvimento e a aplicação de métodos e
técnicas de resolução de problemas, tais como otimização matemática, simulação, teoria …

Optimization refers to the process of searching for a best solution to a given problem where
“best” depends on the underlying problem. We face optimization problems in our lives on a …

Some clausal form transformation algorithms used in SAT solving cannot be used in
MaxSAT solving because they preserve satisfiability but do not preserve the minimum …