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!

Be the first to leave a comment!