2020•STATE AND DEVELOPMENT PROSPECTS OF AGRIBUSINESS. In the frame of the XXIII Agribusiness Forum of the South of Russia and the Exhibition «Interagromash» Volume 1Requires access

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

N.I. Gdansky, A.A. Denisov

Open publisher page 0 citations

Abstract

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.

About this research paper

What this paper is about

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

Key concepts: Conjunctive normal form, Satisfiability, Boolean satisfiability problem, True quantified Boolean formula, Disjunctive normal form, Maximum satisfiability problem, Preprocessor, Conjunctive query