34 search results - page 1 / 7 » Local-search Extraction of MUSes |
CONSTRAINTS
2007
13 years 6 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...
ECAI
2006
Springer
13 years 10 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 10 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...
SIGIR
2012
ACM
11 years 9 months ago
2012
ACM
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
ACL
2010
13 years 4 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...