Sciweavers

Share
JSAT
2008
53views more  JSAT 2008»
9 years 7 months ago
Guest Editors Conclusion
Ewald Speckenmeyer, Armando Tacchella, Vasco M. Ma...
JSAT
2008
63views more  JSAT 2008»
9 years 7 months ago
Whose side are you on? Finding solutions in a biased search-tree
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
Marijn Heule, Hans van Maaren
JSAT
2008
89views more  JSAT 2008»
9 years 7 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening
JSAT
2008
83views more  JSAT 2008»
9 years 7 months ago
The First and Second Max-SAT Evaluations
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the ...
Josep Argelich, Chu Min Li, Felip Manyà, Jo...
JSAT
2008
85views more  JSAT 2008»
9 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
JSAT
2008
79views more  JSAT 2008»
9 years 7 months ago
PicoSAT Essentials
In this article we describe and evaluate optimized compact data structures for watching literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not...
Armin Biere
JSAT
2008
122views more  JSAT 2008»
9 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JSAT
2008
80views more  JSAT 2008»
9 years 7 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...
JSAT
2008
79views more  JSAT 2008»
9 years 7 months ago
An Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
Miguel F. Anjos
JSAT
2008
99views more  JSAT 2008»
9 years 7 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
books