On SAT Representations of XOR Constraints-Reference-Cited by-同舟云学术

On SAT Representations of XOR Constraints

Published:2014 Issue: Volume: Page:409-420
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Gwynne Matthew,Kullmann Oliver

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-04921-2_33

Reference28 articles.

1. Babai, L., Gál, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica 19(3), 301–319 (1999)

2. Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 412–418 (2009)

3. Biere, A., Heule, M.J., van Maaren, H., Walsh, T.: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (February 2009)

4. Lecture Notes in Computer Science;L. Bordeaux,2012

5. Lecture Notes in Computer Science;N.T. Courtois,2007

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integrating Exact Simulation into Sweeping for Datapath Combinational Equivalence Checking;2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD);2023-10-28

2. Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions;Artificial Intelligence;2021-10

3. XOR Local Search for Boolean Brent Equations;Theory and Applications of Satisfiability Testing – SAT 2021;2021

4. DRAT Proofs for XOR Reasoning;Logics in Artificial Intelligence;2016

5. Automatic Generation of Propagation Complete SAT Encodings;Lecture Notes in Computer Science;2015-12-25