CHECKING THE SATISFIABILITY OF FORMULAS REPRESENTED IN DISJUNCTIVE NORMAL FORM IN THE LANGUAGE L. I

S. L. Kryvyj; A. N. Chebotarev

首页> 外文期刊>Cybernetics and Systems Analysis >CHECKING THE SATISFIABILITY OF FORMULAS REPRESENTED IN DISJUNCTIVE NORMAL FORM IN THE LANGUAGE L. I

【24h】

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.

机译：提出了一种原始技术，用于检查以一组合词形式表示的逻辑语言L中表示的公式的可满足性。可满足性检查是通过分析和转换在合集上定义的某些关系来执行的。

著录项

来源
《Cybernetics and Systems Analysis》 |2005年第4期|p.494-499|共6页
作者
S. L. Kryvyj; A. N. Chebotarev;
展开▼
作者单位

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

展开▼
收录信息美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词
reactive algorithms; specification; language L; formula satisfiability; depth of a formula; set of conjuncts;

机译：反应性算法;规范;语言L;公式可满足性;公式的深度;合集;

相似文献

外文文献
中文文献
专利

1. CHECKING THE SATISFIABILITY OF FORMULAS REPRESENTED IN DISJUNCTIVE NORMAL FORM IN THE LANGUAGE L. II [J] . S. L. Kryvyj, A. N. Chebotarev Cybernetics and Systems Analysis . 2005,第6期

机译：在语言L中检查以不规则正态表示的公式的可满足性
2. Construction of the Tests of Combinational Circuit Failures by Analyzing the Orthogonal Disjunctive Normal Forms Represented by the Alternative Graphs [J] . A. Yu. Matrosova, A. G. Pleshkov, R. R. Ubar Automation and Remote Control . 2005,第2期

机译：通过分析备用图表示的正交析取范式构造组合电路故障测试
3. Minimizing disjunctive normal form formulas and AC(0) circuits given a truth table [J] . Allender E, Hellerstein L, McCabe P, SIAM Journal on Computing . 2009,第1期

机译：给定真值表，最小化析取范式和AC（0）电路
4. Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L [C] . Anatoly Chebotarev, Sergey Krivoi Perspectives of Systems Informatics; Lecture Notes in Computer Science; 4378 . 2006

机译：基于改进的基于分辨率的语言L满意度检查方法
5. Formal Analysis of Electronic System Level Models using Satisfiability Modulo Theories and Automata Checking. [D] . Chang, Che-Wei. 2015

机译：使用满意度模理论和自动机检查对电子系统级模型进行形式化分析。
6. Representing Information in Patient Reports Using Natural Language Processing and the Extensible Markup Language [O] . Carol Friedman, George Hripcsak, Lyuda Shagina, 1999

机译：使用自然语言处理和可扩展标记语言在患者报告中表示信息
7. METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY [O] . N.I. Gdansky, A.A. Denisov 2020

机译：减少在联合正常形式中表示的大布尔公式的方法，以确定其可靠性

CHECKING THE SATISFIABILITY OF FORMULAS REPRESENTED IN DISJUNCTIVE NORMAL FORM IN THE LANGUAGE L. I

摘要

著录项

相似文献

相关主题

期刊订阅