ScholarLens Back to search
2004•Acta Scientiarum Naturalium Universitatis SunyatseniRequires access

A Sufficient and Necessary Condition for Sat Problem

Qiu Hai-ming

Open publisher page 0 citations

Abstract

The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.An new concept of saturated conjunctive normal form is introduced and the nature of SAT problem is studied for utilizing the characteristic of saturated conjunctive normal form.Based on the sufficient and necessary condition for SAT problem,a new idea is provided for further study of the complete algorithm and non_complete fast algorithm of SAT problem.

About this research paper

What this paper is about

The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.An new concept of saturated conjunctive normal form is introduced and the nature of SAT problem is studied for utilizing the characteristic of saturated conjunctive normal form.Based on the sufficient and necessary condition for SAT problem,a new idea is provided for further study of the complete algorithm and non_complete fast algorithm of SAT problem.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.An new concept of saturated conjunctive normal form is introduced and the nature of SAT problem is studied for utilizing the characteristic of saturated conjunctive normal form.Based on the sufficient and necessary condition for SAT problem,a new idea is provided for further study of the complete algorithm and non_complete fast algorithm of SAT problem.

Key concepts: Conjunctive normal form, Boolean satisfiability problem, Disjunctive normal form, Conjunction (astronomy), Mathematics, Maximum satisfiability problem, NP-complete, Satisfiability

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Sufficient and Necessary Condition for Sat Problem — Research Paper | ScholarLens