检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

7 篇 会议

馆藏范围

7 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

6 篇 工学
- 6 篇 计算机科学与技术...
- 2 篇 软件工程
- 1 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
4 篇 理学
- 3 篇 数学
- 2 篇 生物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

1 篇 computer science
1 篇 polynomial appro...
1 篇 delta modulation
1 篇 computability an...
1 篇 security systems
1 篇 dictionaries
1 篇 laboratories
1 篇 logic
1 篇 technology manag...
1 篇 distributed comp...
1 篇 smart cards
1 篇 collaboration
1 篇 pathology
1 篇 australia

机构

2 篇 laboratoire leib...
1 篇 automated reason...
1 篇 dept. of inf. en...
1 篇 laboratoire leib...
1 篇 automated reason...
1 篇 formal methods g...
1 篇 automated reason...
1 篇 automated reason...
1 篇 automated reason...
1 篇 automated reason...
1 篇 automated reason...
1 篇 formal methods g...
1 篇 department of in...

作者

5 篇 goré rajeev
3 篇 demri stéphane
1 篇 nguyên phuong th...
1 篇 y. umeda
1 篇 h. swaamura
1 篇 goré rajeev prab...
1 篇 r.k. meyer
1 篇 boyapati vijay
1 篇 nguyen lan duy

语言

7 篇 英文

检索条件"机构=Automated Reasoning Project and Dept. of Computer Science"

共 7 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

CardKt: automated multi-modal deduction on java cards for multi-application security 1st

引用

1st International Workshop on Java Cards, JavaCard 2000

作者： Goré, Rajeev Nguyen, Lan Duy Automated Reasoning Group Computer Sciences Laboratory Res. Sch. Of Inf. Sci. And Eng. Institute of Advanced Studies Australian National University Australia Formal Methods Group Dept. of Computer Science Australian National University Australia

ISBN: (纸本)9783540421672

We describe an implementation of a Java program to perform automated deduction in propositional multi-modal logics on a Java smart card. The tight space limits of Java smart cards make the implementation non-trivial. A potential application is to ensure that applets down-loaded off the internet conform to personalised security permissions stored on the Java card using a security policy encoded in multi-modal logic. In particular, modal logic may be useful to ensure that previously checked "trust" relationships between pre-existing multiple applets on a Java card are not broken by the addition of a new applet. That is, by using multi-modal logic to express notions of permissions and obligations, we can turn the security check into an on-board theorem proving task. Our theorem prover itself could be down-loaded "just in time" to perform the check, and then deleted to free up space on the card once the check has been completed. Our work is thus a "proof of principle" for the application of formal logic to the security of multi-application Java cards. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

CardS4: Modal theorem proving on java smartcards

引用

International Conference on Research in Smart Cards, E-smart 2001

作者： Goré, Rajeev Prabhakar Nguyên, Phuong Thê Automated Reasoning Group Computer Sciences Laboratory Res. Sch. of Inf. Sci. and Eng Institute of Advanced Studies Australian National University Australia Formal Methods Group Dept. of Computer Science Inf. Tech Australian National University Australia

ISBN: (纸本)3540426108

We describe a successful implementation of a theorem prover for modal logic S4 that runs on a Java smart card with only 512 KBytes of RAM and 32KBytes of EEPROM. Since proof search in S4 can lead to infinite branches, this is "proof of principle" that non-trivial modal deduction is feasible even on current Java cards. We hope to use this prover as the basis of an on-board security manager for restricting the flow of "secrets" between multiple applets residing on the same card, although much work needs to be done to design the appropriate modal logics of "permission" and "obligations". Such security concerns are the major impediments to the commercial deployment of multi-application smart cards. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

An O((n · log n)3)-time transformation from Grz into decidable fragments of classical first-order logic

An O((n · log n)3)-time transformation from Grz into decida...

引用

International Workshop on First-Order Theorem Proving, FTP'98

作者： Demri, Stéphane Goré, Rajeev Laboratoire LEIBNIZ - C.N.R.S. 46 av. Félix Viallet 38000 Grenoble France Automated Reasoning Project Dept. of Computer Science Australian National University ACT 0200 Canberra Australia

ISBN: (纸本)3540671900

The provability logic Grz is characterized by a class of modal frames that is not first-order definable. We present a simple embedding of Grz into decidable fragments of classical first-order logic such as FO2 and the guarded fragment. The embedding is an O((*** n)3)-time transformation that neither involves first principles about Turing machines (and therefore is easy to implement), nor the semantical characterization of Grz (and therefore does not use any second-order machinery). Instead, we use the syntactic relationships between cut-free sequent-style calculi for Grz, S4 and T. We first translate Grz into T, and then we use the relational translation from T into FO2. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Computational dialectics for argument-based agent systems

Computational dialectics for argument-based agent systems

引用

International Conference on MultiAgent Systems Proceedings

作者： H. Swaamura Y. Umeda R.K. Meyer Dept. of Inf. Eng. Niigata Univ. Japan Department of Information Engineering and Graduate School of Science and Technology Niigata University Ikarashi Niigata Japan Automated Reasoning Group Computer Science Laboratory Research School of Information Sciences and Engineering Australian National University Canberra ACT Australia

We introduce the static dialectical logics by Routley and Meyer (1976), and examine some dialectical inference rules to give them a breath of dialectical dynaminism of reasoning. Then we attempt to define Aufheben, compromise, reconciliation, etc., formally on top of the dialectical logics. Based on these results, we propose an argument-based agent system where several agents communicate, argue with each other and finally make a decision through argumentation, from knowledge bases distributed or dispersed on the network. If the agent system fails in attaining a consensus, then the Aufheben process attempts to make a dialectical agreement.

关键词： Logic Delta modulation computer science Laboratories Australia Distributed computing Collaboration Technology management Dictionaries

来源：评论

学校读者我要写书评

暂无评论

KtSeqC: System description

KtSeqC: System description

引用

International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999

作者： Boyapati, Vijay Goré, Rajeev Automated Reasoning Project and Dept. of Computer Science Australian National University CanberraACT Australia

ISBN: (纸本)3540660860

Architecture and Algorithm: KtSeqC is based upon the right sided labelled sequent system for tense logic Kt described in [BG98] which itself is based upon the work of [BP95,Mas94,HSZ96]. The work of Pitt [PC96] is closely related but Pitt uses the calculus KE incorporating an analytical cut-rule. We have also incorporated simplication as reported in [Mas98,HS98].

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tractable transformations from modal provability logics into first-order logic 16th

Tractable transformations from modal provability logics into...

引用

16th International Conference on automated Deduction, CADE 1999

作者： Demri, Stéphane Goré, Rajeev Laboratoire LEIBNIZ - C.N.R.S 46 av. Félix Viallet Grenoble38000 France Automated Reasoning Project and Dept. of Computer Science Australian National University Canberra0200 Australia

ISBN: (纸本)3540662227

We define a class of modal logics LF by uniformly extending a class of modal logics L. Each logic L is characterised by a class of first-order definable frames, but the corresponding logic LF is sometimes characterised by classes of modal frames that are not first-order definable. The class LF includes provability logics with deep arithmetical interpretations. Using Belnap's proof-theoretical framework Display Logic we characterise the "pseudo-displayable" subclass of LF and show how to define polynomial-time transformations from each such LF into the corresponding L, and hence into first-order classical logic. Theorem provers for classical first-order logic can then be used to mechanise deduction in these "psuedo-displayable second order" modal logics. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Cut-free display calculi for nominal tense logics

Cut-free display calculi for nominal tense logics

引用

International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1999

ISBN: (纸本)3540660860

We define cut-free display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL ≠) which is known to be properly displayable by application of Kracht’s results. The rules of the display calculus δMNTL for MNTL mimic those of the display calculus δMTL≠ for MTL≠. Since δMNTL does not satisfy Belnap’s condition (C8), we extend Wansing’s strong normalisation theorem to get a similar theorem for any extension of δMNTL by addition of structural rules satisfying Belnap’s conditions (C2)-(C7). Finally, we show a weak Sahlqvist-style theorem for extensions of MNTL, and by Kracht’s techniques, deduce that these Sahlqvist extensions of δMNTL also admit cut-free display calculi. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：