Mathematical Foundation of a Functional Implementation of the CNF Algorithm

The conjunctive normal form (CNF) algorithm is one of the best known and most widely used algorithms in classical logic and its applications. In its algebraic approach, it makes use in a loop of a certain well-defined operation related to the “distributivity” of logical disjunction versus conjunctio...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms Vol. 16; no. 10; p. 459
Main Authors: García-Olmedo, Francisco Miguel, García-Miranda, Jesús, González-Rodelas, Pedro
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.10.2023
Subjects:
Algorithms
Associativity
Boolean
Boolean algebra
Canonical forms
classical logic
CNF
Horn clauses
Iterative methods
Language
Logic
Mathematical analysis
reverse engineering
SAT problem
Semantics
Germany
ISSN:1999-4893, 1999-4893
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The conjunctive normal form (CNF) algorithm is one of the best known and most widely used algorithms in classical logic and its applications. In its algebraic approach, it makes use in a loop of a certain well-defined operation related to the “distributivity” of logical disjunction versus conjunction. For those types of implementations, the loop iteration runs a comparison between formulas to decide when to stop. In this article, we explain how to pre-calculate the exact number of loop iterations, thus avoiding the work involved in the above-mentioned comparison. After that, it is possible to concatenate another loop focused now on the “associativity” of conjunction and disjunction. Also for that loop, we explain how to calculate the optimal number of rounds, so that the decisional comparison phase for stopping can be also avoided.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a16100459