Sciweavers

152 search results - page 1 / 31
» Boosting MUS Extraction
Sort
View
SARA
2007
Springer
13 years 11 months ago
Boosting MUS Extraction
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
Santiago Macho González, Pedro Meseguer
SAT
2005
Springer
122views Hardware» more  SAT 2005»
13 years 10 months ago
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
Maher N. Mneimneh, Inês Lynce, Zaher S. Andr...
FROCOS
2009
Springer
13 years 8 months ago
Efficient Combination of Decision Procedures for MUS Computation
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
WEBI
2010
Springer
13 years 2 months ago
Boosting Biomedical Entity Extraction by Using Syntactic Patterns for Semantic Relation Discovery
Biomedical entity extraction from unstructured web documents is an important task that needs to be performed in order to discover knowledge in the veterinary medicine domain. In ge...
Svitlana Volkova, Doina Caragea, William H. Hsu, J...
BMCBI
2010
114views more  BMCBI 2010»
13 years 4 months ago
Detection of gene orthology from gene co-expression and protein interaction networks
Background: Ortholog detection methods present a powerful approach for finding genes that participate in similar biological processes across different organisms, extending our und...
Fadi Towfic, Susan VanderPlas, Casey A. Oliver, Ol...