中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
completeness of neighbourhood logic

文献类型:期刊论文

作者Barua Rana ; Roy Suman ; Chaochen Zhou
刊名Journal of Logic and Computation
出版日期2000
卷号10期号:2页码:271-295
关键词Artificial intelligence Computational methods Computer programming languages Real time systems Set theory Theorem proving
ISSN号0955792X
收录类别EI
语种英语
公开日期2011-07-29
附注This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well
源URL[http://124.16.136.157/handle/311060/13660]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Barua Rana,Roy Suman,Chaochen Zhou. completeness of neighbourhood logic[J]. Journal of Logic and Computation,2000,10(2):271-295.
APA Barua Rana,Roy Suman,&Chaochen Zhou.(2000).completeness of neighbourhood logic.Journal of Logic and Computation,10(2),271-295.
MLA Barua Rana,et al."completeness of neighbourhood logic".Journal of Logic and Computation 10.2(2000):271-295.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。