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

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. [PUBLICATION ABSTRA...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis Vol. 41; no. 4; pp. 494 - 499
Main Authors: Kryvyj, S. L., Chebotarev, A. N.
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.07.2005
Subjects:
Algorithms
Cybernetics
Language
Logic
Studies
Systems analysis
ISSN:1060-0396, 1573-8337
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-005-0084-x