1738 search results - page 3 / 348 » Local Consistency and SAT-Solvers |
KR
2010
Springer
14 years 7 days ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
IEEEHPCS
2010
13 years 6 months ago
2010
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
SAT
2004
Springer
14 years 24 days ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
JETAI
2008
13 years 7 months ago
2008
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...