Determination of the Class of Validity of Logical Formulas by Directed Exhaustive Search

Authors:
A. E. Litvinenko
Affiliations:
National Aviation University, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2000

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is described for the proof of satisfiability, general validity, and inconsistency of logical formulas. The algorithm is based on the method of directed exhaustive search for variants of truth values of variables.