A new 3-CNF transformation by parallel-serial graphs

Authors:
Uwe Bubeck;Hans Kleine Büning
Affiliations:
University of Paderborn, Computer Science Institute, 33098 Paderborn, Germany;University of Paderborn, Computer Science Institute, 33098 Paderborn, Germany
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 1

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A note on disjunctive form tautologies

ACM SIGACT News

Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.89

Visualization

Abstract

For propositional formulas we present a new transformation into satisfiability equivalent 3-CNF formulas of linear length. The main idea is to represent formulas as parallel-serial graphs. This is a subclass of directed acyclic multigraphs where the edges are labeled with literals and the AND operation (respectively, the OR operation) is expressed as parallel (respectively, serial) connection.