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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 719 条记录，以下是591-600 订阅

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

详细简洁

排序：

Non-oblivious Strategy Improvement

Non-oblivious Strategy Improvement

引用

16th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)

作者： Fearnley, John Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

ISBN: (纸本)9783642175107

We study strategy improvement algorithms for mean-payoff and parity games. We describe a structural property of these games, and we show that these structures can affect the behaviour of strategy improvement. We show how awareness of these structures can be used to accelerate strategy improvement algorithms. We call our algorithms non-oblivious because they remember properties of the game that they have discovered in previous iterations. We show that non-oblivious strategy improvement algorithms perform well on examples that are known to be hard for oblivious strategy improvement. Hence, we argue that previous strategy improvement algorithms fail because they ignore the structural properties of the game that they are solving.

关键词： Structural properties

来源：评论

学校读者我要写书评

暂无评论

Generating efficient, terminating logic programs 7th

引用

7th international Joint conference on theory and Practice of Software Development, TAPSOFT 1997

作者： Martin, Jonathan C. King, Andy Department of Electronics and Computer Science University of Southampton SouthamptonSO9 5NH United Kingdom Computing Laboratory University of Kent at Canterbury CanterburyCT2 7NF United Kingdom

ISBN: (纸本)9783540627814

the objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial solutions have been proposed where the generated programs are either incorrect or inefficient. We show how the control generation problem can be tackled with a simple automatic transformation that relies on information about the depths of SLD-trees. To prove correctness of our transform we introduce the notion of a semi delay recurrent program which generalises previous ideas in the termination literature for reasoning about logic programs with dynamic selection rules. © Springer-Verlag Berlin Heidelberg 1997.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Cc Τ on stage: Generalised uniform equivalence testing for verifying student assignment solutions

引用

10th international conference on logic programming and nonmonotonic reasoning, LPNMR 2009

作者： Oetsch, Johannes Seidl, Martina Tompits, Hans Woltran, Stefan Institut für Informationssysteme Technische Universität Wien Favoritenstrae 9-11 A-1040 Vienna Austria Institut für Softwaretechnik Technische Universität Wien Favoritenstrae 9-11 A-1040 Vienna Austria

ISBN: (纸本)3642042376

the tool cc Τ is an implementation for testing various parameterised notions of program correspondence between logic programs under the answer-set semantics, based on reductions to quantified propositional logic. One such notion is relativised uniform equivalence with projection, which extends standard uniform equivalence via two additional parameters: one for specifying the input alphabet and one for specifying the output alphabet. In particular, the latter parameter is used for projecting answer sets to the set of designated output atoms, i.e. ignoring auxiliary atoms during answer-set comparison. In this paper, we discuss an application of cc Τ for verifying the correctness of students' solutions drawn from a laboratory course on logic programming, employing relativised uniform equivalence with projection as the underlying program correspondence notion. We complement our investigation by discussing a performance evaluation of cc Τ, showing that discriminating among different back-end solvers for quantified propositional logic is a crucial issue towards optimal performance. © 2009 Springer Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Computer Aided threat Identification

Computer Aided Threat Identification

引用

13th IEEE international conference on Commerce and Enterprise Computing (CEC)

作者： Asnar, Yudistira Li, Tong Massacci, Fabio Paci, Federica Univ Trento DISI Trento Italy Tsinghua Univ Sch Software Beijing Peoples R China

ISBN: (纸本)9780769545356

Recently, there has been an increase of reported security threats hitting organizations. Some of them are originated from the assignments to users of inappropriate permissions on organizational sensitive data. thus it is crucial for organizations to recognize as early as possible the risks deriving by inappropriate access right management and to identify the solutions that they need to prevent such risks. In this paper, we propose a framework to identify threats during the requirements analysis of organizations' IT systems. With respect to other works which have attempted to include security analysis into requirement engineering process (e.g., KAOS, Elahi et al., Asnar et al.), our framework does not rely on the level of expertise of the security analyst to detect threats but allows to automatically identify threats that derive from inappropriate access management. To capture the organization's setting and the system stakeholders' requirements, we adopt SI* [1], a requirement engineering framework founded on the concepts of actors, goals, tasks and resources. this framework extends SI* with a reasoning technique that identifies potential security threats on resources and relevant goals. the reasoning is based on Answer Set programming ( ASP) logic rules that take into account the relationships between resources and the delegation of permission relations between actors. We illustrate this framework using an eHealth scenario.

关键词： Cognition Computers Drugs Hospitals SI Security Silicon access right management answer set programming logic rules computer aided threat identification eHealth scenario health care inference mechanisms knowledge representation languages organisational aspects organization IT systems organizational sensitive data reasoning technique requirement engineering process requirements analysis security analysis security of data systems analysis

来源：评论

学校读者我要写书评

暂无评论

Canonicity!

引用

4th international Joint conference on Automated reasoning

作者： Dershowitz, Nachum Tel Aviv Univ Sch Comp Sci IL-69978 Ramat Aviv Israel

ISBN: (纸本)9783540710691

We describe an abstract proof-theoretic framework based on normal-form proofs, defined using well-founded orderings on proof objects. this leads to robust notions of canonical presentation and redundancy. Fairness of deductive mechanisms - in this general framework - leads to completeness or saturation. the method has so far been applied to the equational, Horn-clause, and deduction-modulo cases.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Verification and synthesis in description logic based dynamic systems

Verification and synthesis in description logic based dynami...

引用

7th international conference on Web reasoning and Rule Systems, RR 2013

作者： Calvanese, Diego De Giacomo, Giuseppe Montali, Marco Patrizi, Fabio Free University of Bozen-Bolzano Piazza Domenicani 3 39100 Bolzano Italy Sapienza Università di Roma Via Ariosto 25 00185 Rome Italy

ISBN: (纸本)9783642396656

In this paper, we devise a general framework for formalizing Description logic Based Dynamic Systems that is parametric w.r.t. the description logic knowledge base and the progression mechanism of interest. Using this framework we study verification and adversarial synthesis for specifications expressed in a variant of first-order μ-calculus, with a controlled form of quantification across successive states. We provide key decidability results for both verification and synthesis, under a "bounded-state" assumption. We then study two instantiations of this general framework, where the description logic knowledge base is expressed in DL-Lite and scriptAscriptLscriptCscriptQscriptI, respectively. © 2013 Springer-Verlag.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Constructing Markov logic Networks from First-Order Default Rules 1

引用

25th international conference on Inductive logic programming (ILP)

作者： Kuzelka, Ondrej Davis, Jesse Schockaert, Steven Cardiff Univ Sch Comp Sci & Informat Cardiff S Glam Wales Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (数字)9783319405667

ISBN: (纸本)9783319405667;9783319405650

Expert knowledge can often be represented using default rules of the form "if A then typically B". In a probabilistic framework, such default rules can be seen as constraints on what should be derivable by MAP-inference. We exploit this idea for constructing a Markov logic network M from a set of first-order default rules D, such that MAP inference from M exactly corresponds to default reasoning from D, where we view first-order default rules as templates for the construction of propositional default rules. In particular, to construct appropriate Markov logic networks, we lift three standard methods for default reasoning. the resulting Markov logic networks could then be refined based on available training data. Our method thus offers a convenient way of using expert knowledge for constraining or guiding the process of learning Markov logic networks.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A prototype development of a declarative approach for computer system security 29

A prototype development of a declarative approach for comput...

引用

29th international conference on Computer Applications in Industry and Engineering, CAINE 2016

作者： Bai, Yun Caprin, Edward Zhang, Yan Artificial Intelligence Research Group School of Computing Engineering and Mathematics Western Sydney University Australia

ISBN: (纸本)9781943436040

In information security, representation and reasoning of authorization policy has been a key research topic in this field especially in a sophisticated information sharing and exchange environment [6, 7, 9]. In such a scenario, an user's request to access the system may not be able to decide straightaway, it may initiate a sequence of complex executions of authorization commands in order to determine either to grant or deny such a request. Becker and Nanz's logic of State-Modifying Policies (SMP) is a formal system addressing such problem in access control. In this paper, we provide a declarative semantics for SMP through a translation from SMP to Answer Set programming (ASP) and propose a system prototype to implement our approach. Our experimental results show that our ASP implementation for SMP reasoning is effective to deal with real world problem domains. Copyright ISCA, CAINE 2016.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Deductive and inductive reasoning on spatio-temporal data

引用

15th international conference on Applications of Declarative programming and Knowledge Management (INAP 2004)/18th Workshop on logic programming (WLP 2004)

作者： Nanni, M Raffaetà, A Renso, C Tirini, F CNR USTU I-56100 Pisa Italy Univ Ca Foscari Venezia Dipartimento Informat Venice Italy Univ Pisa Dipartimento Fis I-56100 Pisa Italy

ISBN: (纸本)3540255605

We present a framework for a declarative approach to spatio-temporal reasoning on geographical data, based on the constraint logical language STACLP, which offers deductive and inductive capabilities. It can be exploited for a deductive rule-based approach to represent domain knowledge on data. Furthermore, it is well suited to model trajectories of moving objects, which can be analysed by using inductive techniques, like clustering, in order to find common movement patterns. A sketch of a case study on behavioural ecology is presented.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Correct reasoning about logic programs

Correct reasoning about logic programs

引用

27th international conference on logic programming, ICLP 2011

作者： Kriener, Jael School of Computing University of Kent CT2 7NF United Kingdom

ISBN: (纸本)9783939897316

In this PhD project, we present an approach to the problem of determinacy inference in logic programs with cut, which treats cut uniformly and contextually. the overall aim is to develop a theoretical analysis, abstract it to a suitable domain and prove both the concrete analysis and the abstraction correct in a formal theorem prover (Coq). A crucial advantage of this approach, besides the guarantee of correctness, is the possibility of automatically extracting an implementation of the analysis.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共72页 << < 56 57 58 59 60 61 62 63 64 65 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：