Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

DOI10.1613/jair.3809zbMath1267.68216arXiv1402.0568OpenAlexW3102811762WikidataQ129493544 ScholiaQ129493544MaRDI QIDQ4913754

Peter J. Stuckey, Amit Metodi, Michael Codish

Publication date: 9 April 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemsSAT encodingBoolean equi-propagation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Optimal-depth sorting networks ⋮ Breaking symmetries in graph search with canonizing sets ⋮ Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking ⋮ Coupling different integer encodings for SAT ⋮ Breaking symmetries with high dimensional graph invariants and their combination ⋮ Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description) ⋮ Clingcon: The next generation ⋮ Sorting nine inputs requires twenty-five comparisons ⋮ SAT and IP based algorithms for magic labeling including a complete search for total magic labelings

Uses Software

• MINION

This page was built for publication: Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems