SAT-based versus CSP-based constraint weighting for satisfiability

  • Authors:

  • Duc Nghia Pham;John Thornton;Abdul Sattar;Abdelraouf Ishtaiwi

  • Affiliations:

  • Institute for Integrated and Intelligent System, Griffith University, Queensland, Australia;Institute for Integrated and Intelligent System, Griffith University, Queensland, Australia;Institute for Integrated and Intelligent System, Griffith University, Queensland, Australia;Institute for Integrated and Intelligent System, Griffith University, Queensland, Australia

  • Venue:
  • AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent research has focused on bridging the gap between the satisfiability (SAT) and constraint satisfaction problem (CSP) formalisms. One approach has been to develop a many-valued SAT formula (MV-SAT) as an intermediate paradigm between SAT and CSP, and then to translate existing highly efficient SAT solvers to the MV-SAT domain. Experimental results have shown this approach can achieve significant improvements in performance compared with the traditional SAT and CSP approaches. In this paper, we follow a different route, developing SAT solvers that can automatically recognise CSP structure hidden in SAT encodings. This allows us to look more closely at how constraint weighting can be implemented in the SAT and CSP domains. Our experimental results show that a SAT-based approach to handle weights, together with CSP-based approach to variable instantiation, is superior to other combinations of SAT and CSP-based approaches. A further experiment on the round robin scheduling problem indicates that this many-valued constraint weighting approach outperforms other state-of-the-art solvers.