Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling

DOI10.1007/978-3-030-53288-8_22zbMath1478.68203OpenAlexW3043665946MaRDI QIDQ2225121

Stephan Gocht, Mate Soos, Kuldeep S. Meel

Publication date: 4 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-53288-8_22

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical problems of computer architecture (68M07) Computational aspects of satisfiability (68R07)

Related Items (7)

A Study of Symmetry Breaking Predicates and Model Counting ⋮ Projected model counting: beyond independent support ⋮ Non-clausal redundancy properties ⋮ SAT competition 2020 ⋮ CNF satisfiability in a subspace and related problems ⋮ On the usefulness of linear modular arithmetic in constraint programming ⋮ XOR local search for Boolean Brent equations

This page was built for publication: Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling