On SAT Representations of XOR Constraints

DOI10.1007/978-3-319-04921-2_33zbMath1408.68077arXiv1309.3060OpenAlexW3099325101MaRDI QIDQ5404931

Matthew Gwynne, Oliver Kullmann

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.3060

zbMATH Keywords

monotone circuitsmonotone span programsarc consistencyparity constraintsacyclic incidence graphunit-propagation complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Irreducible subcube partitions ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ DRAT Proofs for XOR Reasoning ⋮ Generalising unit-refutation completeness and SLUR via nested input resolution

This page was built for publication: On SAT Representations of XOR Constraints