Title of article
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency
Author/Authors
Hans Kleine Büning، نويسنده , , Xishun Zhao، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2002
Pages
5
From page
147
To page
151
Keywords
Formula homomorphism , Algorithms , propositional logic , Minimal unsatisfiability
Journal title
Information Processing Letters
Serial Year
2002
Journal title
Information Processing Letters
Record number
129602
Link To Document