Sciweavers

197 search results - page 4 / 40
» Advances in Local Search for Satisfiability
Sort
View
JETAI
2008
86views more  JETAI 2008»
13 years 8 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
14 years 5 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
IJCAI
2003
13 years 10 months ago
Combining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
Arathi Ramani, Igor L. Markov
DEXAW
1999
IEEE
152views Database» more  DEXAW 1999»
14 years 28 days ago
Advanced Metrics for Class-Driven Similarity Search
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
Paolo Avesani, Enrico Blanzieri, Francesco Ricci
AAAI
2000
13 years 10 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman