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...

Celý popis

Podrobná bibliografia

Vydané v:	Cybernetics and systems analysis Ročník 41; číslo 4; s. 494 - 499
Hlavní autori:	Kryvyj, S. L., Chebotarev, A. N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer Nature B.V 01.07.2005
Predmet:	Algorithms Cybernetics Language Logic Studies Systems analysis
ISSN:	1060-0396, 1573-8337
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!