Algorithms for variable-weighted 2-SAT and dual problems

被引：0

作者：

Porschen, Stefan ^{[1
]}

Speckenmeyer, Ewald ^{[1
]}

机构：

[1] Univ Cologne, Inst Informat, Pohligstr 1, D-50969 Cologne, Germany

来源：

THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2007, PROCEEDINGS | 2007年 / 4501卷

关键词：

weighted satisfiability; optimization problem; NP-hardness; edge cover; graph factor; perfect matching;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we study NP-hard variable-weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds holding for arbitrary real-valued weights. Moreover, we consider the monotone dual class consisting of clause Sets where all variables occur at most twice. We show that weighted SAT, XSAT and NAESAT optimization problems for this class are polynomial time solvable using appropriate reductions to specific polynomial time solvable graph problems.

引用

页码：173 / +

页数：3

共 50 条

[1] Minimizing Variable-Weighted X3SAT
Porschen, Stefan
Plagge, Galyna
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 449 - 454
[2] On variable-weighted exact satisfiability problems
Stefan Porschen
Annals of Mathematics and Artificial Intelligence, 2007, 51 : 27 - 54
[3] On variable-weighted exact satisfiability problems
Porschen, Stefan
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2007, 51 (01) : 27 - 54
[4] Random 2-SAT: results and problems
de la Vega, WF
THEORETICAL COMPUTER SCIENCE, 2001, 265 (1-2) : 131 - 146
[5] Variable-weighted PLS
Xu, Lu
Jiang, Jian-Hui
Wu, Hal-Long
Shen, Guo-Li
Yu, Ru-Qin
CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2007, 85 (01) : 140 - 143
[6] Algorithms for counting 2-SAT solutions and colorings with applications
Furer, Martin
Kasiviswanathan, Shiva Prasad
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 47 - +
[7] On 2-SAT and renamable horn
del Val, A
SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 279 - 284
[8] Random 2-SAT and unsatisfiability
Verhoeven, Y
INFORMATION PROCESSING LETTERS, 1999, 72 (3-4) : 119 - 123
[9] The number of 2-sat functions
Béla Bollobás
Graham R. Brightwell
Imre Leader
Israel Journal of Mathematics, 2003, 133 : 45 - 60
[10] A remark on random 2-SAT
Goerdt, A
DISCRETE APPLIED MATHEMATICS, 1999, 97 : 107 - 110

← 1 2 3 4 5 →