Reducibility of 3CNF Formulas

We introduce the Prime Normal Form, defined over the Prime Truth Assignments of a 3CNF formula, thus propose a procedure tackling the 3SAT problem from a different perspective. Instead of deciding if the formula is satisfiable, the procedure decides if the PNF of the formula is reducible to Canonic Truth Assignments. A CTA is a (consistent) conjunction of some PTAs, and a satisfying assignment is a conjunction of some CTAs.

Authors

Publication Details

Published
2025-09-25
DOI
https://doi.org/10.33774/coe-2025-l7gm7
Primary Topic
Synthesis and Properties of Aromatic Compounds
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reducibility of 3CNF Formulas

Latif Salum
Synthesis and Properties of Aromatic Compounds
article

Reducibility of 3CNF Formulas

Latif Salum
article en

Abstract

We introduce the Prime Normal Form, defined over the Prime Truth Assignments of a 3CNF formula, thus propose a procedure tackling the 3SAT problem from a different perspective. Instead of deciding if the formula is satisfiable, the procedure decides if the PNF of the formula is reducible to Canonic Truth Assignments. A CTA is a (consistent) conjunction of some PTAs, and a satisfying assignment is a conjunction of some CTAs.

Openalex Percentile: Top 80%
Synthesis and Properties of Aromatic Compounds
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Reducibility of 3CNF Formulas — Latif Salum · (2025) | TGRS Research Map | TGRS