Dealing with 4-variables by resolution: An improved MaxSAT algorithm

We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for the Ma...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 670; s. 33 - 44
Hlavní autori:	Chen, Jianer, Xu, Chao, Wang, Jianxin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 29.03.2017
Predmet:	Branch and bound Maximum satisfiability Parameterized algorithm The resolution principle Maximum satisfiability Parameterized algorithm Branch and bound The resolution principle
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!