AI Chat AI Image Generator AI Video Text to Speech

Reducing SAT to Max2XOR

04/04/2022

∙

by Carlos Ansótegui, et al.

∙

∙

Representing some problems with XOR clauses (parity constraints) can allow to apply more efficient reasoning techniques. In this paper, we present a gadget for translating SAT clauses into Max2XOR constraints, i.e., XOR clauses of at most 2 variables equal to zero or to one. Additionally, we present new resolution rules for the Max2XOR problem which asks for which is the maximum number of constraints that can be satisfied from a set of 2XOR equations.

Carlos Ansótegui
7 publications
Jordi Levy
6 publications

page 1

page 13

research

∙ 02/10/2018

SAT solving techniques: a bibliography

We present a selective bibliography about efficient SAT solving, focused...

0 Louis Abraham, et al. ∙

research

∙ 09/12/2013

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the tw...

0 Matthew Gwynne, et al. ∙

research

∙ 05/17/2023

Function synthesis for maximizing model counting

Given a boolean formula Φ(X, Y, Z), the Max#SAT problem asks for finding...

0 Thomas Vigouroux, et al. ∙

research

∙ 02/20/2018

Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4

In this paper we construct preimage attack on the truncated variant of t...

0 Gribanova Irina, et al. ∙

research

∙ 05/07/2014

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

In this paper we present the Transalg system, designed to produce SAT en...

0 Ilya Otpuschennikov, et al. ∙

research

∙ 05/25/2019

Image Detection and Digit Recognition to solve Sudoku as a Constraint Satisfaction Problem

Sudoku is a puzzle well-known to the scientific community with simple ru...

0 Aditya Narayanaswamy, et al. ∙

research

∙ 06/09/2023

Explaining SAT Solving Using Causal Reasoning

The past three decades have witnessed notable success in designing effic...

0 Jiong Yang, et al. ∙