Clingcon: The next generation
M Banbara, B Kaufmann, M Ostrowski… - Theory and Practice of …, 2017 - cambridge.org
We present the third generation of the constraint answer set system clingcon, combining
Answer Set Programming (ASP) with finite domain constraint processing (CP). While its …
Answer Set Programming (ASP) with finite domain constraint processing (CP). While its …
From Single-Objective to Bi-Objective Maximum Satisfiability Solving
The declarative approach is key to efficiently finding optimal solutions to various types of NP-
hard real-world combinatorial optimization problems. Most work on practical declarative …
hard real-world combinatorial optimization problems. Most work on practical declarative …
Improving the normalization of weight rules in answer set programs
Cardinality and weight rules are important primitives in answer set programming. In this
context, normalization means the translation of such rules back into normal rules, eg, for the …
context, normalization means the translation of such rules back into normal rules, eg, for the …
Solving multiobjective discrete optimization problems with propositional minimal model generation
We propose a propositional logic based approach to solve MultiObjective Discrete
Optimization Problems (MODOPs). In our approach, there exists a one-to-one …
Optimization Problems (MODOPs). In our approach, there exists a one-to-one …
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints
Many constraint satisfaction and optimisation problems can be solved effectively by
encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the …
encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the …
Proposal and evaluation of hybrid encoding of CSP to SAT integrating order and log encodings
This paper proposes a new hybrid encoding of finite linear CSP to SAT which integrates
order and log encodings. The former maintains bound consistency by unit propagation and …
order and log encodings. The former maintains bound consistency by unit propagation and …
An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations
Pseudo-Boolean (PB) constraints are ubiquitous in Constraint Satisfaction Problems.
Encoding such constraints to SAT has proved to be an efficient solving approach. A …
Encoding such constraints to SAT has proved to be an efficient solving approach. A …
Abacus: A new hybrid encoding for sat problems
C Vasconcellos-Gaete, V Barichard… - 2020 IEEE 32nd …, 2020 - ieeexplore.ieee.org
Encoding an instance of a Constraint Satisfaction Problem (CSP) into a Propositional
Satisfiability Problem (SAT) instance is usually a good way to benefit from the highly efficient …
Satisfiability Problem (SAT) instance is usually a good way to benefit from the highly efficient …
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 …
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT
solvers has proven to be highly effective by the award-winning sugar system. We here …
solvers has proven to be highly effective by the award-winning sugar system. We here …