Some Criteria for Converting Logical Formulas to Disjunction Normal Form

2023/05/02 by Bayjumanov, A.A.

paper · doi:10.34920/ijtaidt/vol_2023_issue_1_3

Abstract

Some important problems of transforming logical formulas of a general form based on the logical operations of implication, equivalence, addition modulo 2 and Schaeffer to the form of a disjunction normal form and estimating their complexity are considered. A local method is proposed for transforming general logical formulas into perfect disjunction and conjunction normal forms.

Related

• A Decision Procedure for Herbrand Formulae without Skolemization
• On the minimization k-valued logic functions in the class of disjunctive normal forms
• General Boolean Formula Minimization with QBF Solvers
• Disjunctive Logic Programs versus Normal Logic Programs
• Normal forms and representable functions in Moisil logic