CNF encodings
S Prestwich - Handbook of satisfiability, 2021 - ebooks.iospress.nl
Before a combinatorial problem can be solved by current SAT methods, it must usually be
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …
A state-of-the-art realization of cyclic railway timetable computation
We describe the periodic event scheduling problem (PESP) based on periodic event
networks and extend it by symmetry constraints. The modeling power of the PESP is …
networks and extend it by symmetry constraints. The modeling power of the PESP is …
[PDF][PDF] Realization of c-inference as a SAT problem
C Beierle, M von Berg, A Sanin - The international FLAIRS …, 2022 - journals.flvc.org
Semantically based on Spohn's ranking functions, c-representations are special ranking
models obtained by assigning individual integer impacts to the conditionals in a knowledge …
models obtained by assigning individual integer impacts to the conditionals in a knowledge …
meSAT: multiple encodings of CSP to SAT
M Stojadinović, F Marić - Constraints, 2014 - Springer
One approach for solving Constraint Satisfaction Problems (CSP)(and related Constraint
Optimization Problems (COP)) involving integer and Boolean variables is reduction to …
Optimization Problems (COP)) involving integer and Boolean variables is reduction to …
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding: (Tool Presentation)
This paper describes a SAT-based CSP solver Azucar. Azucar solves a finite CSP by
encoding it into a SAT instance using the compact order encoding and then solving the …
encoding it into a SAT instance using the compact order encoding and then solving the …
On SAT representations of XOR constraints
M Gwynne, O Kullmann - … Conference on Language and Automata Theory …, 2014 - Springer
We consider the problem of finding good representations, via boolean conjunctive normal
forms F (clause-sets), of systems S of XOR-constraints x 1⊕…⊕ xn= ε, ε∈ 0, 1 (also called …
forms F (clause-sets), of systems S of XOR-constraints x 1⊕…⊕ xn= ε, ε∈ 0, 1 (also called …
Symbolic configuration for interactive container ship stowage planning
C Kroer, MK Svendsen, RM Jensen… - Computational …, 2016 - Wiley Online Library
Low‐cost containerized shipping requires high‐quality stowage plans. Scalable stowage
planning optimization algorithms have been developed recently. All of these algorithms …
planning optimization algorithms have been developed recently. All of these algorithms …
Satune: synthesizing efficient SAT encoders
H Gorjiara, GH Xu, B Demsky - … of the ACM on Programming Languages, 2020 - dl.acm.org
Modern SAT solvers are extremely efficient at solving boolean satisfiability problems,
enabling a wide spectrum of techniques for checking, verifying, and validating real-world …
enabling a wide spectrum of techniques for checking, verifying, and validating real-world …
Application of hierarchical hybrid encodings to efficient translation of CSPs to SAT
Solving Constraint Satisfaction Problems (CSPs) through Boolean Satisfiability (SAT)
requires suitable encodings for translating CSPs to equivalent SAT instances that can not …
requires suitable encodings for translating CSPs to equivalent SAT instances that can not …
[HTML][HTML] Weighted positive binary decision diagrams for exact probabilistic inference
Recent work on weighted model counting has been very successfully applied to the problem
of probabilistic inference in Bayesian networks. The probability distribution is encoded into a …
of probabilistic inference in Bayesian networks. The probability distribution is encoded into a …