Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas

In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution refutation system. Broadly, a read-once resolution refutation is one in which each constraint (input or derived) is used at most once. Read-once resol...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 90; no. 1; pp. 3 - 29
Main Authors:	Subramani, K., Wojciechowski, Piotr
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.01.2022 Springer Springer Nature B.V
Subjects:	Algorithms Analysis Artificial Intelligence Boolean Canonical forms Complex Systems Computer Science Design parameters Logic programs Mathematics Parameterization Polynomials Exact exponential algorithms Read-once resolution 09 27 2CNF 90
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!