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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是641-650 订阅

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

详细简洁

排序：

Unit testing in ASPIDE 19th

Unit testing in ASPIDE

引用

19th international conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th Workshop on logic programming, WLP 2011

作者： Febbraro, Onofrio Leone, Nicola Reale, Kristian Ricca, Francesco DLVSystem s.r.l. - P.zza Vermicelli Polo Tecnologico Rende87036 Italy Dipartimento di Matematica Università della Calabria Rende87036 Italy

ISBN: (纸本)9783642415234

Answer Set programming (ASP) is a declarative logic programming formalism, which is employed nowadays in both academic and industrial real-world applications. Although some tools for supporting the development of ASP programs have been proposed in the last few years, the crucial task of testing ASP programs received less attention and it is an Achilles’ heel of the available programming environments. In this paper we present a language for specifying and running unit tests on ASP programs. the testing language was implemented in ASPIDE, a comprehensive IDE for ASP, which supports the entire life cycle of ASP development with a collection of user-friendly graphical tools for program composition, testing, debugging, profiling, solver execution configuration, and output handling. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Finding theorems in NBG set theory by automated forward deduction based on strong relevant logic

Finding theorems in NBG set theory by automated forward dedu...

引用

19th international Computing and Combinatorics conference, COCOON 2013

作者： Gao, Hongbiao Shi, Kai Goto, Yuichi Cheng, Jingde Department of Information and Computer Sciences Saitama University Saitama 338-8570 Japan

ISBN: (纸本)9783642387678

Automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. For the problem, Cheng has proposed a forward deduction approach based on strong relevant logic. To verify the effectiveness of the approach, we tried to rediscover already known theorems in NBG set theory by using the approach, and succeeded in rediscovery of several known theorems. However, the method of the rediscovery is ad hoc, but not systematic. this paper gives an analysis and discussion for our experiment method and results from the viewpoint of the systematic method. the paper also presents some issues and future research directions for a systematic method of automated theorem finding based on Cheng's approach. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

An algorithm for enumerating maximal models of horn theories with an application to modal logics

An algorithm for enumerating maximal models of horn theories...

引用

19th international conference on logic for programming, artificial intelligence, and reasoning, LPAR 2013

作者： Aceto, Luca Della Monica, Dario Ingólfsdóttir, Anna Montanari, Angelo Sciavicco, Guido ICE-TCS School of Computer Science Reykjavik University Reykjavik Iceland Department of Mathematics and Computer Science University of Udine Udine Italy Department of Information Engineering and Communications University of Murcia Murcia Spain

ISBN: (纸本)9783642452208

the fragment of propositional logic known as Horn theories plays a central role in automated reasoning. the problem of enumerating the maximal models of a Horn theory (MAXMOD) has been proved to be computationally hard, unless P = NP. To the best of our knowledge, the only algorithm available for it is the one based on a brute-force approach. In this paper, we provide an algorithm for the problem of enumerating the maximal subsets of facts that do not entail a distinguished atomic proposition in a definite Horn theory (MAXNOENTAIL). We show that MAXMOD is polynomially reducible to MAXNOENTAIL (and vice versa), making it possible to solve also the former problem using the proposed algorithm. Addressing MAXMOD via MAXNOENTAIL opens, inter alia, the possibility of benefiting from the monotonicity of the notion of entailment. (the notion of model does not enjoy such a property.) We also discuss an application of MAXNOENTAIL to expressiveness issues for modal logics, which reveals the effectiveness of the proposed algorithm. © Springer-Verlag 2013.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in artificial intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in artificial intelligence and Lecture Notes in Bioinformatics) 2013年 8312 LNCS卷 VI页

作者： Mcmillan, Ken Middeldorp, Aart Voronkov, Andrei Microsoft Research Redmond WA United States University of Innsbruck Austria University of Manchester United Kingdom

来源：评论

学校读者我要写书评

暂无评论

three lessons in creating a knowledge base to enable reasoning, explanation and dialog 1

Three lessons in creating a knowledge base to enable reasoni...

引用

1st Workshop on Natural Language Processing and Automated reasoning, NLPAR 2013 - Co-located with 12th international conference on logic programming and Nonmonotonic reasoning, LPNMR 2013

作者： Chaudhri, Vinay K. Dinesh, Nikhil Inclezan, Daniela Artificial Intelligence Center SRI International Menlo ParkCA94025 United States

Our work is driven by the hypothesis that for a program to answer questions, explain the answers, and engage in a dialog just like a human does, it must have an explicit representation of knowledge. Such explicit representations occur naturally in many situations such as engineering designs created by engineers, a software requirement created in unified modeling language or a process flow diagram for a manufacturing process. Automated approaches based on natural language processing have progressed on tasks such as named entity recognition, fact extraction and relation learning. Use of automated methods can be problematic in situations where the conceptual distinctions used by humans for reasoning are not directly expressed in natural language or when the representation must be used to drive a high fidelity simulation. In this paper, we report on our effort to systematically curate a knowledge base for substantial fraction of text in a biology textbook [26]. While this experience and the process is interesting on its own, three aspects can be especially instructive for future development of knowledge bases by both manual and automatic methods: (1) Consider imposing a simplifying abstract structure on natural language sentences so that the surface form is closer to the target logical form to be extracted. (2) Adopt an upper ontology that is strongly motivated and influenced by natural language. (3) Develop a set of guidelines that captures how the conceptual distinctions in the ontology may be realized in natural language. Since the representation created by this process has been quite effective for answering questions and producing explanations, it gives a concrete target for what information should be extracted by the automated methods.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An ontology-based reasoning approach for electric power utilities

An ontology-based reasoning approach for electric power util...

引用

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

作者： Gaha, Mohamed Zinflou, Arnaud Langheit, Christian Bouffard, Alexandre Viau, Mathieu Vouligny, Luc Expertise Systèmes de Mesure et d'Information Institut de Recherche d'Hydro-Québec-IREQ 1800 Lionel-Boulet Varennes QC J3X 1S1 Canada

ISBN: (纸本)9783642396656

Because of the semantic conflicts, the exchange of information between heterogeneous applications remains a complex task. One way to address this problem is to use ontologies for the identification and association of semantically corresponding information concepts. In the electric power industry, the IEC/CIM represents the most complete and widely accepted ontology. We attempt to show through three concrete examples how the CIM can reap advantages from a formal representation of knowledge in order to support complex processes. We present a semantic approach for finding ringlets in the distribution network, for checking specific data inconsistencies and finally for identifying CIM topological nodes. We conclude by stating that the combination of CIM and RDF has the main advantage of offering valuable flexibility in processing complex tasks. © 2013 Springer-Verlag.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

HornDL: An expressive horn description logic with PTime data complexity

HornDL: An expressive horn description logic with PTime data...

引用

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

作者： Nguyen, Linh Anh Nguyen, thi-Bich-Loc Szalas, Andrzej Institute of Informatics University of Warsaw Banacha 2 02-097 Warsaw Poland Faculty of Information Technology VNU University of Engineering and Technology 144 Xuan Thuy Hanoi Viet Nam Department of Information Technology Hue University of Sciences 77 Nguyen Hue Hue City Viet Nam Dept. of Computer and Information Science Linköping University SE-581 83 Linköping Sweden

ISBN: (纸本)9783642396656

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-scriptSscriptRscriptOscriptIscriptQ, while still has PTime data complexity. In comparison with Horn- scriptSscriptRscriptOscriptIscriptQ, Horn-DL additionally allows the universal role and assertions of the form irreflexive (s), ¬s(a, b), a ≠ b. More importantly, in contrast to all the well-known Horn fragments scriptEscriptL, DL-Lite, DLP, Horn-scriptSscripthscriptIscriptQ, Horn- scriptSscriptRscriptOscriptIscriptQ of description logics, Horn-DL allows a form of the concept constructor "universal restriction" to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. In the long version of this paper, we present the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases. © 2013 Springer-Verlag.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Eliminating nonmonotonic DL-atoms in description logic programs

Eliminating nonmonotonic DL-atoms in description logic progr...

引用

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

作者： Wang, Yisong Eiter, thomas You, Jia-Huai Yuan, Liyan Shen, Yi-Dong Department of Computer Science Guizhou University Guiyang China Institute of Information Systems Vienna University of Technology Austria Department of Computing Science University of Alberta Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)9783642396656

Nonmonotonic description logic programs (dl-programs) are a well-known formalism for combining rules and ontologies, where rules interact with an underlying ontology via dl-atoms that allow queries to the ontology under a possible update of its assertional part. It is known that dl-atoms may be nonmonotonic and dl-programs without nonmonotonic dl-atoms have many desirable properties. In this paper, we show that it is possible to remove nonmonotonic dl-atoms from a dl-program while preserving its strong/weak answer set semantics. though the translation is faithful, it relies on the knowledge about monotonicity of dl-atoms. We then thoroughly investigate the complexity of deciding whether a dl-atom is monotonic under the description logics DL-Litescript R, scriptEscriptL++, scriptSscripthscriptIscriptF and scriptSscripthscriptOscriptIscriptN, which is of independent interest for computing strong answer sets. We show that the problem is intractable in general, but tractable for dl-atoms with bounded queries in DL-Litescript R. © 2013 Springer-Verlag.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Applications of Declarative programming and Knowledge Management: 19th international conference, INAP 2011, and 25th Workshop on logic programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers 1

引用

丛书名： Lecture Notes in Computer Science 7773 Lecture Notes in artificial intelligence

2013年

作者： thomas Eiter, Michael Fink, Giovambattista Ianni, Peter Schüller (auth.), Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf (eds.)

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234;9783642415241

this book constitutes revised selected papers of the 19th international conference on Applications of Declarative programming and Knowledge Management, INAP 2011, and the 25th Workshop on logic programming, WLP 2011, held in Vienna, Austria, in September 2011. the 19 papers presented in this volume were carefully reviewed and selected from 27 papers presented at the conference and initially a total of 35 submissions. the book also contains the papers of two invited talks. the papers are organized in topical sections on languages; answer-set programming and abductive reasoning; constraints and logic programming; answer-set programming and model expansion; application papers; and system descriptions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DNA Computing and Molecular programming - 19th international conference, DNA 2013, Proceedings

引用

19th international conference on DNA Computing and Molecular programming, DNA 2013

ISBN: (纸本)9783319019277

the proceedings contain 15 papers. the topics discussed include: extending DNA-sticker arithmetic to arbitrary size using staples;parallel computation using active self-assembly;DNA walker circuits: computational potential, design, and verification;leaderless deterministic chemical reaction networks;DNA sticky end design and assignment for robust algorithmic self-assembly;DNA reservoir computing: a novel molecular computing approach;signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles;3-color bounded patterned self-assembly;exponential replication of patterns in the signal tile assembly model;modular verification of DNA strand displacement networks via serializability analysis;iterative self-assembly with dynamic strength transformation and temperature control;probabilistic reasoning with an enzyme-driven DNA device;staged self-assembly and polyomino context-free grammars;and functional analysis of large-scale DNA strand displacement circuits.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：