Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
0905.3757
Cited By
Circuit Complexity and Decompositions of Global Constraints
22 May 2009
C. Bessiere
G. Katsirelos
Nina Narodytska
T. Walsh
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Circuit Complexity and Decompositions of Global Constraints"
13 / 13 papers shown
Title
On CNF formulas irredundant with respect to unit clause propagation
Petr Savický
29
0
0
04 Sep 2023
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Alexander A. Semenov
K. Chukharev
Egor Tarasov
D. Chivilikhin
Viktor Kondratiev
33
1
0
04 Oct 2022
SAT vs CSP: a commentary
T. Walsh
28
2
0
27 Sep 2019
Propagation complete encodings of smooth DNNF theories
P. Kucera
P. Savický
AI4CE
16
6
0
14 Sep 2019
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
A. Semenov
I. Otpuschennikov
I. Gribanova
O. Zaikin
S. Kochemazov
30
16
0
17 May 2018
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
Amit Metodi
M. Codish
Peter Stuckey
44
39
0
04 Feb 2014
A New Look at BDDs for Pseudo-Boolean Constraints
Ignasi Abío
R. Nieuwenhuis
Albert Oliveras
Enric Rodríguez-carbonell
Valentin Mayer-Eichberger
AI4CE
51
79
0
23 Jan 2014
On SAT representations of XOR constraints
Matthew Gwynne
O. Kullmann
48
19
0
12 Sep 2013
Towards a theory of good SAT representations
Matthew Gwynne
O. Kullmann
64
9
0
18 Feb 2013
Generalising unit-refutation completeness and SLUR via nested input resolution
Matthew Gwynne
O. Kullmann
55
19
0
29 Apr 2012
Translation-based Constraint Answer Set Solving
C. Drescher
T. Walsh
45
10
0
20 Apr 2011
Decomposition of the NVALUE constraint
C. Bessiere
G. Katsirelos
Nina Narodytska
Claude-Guy Quimper
T. Walsh
69
22
0
17 Sep 2009
Decompositions of All Different, Global Cardinality and Related Constraints
C. Bessiere
G. Katsirelos
Nina Narodytska
Claude-Guy Quimper
T. Walsh
98
35
0
22 May 2009
1