Sciweavers

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

12

ECAI
2006
Springer

favoriteEmaildiscussreport

104views Artificial Intelligence» more ECAI 2006»

Extracting MUSes

13 years 8 months ago

Extracting MUSes

Download www.cril.univ-artois.fr

Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extracting MUSes can thus prove valuable because it circumscribes the sources of contradiction in an instance. In this paper, a new heuristic-based approach to approximate or compute MUSes is presented. It is shown that it often outperforms current competing ones.

Éric Grégoire, Bertrand Mazure, C&ea

Real-time Traffic

Artificial Intelligence | ECAI 2006 | MUSes | Sat Instances | Smallest Explanations |

claim paper

Related Content

» Tracking MUSes and Strict Inconsistent Covers

» Localsearch Extraction of MUSes

» A New Approach to Improving Multilingual Summarization Using a Genetic Algorithm

» MUSE Robust Surface Fitting using Unbiased Scale Estimates

» A Bayesian marked point process for object detection Application to muse hyperspectral dat...

» On Finding All Minimally Unsatisfiable Subformulas

» OntologyBased Information Extraction for Business Intelligence

» Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ECAI
Authors	Éric Grégoire, Bertrand Mazure, Cédric Piette

Comments (0)