Sciweavers

101 search results - page 14 / 21
» A Case for Simple SAT Solvers
Sort
View
ICTAI
2009
IEEE
14 years 2 months ago
Learning for Dynamic Subsumption
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
Youssef Hamadi, Saïd Jabbour, Lakhdar Sais
OOPSLA
2009
Springer
14 years 1 months ago
S.P.L.O.T.: software product lines online tools
This paper introduces S.P.L.O.T., a Web-based reasoning and configuration system for Software Product Lines (SPLs). The system benefits from mature logic-based reasoning techniq...
Marcílio Mendonça, Moises Branco, Do...
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 1 months ago
SAT-based optimal hypergraph partitioning with replication
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
Michael G. Wrighton, André DeHon
IJISEC
2008
101views more  IJISEC 2008»
13 years 7 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
ACL
2012
11 years 9 months ago
Polarity Consistency Checking for Sentiment Dictionaries
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or ...
Eduard C. Dragut, Hong Wang, Clement T. Yu, A. Pra...