助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   非单调性 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.024秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
逻辑学
更多类别查询

图标索引 历史查询
 

非单调性
相关语句
  non-monotonicity
    Theorem 1 indicates the feature of non-monotonicity for default reasoning.
    定理1表明了缺省推理的非单调性这一特点.
短句来源
  “非单调性”译为未确定词的双语例句
    A LINEAR LOGIC APPROACH TO NON-MONOTONIC AND INCONSISTENT INFORMATION
    非单调性和不一致性的处理——一个基于线性逻辑的方法
短句来源
    We also focus on partial volume (PV) interpolation algorithm .
    PV插值技术导致互信息相邻整数变换之间的非单调性
短句来源
查询“非单调性”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  non-monotonicity
A simple model of capillary hysteresis related with the non-monotonicity of the pore area to volume ratio function is proposed.
      
When the perturbation is periodic in time, this non-monotonicity leads to the existence of degenerate resonances.
      
This causes a non-monotonicity that precludes higher types from sorting themselves through the market for names, and leads to "sensible" dynamics: reputations, and name prices, increase after success and decrease after failure.
      
Instability and non-monotonicity phenomena in discretizations to boundary-value problems
      
Two noncontiguous areas with a high degree of non-monotonicity were observed.
      
更多          


Three theorems about defaul reasoning have been proved. Theorem 1 indicates the feature of non-monotonicity for default reasoning. The virtual meaning of Theorem 2 is that if W can deduce some default rules' consequents in D in a closed normal default theory (D, W), then one can delete such default rules from the theory, and derive a smaller default theory with equal extension. Especially if W can deduce all consequents in D in a theory (D, W), then the extension of (D, W) is equal to W.

本文证明了缺省推理中的三个定理.定理1表明了缺省推理的非单调性这一特点.定理2的实际意义在于,在一个封闭规范缺省理论(D,W)中,只要W能推出D中某些缺省的结论,则可以把这样的缺省规则从理论中删除,所得到的较小的缺省理论其延伸仍与原来缺省理论一样.尤其是若W能推出D中所有的缺省规则结论,则(D,W)的延伸就是W,这就是本文推论的结论.

In this paper, a theory named LI, which based on a fragment of linear logic, is put forward. In LI, effective results can be achieved when faced with inconsistent or non-monotonic information.

本文提出一种基于线性逻辑的理论L1,它除了能较好地反映常识推理的非单调性外,还可以在矛盾存在的情况下继续组织有效的推理。

Paraconsistent circumscription LPc is a non classical logic which has both nonmonotonicity and paraconsistency. It can be viewed as a formalism of commonsense reasoning with incomplete and inconsistent knowledge. In this paper, the results of computational complexity on propositional LPc and its implementation algorithm is presented. It is showed that LPc is NP complete. A linear algorithm to transform LPc into equivalent prioritized circumscription is provided. Because there are a number of useful algorithms...

Paraconsistent circumscription LPc is a non classical logic which has both nonmonotonicity and paraconsistency. It can be viewed as a formalism of commonsense reasoning with incomplete and inconsistent knowledge. In this paper, the results of computational complexity on propositional LPc and its implementation algorithm is presented. It is showed that LPc is NP complete. A linear algorithm to transform LPc into equivalent prioritized circumscription is provided. Because there are a number of useful algorithms for circumscription which could be implemented by resolution, a new way to implementation of LPc is drawn.

超协调限制逻辑LPc是一种同时具有非单调性和超协调性的非经典逻辑,它可作为在不完全与不协调知识下常识推理的形式化.给出了命题LPc的计算复杂性结果和算法实现,指出LPc是NP完全问题,并给出了将LPc转化为等价的优先限制逻辑的线性时间算法,由于限制逻辑具有实用的实现算法且可用归结方法实现,因而该算法为LPc的实现提供了新的途径.

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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