期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
命题公式真值表的生成与公式类型的机械判定 被引量:6
1
作者 张会凌 《甘肃联合大学学报(自然科学版)》 2006年第1期25-27,34,共4页
在文[1]的基础上,给出了命题逻辑中任一命题公式的真值表的生成算法与命题公式类型的判定算法,实现了利用计算机对有限多个命题公式的真值表的直接计算和输出,以及对一个命题公式是重言式、矛盾式或可满足式的机械判定.
关键词 命题公 真值表 计算机计算和输出 永真 永假可满足式 机械判定
下载PDF
命题公式类型的判定
2
作者 林运国 徐荣聪 《福建电脑》 2008年第3期23-23,共1页
本文提出如何判断一个公式为重言式、矛盾式、可满足式的方法。基于遗忘理论提出遗忘合式公式方法,在保持逻辑等值的条件下,遗忘掉公式的冗余命题变元,使得公式包含更少的命题变元,为判定命题公式类型提供一种能行的方法。
关键词 重言 矛盾 可满足式 遗忘理论
下载PDF
Clause-based enhancing mode for tableau algorithm for ALCN
3
作者 古华茂 石锦芹 高济 《Journal of Southeast University(English Edition)》 EI CAS 2008年第3期361-364,共4页
As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts(thus wasting much space),a clause-based enhancing mode designed for the language ALCN is proposed.Th... As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts(thus wasting much space),a clause-based enhancing mode designed for the language ALCN is proposed.This enhancing mode constructs a disjunctive normal form on concept expressions and keeps only one conjunctive clause,and then substitutes the obtained succinctest conjunctive clause for sub-concepts set in the labeling of nodes of a completion tree constructed by the tableau algorithm (such a process may be repeated as many times as needed).Due to the avoidance of tremendous descriptions redundancies caused by applying ∩- and ∪-rules of the ordinary tableau algorithm,this mode greatly improves the spatial performance as a result.An example is given to demonstrate the application of this enhancing mode and its reduction in the cost of space. Results show that the improvement is very outstanding. 展开更多
关键词 tableau algorithm enhancing mode CLAUSE SATISFIABILITY
下载PDF
CHECKING CONSISTENCY IN INFORMATION MODELS BY USING CONSTRAINT PROGRAMMING
4
作者 方捷 KAHN Hilary J CARPENTER Andy 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2005年第1期30-37,共8页
This paper addresses the issue of checking consistency in information models. A method based on constraint programming is proposed for identifying inconsistency or proving consistency in information models. The system... This paper addresses the issue of checking consistency in information models. A method based on constraint programming is proposed for identifying inconsistency or proving consistency in information models. The system described here checks information models written in the ISO standard information modelling language EXPRESS. EXPRESS is part of the ISO STEP standard used in the manufacturing and process industries. This paper describes the checking procedure, including EXPRESS model formalization, constraint satisfaction problem (CSP) derivation from the formalized model and satisfaction checking of the derived CSPs. This paper shows a new domain in which constraint programming can be exploited as model verification and validation. 展开更多
关键词 EXPRESS model constraint programming model verification
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部