In this paper, we study how to encode the at-most-one (AMO) constraint in conjunctive
normal form (CNF). The AMO constraint means that at most one out of n propositional …

One of the most widely used constraints during the process of translating a practical problem
into a propositional satisfiability (SAT) instance is the at-most-one (AMO) constraint. This …

Despite their similarities, MaxSAT and MinSAT use different encodings and solving
techniques to cope with optimization problems. In this paper we describe a new weighted …

We first survey existing encondings from CSP into SAT, and define two new encodings: the
minimal support encoding and the interval-based support encoding. Then, we study how the …

We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a
number of new insights that we have gained from our analysis, which can be summarized as …

Many real-world applications can be expressed as constraint satisfaction problems (CSPs),
although hardly any problems are originally given by SAT formulas. Nevertheless, to benefit …

At the heart of computer science and artificial intelligence, logic is often used as a powerful
language to model and solve complex problems that arise in academia and in real-world …

Problem solving based on the Propositional Satisfiability Problem (SAT) is an active
research area in Artificial Intelligence, and has been successfully applied to solve both …

Influence of CNF Encodings of AtMost-1 Constraints on UNSAT-based PMSAT Solvers 1
Introduction Page 1 Informatica 37 (2013) 245–251 245 Influence of CNF Encodings of …

Influence of CNF Encodings of AtMost-1 Constraints on UNSAT-based PMSAT Solvers 1
Introduction Page 1 Informatica 37 (2013) 245–251 245 Influence of CNF Encodings of …