Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring Max-SAT

Authors:
Louise Leenen;Anbulagan Anbulagan;Thomas Meyer;Aditya Ghose
Affiliations:
DSL, SCSSE, University of Wollongong, Australia and DPSS, CSIR, South Africa;NICTA and ANU, Canberra, Australia;Meraka Institute, CSIR, Pretoria, South Africa;DSL, SCSSE, University of Wollongong, Australia
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 7
Cited 1

Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach

ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Decision diagrams for the computation of semiring valuations

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

Artificial Intelligence
Improved exact solvers for weighted Max-SAT

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems

PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a variant of theWeighted Maximum Satisfiability Problem (Weighted Max-SAT), which is a modeling of the Semiring Constraint Satisfaction framework. We show how to encode a Semiring Constraint Satisfaction Problem (SCSP) into an instance of a propositional Weighted Max-SAT, and call the encoding Weighted Semiring Max-SAT (WS-Max-SAT). The clauses in our encoding are highly structured and we exploit this feature to develop two algorithms for solving WS-Max-SAT: an incomplete algorithm based on the well-known GSAT algorithm for Max-SAT, and a branch-and-bound algorithm which is complete. Our preliminary experiments show that the translation of SCSP into WS-Max-SAT is feasible, and that our branch-and-bound algorithm performs surprisingly well. We aim in future to combine the natural flexible representation of the SCSP framework with the inherent efficiencies of SAT solvers by adjusting existing SAT solvers to solve WS-Max-SAT.