Sciweavers

470 search results - page 60 / 94
» Tabu Search for SAT
Sort
View
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
SAT
2009
Springer
94views Hardware» more  SAT 2009»
14 years 2 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 1 months ago
Advanced models of cellular genetic algorithms evaluated on SAT
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Enrique Alba, Hugo Alfonso, Bernabé Dorrons...
ECAI
2008
Springer
13 years 9 months ago
WWW sits the SAT: Measuring Relational Similarity on the Web
Abstract. Measuring relational similarity between words is important in numerous natural language processing tasks such as solving analogy questions and classifying noun-modifier r...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
AAAI
2004
13 years 9 months ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...