Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CP
2005
Springer

favoriteEmaildiscussreport

97views Artificial Intelligence» more CP 2005»

Solving Over-Constrained Problems with SAT

13 years 10 months ago

Solving Over-Constrained Problems with SAT

Download lia.deis.unibo.it

Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We ﬁrst deﬁne a clausal form formalism that deals with blocks of clauses and distinguish between hard and soft blocks. We then present two Max-SAT-based solvers for our formalism and an experimental investigation.

Josep Argelich, Felip Manyà

Real-time Traffic

Clausal Form Formalism | CP 2005 | Problem Solving Approach | Programming Languages | Soft Blocks |

claim paper

Related Content

» Solving OverConstrained Problems with SAT Technology

» Solving OverConstrained Temporal Reasoning Problems Using Local Search

» QUICKXPLAIN Preferred Explanations and Relaxations for OverConstrained Problems

» Dynamic Constraint Weighting for OverConstrained Problems

» New Lower Bounds of Constraint Violations for OverConstrained Problems

» Discriminative Learning over Constrained Latent Representations

» Solving Weighted MaxSAT Problems in a Reduced Search Space A Performance Analysis

» Guided Local Search for Solving SAT and Weighted MAXSAT Problems

» A System for Solving Constraint Satisfaction Problems with SMT

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Josep Argelich, Felip Manyà

Comments (0)