SAT
2007
Springer
13 years 10 months ago
2007
Springer
SAT
2007
Springer
13 years 10 months ago
2007
Springer
SAT
2007
Springer
13 years 10 months ago
2007
Springer
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
