9 search results - page 1 / 2 » Extracting MUSes |
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
FMCAD
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, a new heuristic-based approach is introduced to extract minimally unsatisfiable subformulas (in short, MUSes) of SAT instances. It is shown that it often outperforms...
CONSTRAINTS
2007
13 years 4 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
ACL
2010
13 years 2 months ago
2010
Automated summarization methods can be defined as "language-independent," if they are not based on any languagespecific knowledge. Such methods can be used for multiling...
CVPR
1996
IEEE
14 years 6 months ago
1996
IEEE
Despite many successful applications of robust statistics, they have yet to be completely adapted to many computer vision problems. Range reconstruction, particularly in unstructu...