Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to
 

Summary: Modeling and Solving Semiring Constraint
Satisfaction Problems by Transformation to
Weighted Semiring Max-SAT
Louise Leenen1
, Anbulagan2
, Thomas Meyer3
, and Aditya Ghose4
1
DSL, SCSSE, University of Wollongong, Australia and DPSS, CSIR, South Africa
2
NICTA and ANU, Canberra, Australia
3
Meraka Institute, CSIR, Pretoria, South Africa
4
DSL, SCSSE, University of Wollongong, Australia
Abstract. We present a variant of the Weighted Maximum Satisfiability
Problem (Weighted Max-SAT), which is a modeling of the Semiring Con-
straint Satisfaction framework. We show how to encode a Semiring Con-
straint Satisfaction Problem (SCSP) into an instance of a propositional
Weighted Max-SAT, and call the encoding Weighted Semiring Max-SAT

  

Source: Anbulagan, A. - National ICT Australia & Computer Sciences Laboratory, Australian National University

 

Collections: Computer Technologies and Information Sciences