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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Towards epistemic planning agents

Towards epistemic planning agents

引用

5th international conference on Agents and artificial intelligence, ICAART 2013

作者： Eppe, Manfred Dylla, Frank Department of Computer Science and Mathematics University of Bremen Bremen Germany Cognitive Systems SFB/TR8 Spatial Cognition University of Bremen Bremen Germany

ISBN: (纸本)9789898565389

We propose an approach for single-agent epistemic planning in domains with incomplete knowledge. We argue that on the one hand the integration of epistemic reasoning into planning is useful because it makes the use of sensors more flexible. On the other hand, defining an epistemic problem description is an error prone task as the epistemic effects of actions are more complex than their usual physical effects. We apply the axioms of the Discrete Event Calculus Knowledge theory (DECKT) as rules to compile simple non-epistemic planning problem descriptions into complex epistemic descriptions. We show how the resulting planning problems are solved by our implemented prototype which is based on Answer Set programming (ASP).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Query answering in object oriented knowledge bases in logic programming: Description and challenge for ASP 6

Query answering in object oriented knowledge bases in logic ...

引用

6th Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th international conference on logic programming, ICLP 2013

作者： Chaudhri, Vinay K. Heymans, Stijn Wessel, Michael Son, Tran Cao Artificial Intelligence Center SRI International Menlo ParkCA94025 United States Computer Science Department New Mexico State University NM88003 United States

Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with. KB Bio 101 contains knowledge from a biology textbook, has been developed as part of Project Halo, and has recently become available for research use. KB Bio 101 is one of the largest KBs available in ASP and the reasoning with it is undecidable in general. We give a description of this KB and ASP programs for a suite of queries that have been of practical interest. We explain why these queries pose significant practical challenges for the current ASP solvers. © 2013 ***. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

19th International Conference on Applications of Declarative...

引用

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

ISBN: (纸本)9783642415234

the proceedings contain 21 papers. the special focus in this conference is on Invited Talks, Languages, Answer-Set programming and Abductive reasoning, Semantics, Constraints and logic programming, Answer-Set programming and Model Expansion and WLP System Descriptions. the topics include: the IMPL policy language for managing inconsistency in multi-context systems;the parameterized complexity of constraint satisfaction and reasoning;translating nondeterministic functional language based on attribute grammars into java;sensitivity analysis for declarative relational query languages with ordinal ranks;a uniform fixpoint approach to the implementation of inference methods for deductive databases;translating answer-set programs into bit-vector logic;making use of advances in answer-set programming for abstract argumentation systems;confidentiality-preserving publishing of EDPs for credulous and skeptical users;every formula-based logic program has a least infinite-valued model;descriptive approach to preferred answer sets;solving modular model expansion: case studies;a constraint-based interactive product configurator;HEX-programs with nested program calls;a prototype of a knowledge-based programming environment;an IDE for answer-set programming-preliminary report;a system for visualising and visual editing of interpretations for answer-set programsa and unit testing in ASPIDE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prediction and explanation over DL-Lite data streams

Prediction and explanation over DL-Lite data streams

引用

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

作者： Klarman, Szymon Meyer, thomas Centre for Artificial Intelligence Research CSIR Meraka University of KwaZulu-Natal South Africa

ISBN: (纸本)9783642452208

Stream reasoning is an emerging research area focusing on the development of reasoning techniques applicable to streams of rapidly changing, semantically enhanced data. In this paper, we consider data represented in Description logics from the popular DL- Lite family, and study the logic foundations of prediction and explanation over DL-Lite data streams, i.e., reasoning from finite segments of streaming data to conjectures about the content of the streams in the future or in the past. We propose a novel formalization of the problem based on temporal "past-future" rules, grounded in Temporal Query Language. Such rules can naturally accommodate complex data association patterns, which are typically discovered through data mining processes, with logical and temporal constraints of varying expressiveness. Further, we analyse the computational complexity of reasoning with rules expressed in different fragments of the temporal language. As a result, we draw precise demarcation lines between NP-, DP- and PSPACE-complete variants of our setting and, consequently, suggest relevant restrictions rendering prediction and explanation more feasible in practice. © Springer-Verlag 2013.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

the Fourth Answer Set programming Competition: Preliminary Report

The Fourth Answer Set Programming Competition: Preliminary R...

引用

12th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Alviano, Mario Calimeri, Francesco Charwat, Guenther Dao-Tran, Minh Dodaro, Carmine Ianni, Giovambattista Krennwallner, thomas Kronegger, Martin Oetsch, Johannes Pfandler, Andreas Puehrer, Joerg Redl, Christoph Ricca, Francesco Schneider, Patrik Schwengerer, Martin Spendier, Lara Katharina Wallner, Johannes Peter Xiao, Guohui Univ Calabria Dipartimento Matemat & Informat I-87030 Commenda Di Rende Italy Vienna Technol Univ Inst Informat Syst Vienna Austria Vienna Technol Univ Inst Comp Languages Vienna Austria

ISBN: (纸本)9783642405648

Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. the fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. the Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm;and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Rule revision in normal DL logic programs

Rule revision in normal DL logic programs

引用

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

作者： Binnewies, Sebastian Wang, Yisong Stantic, Bela Wang, Kewen School of Information and Communication Technology Griffith University QLD Australia

ISBN: (纸本)9783642396656

Although several proposals to combine description logics with logic programming rules have been brought forward, hardly any of these approaches capture the dynamic nature of the Semantic Web. In this paper, we look at an expressive combination formalism, normal DL logic programs, and address changes to the rule component from the viewpoint of belief revision. To deal with inconsistency caused in revising normal DL logic programs, we first introduce a three-valued answer set semantics and present some useful properties. We then develop a revision operator for normal DL logic programs and show that our revision satisfies major postulates for logic program revision. © 2013 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Answer set programming: Language, applications and development tools

Answer set programming: Language, applications and developme...

引用

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

作者： Grasso, Giovanni Leone, Nicola Ricca, Francesco Oxford University Department of Computer Science Oxford United Kingdom Dipartimento di Matematica e Informatica Università Della Calabria 87030 Rende Italy

ISBN: (纸本)9783642396656

Answer Set programming (ASP) is a powerful language for knowledge representation and reasoning, that has been developed in the field of nonmonotonic reasoning and logic programming. the high knowledge-modeling power of ASP, together with the availability of efficient ASP systems, have implied a renewed interest in this formalism in recent years. ASP has been applied in many scientific applications, ranging from artificial intelligence, to Knowledge Management and Information Integration. the big challenge now is to show that ASP can be profitably used for real-world applications, and can attract much interest also in industry. In this paper, we report on our on-the-field experience on the development of real-world applications in ASP. We have employed the DLV system, the first ASP system which is undergoing an industrial exploitation by a spin-off company, and is very well-suited for applications development, thanks also to the endowment of powerful development tools, supporting the activities of researchers and implementors. In particular, we describe a couple of real-world ASP applications for work-force management and e-tourism, and we focus on two advanced development tools for DLV: ASPIDE and JDLV. ASPIDE is an extensible integrated development environment for ASP;while JDLV is a plug-in for Eclipse, integrating ASP in a well-assessed development platform which enables a bilateral interaction between ASP and Java. © 2013 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

HOL based first-order modal logic provers

HOL based first-order modal logic provers

引用

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

作者： Benzmüller, Christoph Raths, thomas Dep. of Mathematics and Computer Science Freie Universitaẗ Berlin Germany Institute for Computer Science University of Potsdam Germany

ISBN: (纸本)9783642452208

First-order modal logics (FMLs) can be modeled as natural fragments of classical higher-order logic (HOL). the FMLtoHOL tool exploits this fact and it enables the application of off-the-shelf HOL provers and model finders for reasoning within FMLs. the tool bridges between the qmf-syntax for FML and the TPTP thf0-syntax for HOL. It currently supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics. the approach is evaluated in combination with a meta-prover for HOL, which sequentially schedules various HOL reasoners. the resulting system is very competitive. © Springer-Verlag 2013.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Dynamic logic with trace semantics

Dynamic logic with trace semantics

引用

24th international conference on Automated Deduction, CADE 2013

作者： Beckert, Bernhard Bruns, Daniel Germany

ISBN: (纸本)9783642385735

Dynamic logic is an established instrument for program verification and for reasoning about the semantics of programs and programming languages. In this paper, we define an extension of dynamic logic, called Dynamic Trace logic (DTL), which combines the expressiveness of program logics such as dynamic logic with that of temporal logic. And we present a sound and relatively complete sequent calculus for proving validity of DTL formulae. Due to its expressiveness, DTL can serve as a basis for proving functional and information-flow properties in concurrent programs, among other applications. © 2013 Springer-Verlag.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set programming

Extending the Metabolic Network of <i>Ectocarpus Siliculosus...

引用

12th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Collet, Guillaume Eveillard, Damien Gebser, Martin Prigent, Sylvain Schaub, Torsten Siegel, Anne thiele, Sven CNRS UMR IRISA 6074 Campus Beaulieu F-35042 Rennes France Univ Nantes UMR 6241 LINA E-44300 Nantes France Univ Potsdam Inst Informat D-14482 Potsdam Germany INRIA Ctr Rennes Bretagne Atlantique E-35042 Rennes France INRIA CIRIC Santiago Chile

ISBN: (纸本)9783642405648

Metabolic network reconstruction is of great biological relevance because it offers a way to investigate the metabolic behavior of organisms. However, reconstruction remains a difficult task at both the biological and computational level. Building on previous work establishing an ASP-based approach to this problem, we present a report from the field resulting in the discovery of new biological knowledge. In fact, for the first time ever, we automatically reconstructed a metabolic network for a macroalgae. We accomplished this by taking advantage of ASP's combined optimization and enumeration capacities. Both computational tasks build on an improved ASP problem representation, incorporating the concept of reversible reactions. Interestingly, optimization greatly benefits from the usage of unsatisfiable cores available in the ASP solver unclasp. Applied to Ectocarpus siliculosus, only the combination of unclasp and clasp allowed us to obtain a metabolic network able to produce all recoverable metabolites among the experimentally measured ones. Moreover, 70% of the identified reactions are supported by an homologous enzyme in Ectocarpus siliculosus, confirming the quality of the reconstructed network from a biological viewpoint.

关键词： Metabolism

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：