Checking the Satisfiability of Formulas Represented in Disjunctive Normal Form in the Language L. I

  • Authors:

  • S. L. Kryvyj;A. N. Chebotarev

  • Affiliations:

  • Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

An original technique is proposed for checking the satisfiability of formulae represented in the logical language L in the form of a set of conjuncts. Satisfiability checking is performed by means of analysis and transformation of some relations defined over the set of conjuncts.