Porschen, Stefan and Speckenmeyer, Ewald (2007). Clause set structures and satisfiability. Working Paper.

[thumbnail of zaik2007-532.pdf]
Preview
 PDF
zaik2007-532.pdf
Download (282kB) | Preview

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.

Item Type: Monograph (Working Paper)
Creators:
Creators
Email
ORCID
ORCID Put Code
Porschen, Stefan
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Speckenmeyer, Ewald
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-549062
Date: 2007
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54906

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item