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

Uloženo v:
Podrobná bibliografie
Vydáno v:Cybernetics and systems analysis Ročník 41; číslo 4; s. 494 - 499
Hlavní autoři: Kryvyj, S. L., Chebotarev, A. N.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.07.2005
Témata:
Algorithms
Cybernetics
Language
Logic
Studies
Systems analysis
ISSN:1060-0396, 1573-8337
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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]
Bibliografie: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