Clause set structures and satisfiability

Porschen, Stefan and Speckenmeyer, Ewald (2007) Clause set structures and satisfiability.
Technical Report , 23 p.

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.


Actions:
Download: [img] PDF
Download (282kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik2007-532
Depositing User: Stefan Porschen
Date Deposited: 30 Jan 2007 00:00
Last Modified: 19 Dec 2011 09:44
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/532