Sciweavers

142 search results - page 11 / 29
» On-the-Fly Clause Improvement
Sort
View
EMNLP
2009
13 years 5 months ago
Review Sentiment Scoring via a Parse-and-Paraphrase Paradigm
This paper presents a parse-and-paraphrase paradigm to assess the degrees of sentiment for product reviews. Sentiment identification has been well studied; however, most previous ...
Jingjing Liu, Stephanie Seneff
ICTAI
2009
IEEE
14 years 2 months ago
Learning for Dynamic Assignments Reordering
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
Saïd Jabbour
JSAT
2006
109views more  JSAT 2006»
13 years 7 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
RSA
2006
68views more  RSA 2006»
13 years 7 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
SAT
2009
Springer
124views Hardware» more  SAT 2009»
14 years 2 months ago
Cardinality Networks and Their Applications
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [ES06] in that ...
Roberto Asín, Robert Nieuwenhuis, Albert Ol...