Title of article
On the use of autarkies for satisfiability decision
Author/Authors
Kullmann، نويسنده , , Oliver، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
23
From page
231
To page
253
Abstract
Autarkies are generalizations of satisfying assignments for conjunctive normal forms and detect “redundant” clauses, clauses which can not be used for refutations. Starting from an abstract theory of autarkies (in the framework of monoids operating on ordered sets) and autarky systems (restrictions of the notion of general autarkies), we discuss several autarky systems for generalized clause-sets, and the relation to polynomial time computability.
Keywords
RESOLUTION , qualitative matrix analysis , matching theory , Polynomial time , autarky , the operation of a monoid on an ordered set , conjunctive normal form , Constraint satisfaction problem , deficiency
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453241
Link To Document