학술논문
Satisfiability problem: Some polynomial classes of conjunctive normal forms
Document Type
Article
Author
Source
Cybernetics and Systems Analysis; January 1992, Vol. 28 Issue: 1 p144-147, 4p
Subject
Language
ISSN
10600396; 15738337
Abstract
The NP-complete problem of satisfiability of conjunctive normal forms (CNF) is considered. Necessary and sufficient conditions of CNF satisfiability are derived and some polynomial classes of CNF are identified.