Research on conversion from conjunctive normal form to disjunctive normal form
Zongtian Liu
Abstract
Zongtian Liu
Abstract
In order to calculate the discernable function of rough set,intent reduction of concept lattice of formal concept analysis and rule simplification in logic program design,that conversion from Conjunction Normal Form(CNF)to Disjunction Normal Form(DNF) is proposed as a critical problem.By using minimal cover,realize the conversion from CNF to DNF and give an incremental algorithm.In order to expand the use of normal form conversion,define a pseudo-CNF,and give the conversion method form pseudo-CNF to DNF.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to calculate the discernable function of rough set,intent reduction of concept lattice of formal concept analysis and rule simplification in logic program design,that conversion from Conjunction Normal Form(CNF)to Disjunction Normal Form(DNF) is proposed as a critical problem.By using minimal cover,realize the conversion from CNF to DNF and give an incremental algorithm.In order to expand the use of normal form conversion,define a pseudo-CNF,and give the conversion method form pseudo-CNF to DNF.
Key concepts: Conjunctive normal form, Disjunctive normal form, Computer science, Reduction (mathematics), Rough set, Mathematics, Canonical normal form, Algorithm