"Clause set structures and satisfiability"
Technical report by Stefan Porschen, Ewald Speckenmeyer, available as BibTeX Source and in portable document format.
Zentrum für Angewandte Informatik Köln, Lehrstuhl Speckenmeyer
Preprint Key:	zaik2007-532
Keywords:	autarky, closure operator, CNF satisfiability, fibre-transversal, hypergraph
MSC codes:	03B05, 05C85, 68Q25
This technical report has 23 pages, was written in January 2007, it has not been published.
Abstract:	We propose a new perspective on propositional clause sets and on that basis we investigate (new) polynomial time SAT-testable classes. Moreover, we study autarkies using a closure concept. A specific simple type of closures the free closures leads to a further formula class called hyperjoins that is studied w.r.t. SAT.