Negational normal form
From Wikipedia, the free encyclopedia
Negative Normal form is way to represent the formula by keeping the negation symbol only to the literals.
If α and φ are boolean formulas, then α
φ , α
φ, 
α, α
φ are all boolean formulas. The boolean formulas are made up of literals which are propositional atoms. A formula can be converted to the NNF by simply moving the negations across braces either using De morgans laws or the property that 
α is α itself.
[edit] External links
- [aracne.usal.es/congress/PDF/AntonioMoreno.pdf Math logic tutor]
 |
This article is uncategorized.
Please help improve this article by adding it to one or more categories, so it may be associated with related articles (how?). Please remove this tag after categorizing, but not before. |
