Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

被引：0

作者：

Ordyniak, Sebastian ^{[1
]}

Paulusma, Daniel ^{[2
]}

Szeider, Stefan ^{[1
]}

机构：

[1] Vienna Univ Technol, Inst Informat Syst, A-1040 Vienna, Austria

[2] Univ Durham, Sch Engn & Comp Sci, Durham DH1 3LE, England

来源：

THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011 | 2011年 / 6695卷

基金：

英国工程与自然科学研究理事会;

关键词：

CLIQUE-WIDTH; HYPERGRAPHS; ALGORITHMS; GRAPHS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the first part of this work (FSTTCS' 10) we have shown that the satisfiability of CNF formulas with beta-acyclic hypergraphs can be decided in polynomial time. In this paper we continue and extend this work. The decision algorithm for beta-acyclic formulas is based on a special type of Davis-Putnam resolution where each resolvent is a subset of a parent clause. We generalize the class of beta-acyclic formulas to more general CNF formulas for which this type of Davis-Putnam resolution still applies. We then compare the class of beta-acyclic formulas and this superclass with a number of known polynomial formula classes.

引用

页码：47 / 60

页数：14

共 50 条

[11] Shortest paths in almost acyclic graphs
Wagner, DK
OPERATIONS RESEARCH LETTERS, 2000, 27 (04) : 143 - 147
[12] Testing satisfiability of CNF formulas by computing a stable set of points
Eugene Goldberg
Annals of Mathematics and Artificial Intelligence, 2005, 43 : 65 - 89
[13] Testing satisfiability of CNF formulas by computing a stable set of points
Goldberg, E
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2005, 43 (1-4) : 65 - 89
[14] Keeping Avoider's graph almost acyclic
Clemens, Dennis
Ehrenmueller, Julia
Person, Yury
Tuan Tran
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
[15] ON SOME BANDWIDTH RESTRICTED VERSIONS OF THE SATISFIABILITY PROBLEM OF PROPOSITIONAL CNF FORMULAS
ARVIND, V
BISWAS, S
THEORETICAL COMPUTER SCIENCE, 1989, 68 (02) : 123 - 134
[16] ON CERTAIN BANDWIDTH RESTRICTED VERSIONS OF THE SATISFIABILITY PROBLEM OF PROPOSITIONAL CNF FORMULAS
ARVIND, V
BISWAS, S
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 456 - 469
[17] Acyclic heaps of pieces, II
Green, RM
GLASGOW MATHEMATICAL JOURNAL, 2004, 46 : 459 - 476
[18] Formulas for counting acyclic digraph Markov equivalence classes
Gillispie, SB
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2006, 136 (04) : 1410 - 1432
[19] COMPUTING ROOTED COMMUNICATION RELIABILITY IN AN ALMOST ACYCLIC DIGRAPH
HAGSTROM, JN
NETWORKS, 1991, 21 (05) : 581 - 593
[20] Fixed point theorems for almost and utmost acyclic contractions
Basha, S. Sadiq
ACTA SCIENTIARUM MATHEMATICARUM, 2024,

← 1 2 3 4 5 →