From clauses to klauses
Satisfiability (SAT) solvers have been using the same input format for decades: a formula in
conjunctive normal form. Cardinality constraints appear frequently in problem descriptions …
conjunctive normal form. Cardinality constraints appear frequently in problem descriptions …
Syrust: automatic testing of rust libraries with semantic-aware program synthesis
Rust's type system ensures the safety of Rust programs; however, programmers can side-
step some of the strict typing rules by using the unsafe keyword. A common use of unsafe …
step some of the strict typing rules by using the unsafe keyword. A common use of unsafe …
Hamiltonian cycle reconfiguration with answer set programming
The Hamiltonian cycle reconfiguration problem is defined as determining, for a given
Hamiltonian cycle problem and two among its feasible solutions, whether one is reachable …
Hamiltonian cycle problem and two among its feasible solutions, whether one is reachable …
Answer set programming modulo acyclicity
Acyclicity constraints are prevalent in knowledge representation and applications where
acyclic data structures such as DAGs and trees play a role. Recently, such constraints have …
acyclic data structures such as DAGs and trees play a role. Recently, such constraints have …
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
E Zulkoski, C Bright, A Heinle, I Kotsireas… - Journal of Automated …, 2017 - Springer
We present a method and an associated system, called MathCheck, that embeds the
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …
MathCheck: A math assistant via a combination of computer algebra systems and SAT solvers
We present a method and an associated system, called MathCheck, that embeds the
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …
In pursuit of an efficient SAT encoding for the Hamiltonian cycle problem
NF Zhou - International Conference on Principles and Practice of …, 2020 - Springer
SAT solvers have achieved remarkable successes in solving various combinatorial
problems. Nevertheless, it remains a challenge to find an efficient SAT encoding for the …
problems. Nevertheless, it remains a challenge to find an efficient SAT encoding for the …
Concise integer linear programming formulation for clique partitioning problems
M Koshimura, E Watanabe, Y Sakurai, M Yokoo - Constraints, 2022 - Springer
Abstract A Clique Partitioning Problem (CPP) finds an optimal partition of a given edge-
weighted undirected graph, such that the sum of the weights is maximized. This general …
weighted undirected graph, such that the sum of the weights is maximized. This general …
Chinese remainder encoding for Hamiltonian cycles
MJH Heule - Theory and Applications of Satisfiability Testing–SAT …, 2021 - Springer
Abstract The Hamiltonian Cycle Problem (HCP) consists of two constraints: i) each vertex
contributes exactly two edges to the cycle; and ii) there is exactly one cycle. The former can …
contributes exactly two edges to the cycle; and ii) there is exactly one cycle. The former can …
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
R Kiesel, A Schidler - 2023 Proceedings of the Symposium on Algorithm …, 2023 - SIAM
We propose a new approach to the Directed Feedback Vertex Set Problem (DFVSP), where
the input is a directed graph and the solution is a minimum set of vertices whose removal …
the input is a directed graph and the solution is a minimum set of vertices whose removal …