Modelling Max-CSP as Partial Max-SAT
From MaRDI portal
Publication:3502687
DOI10.1007/978-3-540-79719-7_1zbMath1138.68531MaRDI QIDQ3502687
Josep Argelich, Felip Manyà, Inês Lynce, Alba Cabiscol
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/56663
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Reformulation based MaxSat robustness, Multi-language evaluation of exact solvers in graphical model discrete optimization, Sequential Encodings from Max-CSP into Partial Max-SAT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical approach to efficient Max-SAT solving
- Exact Max-SAT solvers for over-constrained problems
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- The Log-Support Encoding of CSP into SAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
- A Complete Calculus for Max-SAT