助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   knowledge operator 的翻译结果: 查询用时:0.216秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

knowledge operator
相关语句
  知识算子
     Semantics of Knowledge Operator in Nondeterministic Information Systems
     非确定信息系统中知识算子的语义
短句来源
  相似匹配句对
     Semantics of Knowledge Operator in Nondeterministic Information Systems
     非确定信息系统中知识算子的语义
短句来源
     On knowledge marketing
     论知识营销
短句来源
     Power of Knowledge
     知识的力量
短句来源
     dinger operator.
     dinger算子.
短句来源
     OPERATOR COMMANDS
     操作员命令
短句来源
查询“knowledge operator”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  knowledge operator
Valiev involving the knowledge operator K dedicated to the reasoning with incomplete information.
      
The first one is a concise introduction to epistemic (both propositional and predicate) logic with common knowledge operator.
      
Here it is shown that in fact hypothetical knowledge can be captured using the standard counterfactual operator ">amp;gt;" and the knowledge operator "K", provided that some assumptions are made regarding the interaction between the two.
      
It is this semantics that justifies interpreting the modal operator K of KFOPCE as a knowledge operator.
      


In computer systems based on knowledge,how to reason from knowledge is very impor-tant.Proceeding from rough sets,we can give a definition to a knowledge operator,E.Or-lowska has considered the situation in which the indiscernibility relation is an equivalence re-lation.But the indiscernibility relation is not transitive in general.We consider the situationin which the indiscernibility relation is a semi-equivalense relation,redefine upper and lowerapproximations of sets,and give the corresponding knowledge...

In computer systems based on knowledge,how to reason from knowledge is very impor-tant.Proceeding from rough sets,we can give a definition to a knowledge operator,E.Or-lowska has considered the situation in which the indiscernibility relation is an equivalence re-lation.But the indiscernibility relation is not transitive in general.We consider the situationin which the indiscernibility relation is a semi-equivalense relation,redefine upper and lowerapproximations of sets,and give the corresponding knowledge operators for them.We consid-er the situation of common knowledge and joint knowledge of a group of agents.Our resultsare extensions of E.Orlowska's results.

在基于知识的计算机系统中,如何对知识进行推理的方法是很重要的,从粗略集合出发,可以给出知识算子的定义,在[1]中,E.Orlowska 给出了不可辨明关系是等价关系的情形,由于我们一般情况下考查的不可辨明关系不具有传递性,我们考查了不可辨明关系是半等价关系的情形,重新给出了集合的上、下逼近的定义,给出了相应的知识算子,以及一组当事人的公共知识和合知识的情形,我们的结果是 E.Orlowska 的推广。

Temporal logics of knowledge have been widely used in the distributed systems community and in the expression for the specifications of protocols. The model checking for temporal logics of knowledge becomes a new and important research domain. So approaches to the “on the fly” model checking the temporal logics of knowledge are discussed. Based on the “on the fly” model checking approaches for temporal logics, and according to automata theory and the semantics of knowledge, the “on the...

Temporal logics of knowledge have been widely used in the distributed systems community and in the expression for the specifications of protocols. The model checking for temporal logics of knowledge becomes a new and important research domain. So approaches to the “on the fly” model checking the temporal logics of knowledge are discussed. Based on the “on the fly” model checking approaches for temporal logics, and according to automata theory and the semantics of knowledge, the “on the fly” model checking approaches to the temporal logics of knowledge are presented. These approaches, making the model checking for the specifications with knowledge operators, need only to construct a small portion of state space of system before a counterexample is found, and so avoid memory-shortage and state-explosion and realize “on the fly” model checking for the temporal logic of knowledge. And the time complexity of the algorithm is polynomial. Finally, the application to the verification of the TMN cryptographic protocol is illustrated to show the effectiveness of the approach.

时态认知逻辑已被广泛应用于分布式系统和协议的规范描述,模型检测时态认知规范已成为一个新的研究领域,因此着重研讨时态认知规范的“OntheFly”模型检测算法·在“OntheFly”模型检测时态逻辑描述规范的基础上,根据自动机理论、深度优先方法和知识的语义,提出了“OntheFly”模型检测时态认知规范的算法,该算法在模型检测带有知识算子的时态规范时,在找到一个反例之前,往往只需构造系统的部分甚至小部分状态空间,从而避免了时态认知规范的模型检测中内存不足和状态爆炸等问题,实现了“OntheFly”模型检测时态认知规范,并且算法的复杂性是多项式时间的·最后,通过该方法在验证TMN密码协议中的应用来作为一个例子说明该方法的有效性·

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关knowledge operator的内容
在知识搜索中查有关knowledge operator的内容
在数字搜索中查有关knowledge operator的内容
在概念知识元中查有关knowledge operator的内容
在学术趋势中查有关knowledge operator的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社