Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319561" target="_blank" >RIV/00216208:11320/15:10319561 - isvavai.cz</a>

Result on the web

<a href="http://www.cs.nmsu.edu/ALP/2015/03/linear-ordering-in-the-sat-encoding-of-the-all-different-constraint-over-bit-vectors/" target="_blank" >http://www.cs.nmsu.edu/ALP/2015/03/linear-ordering-in-the-sat-encoding-of-the-all-different-constraint-over-bit-vectors/</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors

Original language description

A novel eager encoding of the ALLDIFFERENT constraint over bit-vectors is presented in this short paper. It is based on 1-to-1 mapping of the input bit-vectors to a linearly ordered set of auxiliary bit-vectors. Experiments with four SAT solvers showed that the new encoding could be solved order of magnitudes faster than the standard encoding in a hard unsatisfiable case.

Czech name

—

Czech description

—

Type

O - Miscellaneous

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů