目的関数付き充足可能性問題に対するラグランジュの方法を用いた近似解法(一般講演)

抄録

The Satisfiability (SAT) problem is one of the most important problems in the computer science and it is well known as famous NP complete problem. In the past years, some efficient techniques for solving the SAT have been developed, and we have proposed a technique called LPPH. For the SAT, only solutions which satisfy the given CNF are required. However, in practice, there exists some objective function which represents the cost of solutions. In this paper, we study an optimization problem OSAT defined as follows: for a give CNF, find a truth assignment that minimize a given linear objective function. For solving the OSAT we propose a technique which is an extended version of the LPPH.