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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,428 篇 会议
70 册 图书
56 篇 期刊文献

馆藏范围

1,553 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,261 篇 工学
- 1,246 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

388 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
16 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
6 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1554 条记录，以下是681-690 订阅

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

详细简洁

排序：

16th international conference on logic for programming, artificial intelligence and reasoning, LPAR 2010

16th International Conference on Logic for Programming, Arti...

引用

16th international conference on logic for programming, artificial intelligence and reasoning, LPAR 2010

ISBN: (纸本)9783642175107

the proceedings contain 28 papers. the special focus in this conference is on logic for programming. the topics include: logic and computation in a lambda calculus with intersection and union types;graded alternating-time temporal logic;non-oblivious strategy improvement;a simple class of kripke-style models in which logic and computation have equal standing;Label-free proof systems for intuitionistic modal logic IS5;an intuitionistic epistemic logic for sequential consistency on shared memory;disunification for ultimately periodic interpretations;synthesis of trigger properties;semiring-induced propositional logic: Definition and basic algorithms;speed-up techniques for negation in grounding;dafny: An automatic program verifier for functional correctness;relentful strategic reasoning in alternating-time temporal logic;counting and enumeration problems with bounded treewidth;the nullness analyser of julia;Qex: Symbolic SQL query explorer;automated proof compression by invention of new definitions;atomic cut introduction by resolution: Proof structuring and compression;satisfiability of Non-linear (Ir)rational arithmetic;coping with selfish on-going behaviors;constraint-Based Abstract Semantics for Temporal logic: A Direct Approach to Design and Implementation;on the equality of probabilistic terms;program logics for homogeneous meta-programming;verifying pointer and string analyses with region type systems;ABC: Algebraic bound computation for loops;hardness of preorder checking for basic formalisms;a quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A polynomial reduction from ASPDA to ASP 6th

A polynomial reduction from ASPDA to ASP

引用

6th international conference on Web reasoning and Rule Systems, RR 2012

作者： Faber, Wolfgang Department of Mathematics University of Calabria RendeCS87030 Italy

ISBN: (纸本)9783642332029

ASPDA is a framework for expressing defeasibility in Answer Set Programs via so-called argumentation theories, proposed by Wan, Kifer, and Grosof in [2]. the authors describe a reduction from ASPDA to plain Answer Set programming, which however exponentially inflate programs. In this note, we present an alternative reduction, which does not suffer from this problem. As a side-effect, complexity results for ASPDA are established. © Springer-Verlag Berlin Heidelberg 2012.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Possible world semantics for defeasible deontic logic

Possible world semantics for defeasible deontic logic

引用

11th international conference on Deontic logic in Computer Science, DEON 2012

作者： Governatori, Guido Rotolo, Antonino Calardo, Erica NICTA Software Systems Research Group Australia CIRSFID University of Bologna Italy

ISBN: (纸本)9783642315695

Defeasible Deontic logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible logics remained elusive. In this paper we address this issue. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Representing fuzzy logic programs by graded attribute implications 1

引用

9th international conference on Modeling Decisions for artificial intelligence, MDAI 2012

作者： Kuhr, Tomas Vychodil, Vilem Dept. Computer Science Palacky University Olomouc 17. listopadu 12 CZ-77146 Olomouc Czech Republic

ISBN: (数字)9783642346200

ISBN: (纸本)9783642346194

We present a link between two types of logic systems for reasoning with graded if-then rules: the system of fuzzy logic programming (FLP) in sense of Vojtáš and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characterized by correct answers for the program. Conversely, we show that for each definite program there is a collection of formulas of FAL so that the correct answers can be represented by the entailment in FAL. Using the link, we can transport results from FAL to FLP and vice versa which gives us, e.g., a syntactic characterization of correct answers based on Pavelka-style Armstrong-like axiomatization of FAL. © 2012 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Meta programming with answer sets for smart spaces 6th

Meta programming with answer sets for smart spaces

引用

6th international conference on Web reasoning and Rule Systems, RR 2012

作者： Janhunen, Tomi Luukkala, Vesa Aalto University Department of Information and Computer Science Finland Nokia Research Center United States

ISBN: (纸本)9783642332029

A smart space is an ecosystem of interacting computational objects embedded in some environment. the space seamlessly provides users with information and services using the best available resources. In this paper, the interoperability of heterogeneous objects participating in a smart space is enhanced by publishing their behavioral rules as RDF triples, i.e., in the same way as any other information in the space. this enables the use of answer-set programming (ASP) as the underlying paradigm for rule-based reasoning. the main idea of this paper is to apply meta programming techniques to reified ASP rules published in the smart space. Such techniques enable syntactic and semantic transformations of rules without essentially changing the underlying computational platform so that standard ASP tools can be used to implement inference over rules. these ideas are illustrated in several ways. In addition to basic meta evaluation tasks, we describe a meta grounder for ASP rules involving variables. Moreover, we demonstrate how the qualitative aspects of reasoning can be taken into account in our approach and how meta programming techniques are made available to users. © Springer-Verlag Berlin Heidelberg 2012.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Temporal answer set programming

Temporal answer set programming

引用

28th international conference on logic programming, ICLP 2012

作者： Diéguez, Martín University of Corunna Corunna Spain

ISBN: (纸本)9783939897439

Answer Set programming (ASP) has become a popular way for representing different kinds of scenarios from knowledge representation in artificial intelligence. Frequently, these scenarios involve a temporal component which must be considered. In ASP, time is usually represented as a variable whose values are defined by an extensional predicate with a finite domain. Dealing with a finite temporal interval has some disadvantages. First, checking the existence of a plan is not possible and second, it also makes difficult to decide whether two programs are strongly equivalent. If we extend the syntax of Answer Set programming by using temporal operators from temporal modal logics, then infinite time can be considered, so the aforementioned disadvantages can be overcome. this extension constitutes, in fact, a formalism called Temporal Equilibrium logic, which is based on Equilibrium logic (a logical characterisation of ASP). Although recent contributions have shown promising results, Temporal Equilibrium logic is still a novel paradigm and there are many gaps to fill. Our goal is to keep developing this paradigm, filling those gaps and turning it into a suitable framework for temporal reasoning. © Martín Diéguez.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

JASP: A framework for integrating answer set programming with Java

JASP: A framework for integrating answer set programming wit...

引用

13th international conference on the Principles of Knowledge Representation and reasoning, KR 2012

作者： Febbraro, Onofrio Grasso, Giovanni Leone, Nicola Ricca, Francesco DLVSystem s.r.l. P.zza Vermicelli Polo Tecnologico Rende Italy Oxford University Department of Computer Science Parks Road Oxford United Kingdom University of Calabria Department of Mathematics Rende Italy

ISBN: (纸本)9781577355601

Answer Set programming (ASP) is a fully-declarative logic programming paradigm, which has been proposed in the area of knowledge representation and non-monotonic reasoning. Nowadays, the formal properties of ASP are well-understood, efficient ASP systems are available, and, recently, ASP has been employed in a few industrial applications. However, ASP technology is not mature for a successful exploitation in industry yet;mainly because ASP technologies are not integrated in the well-assessed development processes and platforms which are tailored for imperative/object-oriented programming languages. In this paper we present a new programming framework blending ASP with Java. the framework is based on JASP, an hybrid language that transparently supports a bilateral interaction between ASP and Java. JASP specifications are compliant with the JPA standard to perfectly fit extensively-adopted enterprise application technologies. the framework also encompasses an implementation of JASP as a plug-in for the Eclipse platform, called JDLV, which includes a compiler from JASP to Java. Moreover, we show a real-world application developed with JASP and JDLV, which highlights the effectiveness of our ASP-Java integration framework. Copyright © 2012, Association for the Advancement of artificial intelligence (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Syntactically characterizing local-to-global consistency in ORD-horn

Syntactically characterizing local-to-global consistency in ...

引用

18th international conference on Principles and Practice of Constraint programming, CP 2012

作者： Wrona, Michal Department of Computer and Information Science Linköpings Universitet Linköping SE-581 83 Sweden

ISBN: (纸本)9783642335570

Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is globally consistent if it is completely explicit, that is, every partial solution may be extended to a full solution by greedily assigning values to variables one at a time. We will say that a structure B has local-to-global consistency if establishing local-consistency yields a globally consistent instance of . this paper studies local-to-global consistency for ORD-Horn languages, that is, structures definable over the ordered rationals (

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Interleaved inductive-abductive reasoning for learning complex event models

Interleaved inductive-abductive reasoning for learning compl...

引用

21st international conference on Inductivelogic programming, ILP 2011

作者： Dubba, Krishna Bhatt, Mehul Dylla, Frank Hogg, David C. Cohn, Anthony G. School of Computing University of Leeds United Kingdom SFB/TR 8 Spatial Cognition University of Bremen Germany

ISBN: (纸本)9783642319501

We propose an interleaved inductive-abductive model for reasoning about complex spatio-temporal narratives. Typed Inductive logic programming (Typed-ILP) is used as a basis for learning the domain theory by generalising from observation data, whereas abductive reasoning is used for noisy data correction by scenario and narrative completion thereby improving the inductive learning to get semantically meaningful event models. We apply the model to an airport domain consisting of video data for 15 turn-arounds from six cameras simultaneously monitoring logistical processes concerned with aircraft arrival, docking, departure etc and a verbs data set with 20 verbs enacted out in around 2500 vignettes. Our evaluation and demonstration focusses on the synergy afforded by the inductive-abductive cycle, whereas our proposed model provides a blue-print for interfacing common-sense reasoning about space, events and dynamic spatio-temporal phenomena with quantitative techniques in activity recognition. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Inductive logic programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

Compliance checking for usage-constrained credentials in trust negotiation systems

Compliance checking for usage-constrained credentials in tru...

引用

15th international conference on Information Security, ISC 2012

作者： Hu, Jinwei Khan, Khaled M. Bai, Yun Zhang, Yan Department of Computer Science TU Darmstadt Germany Department of Computer Science and Engineering Qatar University Qatar School of Computing and Mathematics University of Western Sydney Australia

ISBN: (纸本)9783642333828

We propose an approach to placing usage-constraints on RT credentials;issuers specify constraints by designing non-deterministic finite automata. We show by examples that this approach can express constraints of practical interest. We present a compliance checker in the presence of usage-constraints, especially for trust negotiation systems. Given an RT policy, the checker is able to find all minimal satisfying sets, each of which uses credentials in a way consistent with given constraints. the checker leverages answer set programming, a declarative logic programming paradigm, to model and solve the problem. We also show preliminary experimental results: supporting usage-constraints on credentials incurs affordable overheads and the checker responds efficiently. © 2012 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 65 66 67 68 69 70 71 72 73 74 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：