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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Constraint-Based Program reasoning with Heaps and Separation

Constraint-Based Program Reasoning with Heaps and Separation

引用

19th Annual international conference on Principles and Practice of Constraint programming (CP)

作者： Duck, Gregory J. Jaffar, Joxan Koh, Nicolas C. H. Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore

ISBN: (纸本)9783642406263;9783642406270

this paper introduces a constraint language H for finite partial maps (a.k.a. heaps) that incorporates the notion of separation from Separation logic. We use H to build an extension of Hoare logic for reasoning over heap manipulating programs using (constraint-based) symbolic execution. We present a sound and complete algorithm for solving quantifier-free (QF) H-formulae based on heap element propagation. An implementation of the H-solver has been integrated into a Satisfiability Modulo theories (SMT) framework. We experimentally evaluate the implementation against Verification Conditions (VCs) generated from symbolic execution of large (heap manipulating) programs. In particular, we mitigate the path explosion problem using subsumption via interpolation - made possible by the constraint-based encoding.

关键词： Heap Manipulating Programs Symbolic Execution Separation logic Satisfiability Modulo theories Constraint Handling Rules

来源：评论

学校读者我要写书评

暂无评论

Simulating parity reasoning

Simulating parity reasoning

引用

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

作者： Laitinen, Tero Junttila, Tommi Niemelä, Ilkka Aalto University Department of Information and Computer Science PO Box 15400 FI-00076 Aalto Finland

ISBN: (纸本)9783642452208

Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification, bounded model checking, and logical cryptanalysis, instances can have many parity (xor) constraints which may not be handled efficiently if translated to CNF. thus, extensions to the CNF-driven search with various parity reasoning engines ranging from equivalence reasoning to incremental Gaussian elimination have been proposed. this paper studies how stronger parity reasoning techniques in the DPLL(XOR) framework can be simulated by simpler systems: resolution, unit propagation, and parity explanations. Such simulations are interesting, for example, for developing the next generation SAT solvers capable of handling parity constraints efficiently. © Springer-Verlag 2013.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

the parameterized complexity of constraint satisfaction and reasoning 1

引用

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

作者： Szeider, Stefan Vienna University of Technology ViennaA-1040 Austria

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234

Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. the framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and reasoning. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Revisiting the equivalence of shininess and politeness

Revisiting the equivalence of shininess and politeness

引用

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

作者： Casal, Filipe Rasga, João SQIG Instituto de Telecomunicações Lisboa Portugal Dep. Matemática Instituto Superior Técnico Universidade de Lisboa Portugal

ISBN: (纸本)9783642452208

the Nelson-Oppen method [4] allows the combination of satisfiability procedures of stably infinite theories with disjoint signatures. Due to its importance, several attempts to extend the method to different and wider classes of theories were made. In 2005, it was shown that shiny [9] and polite [6] theories could be combined with an arbitrary theory (the relationship between these classes was analysed in [6]). Later, a stronger notion of polite theory was proposed, see [3], in order to overcome a subtle issue with a proof in [6]. In this paper, we analyse the relationship between shiny and strongly polite theories in the onesorted case. We show that a shiny theory with a decidable quantifier-free satisfiability problem is strongly polite and provide two different sufficient conditions for a strongly polite theory to be shiny. Based on these results, we derive a combination method for the union of a polite theory with an arbitrary theory. © Springer-Verlag 2013.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Incremental tabling for query-driven propagation of logic program updates

Incremental tabling for query-driven propagation of logic pr...

引用

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

作者： Saptawijaya, Ari Pereira, Luís Moniz Departamento de Informática Univ. Nova de Lisboa 2829-516 Caparica Portugal Fakultas Ilmu Komputer Universitas Indonesia Depok Indonesia

ISBN: (纸本)9783642452208

We foster a novel implementation technique for logic program updates, which exploits incremental tabling in logic programming - using XSB Prolog to that effect. Propagation of updates of fluents is controlled by initially keeping any fluent updates pending in the database. And, on the initiative of queries, making active just those updates up to the timestamp of an actual query, by performing incremental assertions of the pending ones. these assertions, in turn, automatically trigger system-implemented incremental bottom-up tabling of other fluents (or their negated complements), with respect to a predefined overall upper time limit, in order to avoid runaway iteration. the frame problem can then be dealt with by inspecting a table for the latest time a fluent is known to be assuredly true, i.e., the latest time it is not supervened by its negated complement, relative to the given query time. To do so, we adopt the dual program transformation for defining and helping propagate, also incrementally and bottom-up, the negated complement of a fluent, in order to establish whether a fluent is still true at some time point, or rather if its complement is. the use of incremental tabling in this approach affords us a form of controlled, but automatic, system level truth-maintenance, up to some actual query time. Consequently, propagation of update side-effects need not employ top-down recursion or bottom-up iteration through a logically defined frame axiom, but can be dealt with by the mechanics of the underlying world. Our approach thus reconciles high-level top-down deliberative reasoning about a query, with autonomous low-level bottom-up world reactivity to ongoing updates, and it might be adopted elsewhere for reasoning in logic. © Springer-Verlag 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Polar: A framework for proof refactoring

Polar: A framework for proof refactoring

引用

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

作者： Dietrich, Dominik Whiteside, Iain Aspinall, David Cyber-Physical Systems DFKI Bremen Germany School of Computing Science Newcastle University United Kingdom School of Informatics University of Edinburgh United Kingdom

ISBN: (纸本)9783642452208

We present a prototype refactoring framework based on graph rewriting and bidirectional transformations that is designed to be generic, extensible, and declarative. Our approach uses a language-independent graph meta-model to represent proof developments in a generic way. We use graph rewriting to enrich the meta-model with dependency information and to perform refactorings, which are written as declarative rewrite rules. Our framework, called POLAR, is implemented in the GRGEN rewriting engine. © Springer-Verlag 2013.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

An integrated environment for reasoning over ontologies via logic programming

An integrated environment for reasoning over ontologies via ...

引用

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

作者： Nardi, Barbara Reale, Kristian Ricca, Francesco Terracina, Giorgio Department of Mathematics University of Calabria Italy

ISBN: (纸本)9783642396656

Ontology-based reasoning is considered a crucial task in the area of knowledge management. In this context, the interest in approaches that resort to Datalog (and its extensions) for implementing various reasoning tasks over ontologies is growing. Nonetheless, looking from the developer point of view, one can notice that the editing environments for ontologies on the one hand and Datalog-like logic programs on the other hand are often developed independently and miss a common perspective. In this paper we face with this issue proposing the integration of two major development environments for Datalog programs and Ontologies, respectively: ASPIDE and protégé. We extended both systems with specific plugins that enable a synergic interaction between the two development environments. the developer can then handle both ontologies and logic-based reasoning over them by exploiting specific tools integrated to work together. © 2013 Springer-Verlag.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Confidentiality-preserving publishing of EDPs for credulous and skeptical users 1

引用

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

作者： Inoue, Katsumi Sakama, Chiaki Wiese, Lena National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-kuTokyo101-8430 Japan Department of Computer and Communication Sciences Wakayama University 930 Sakaedani Wakayama640-8510 Japan Institute of Computer Science Georg-August-Universität Göttingen Goldschmidtstr. 7 Göttingen37077 Germany

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234

Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study the problem of confidentiality-preservation when publishing extended disjunctive logic programs and show how it can be solved by extended abduction. In particular, we analyze how the differences between users who employ either credulous or skeptical non-monotonic reasoning affect confidentiality. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Partial backtracking in CDCL solvers

Partial backtracking in CDCL solvers

引用

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

作者： Jiang, Chuan Zhang, Ting Iowa State University Ames IA 50011 United States

ISBN: (纸本)9783642452208

Backtracking is a basic technique of search-based satisfiability (SAT) solvers. In order to backtrack, a SAT solver uses conflict analysis to compute a backtracking level and discards all the variable assignments made between the conflicting level and the backtracking level. We observed that, due to the branching heuristics, the solver may repeat lots of previous decisions and propagations later. In this paper, we present a new backtracking strategy, which we refer to as partial backtracking. We implemented this strategy in our solver Nigma. Using this strategy, Nigma amends the variable assignments instead of discarding them completely so that it does not backtrack as many levels as the classic strategy. Our experiments show that Nigma solves 5% more instances than the version without partial backtracking. © Springer-Verlag 2013.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Cplus 2ASP: Computing action language C+ in answer set programming

Cplus 2ASP: Computing action language C+ in answer set progr...

引用

12th international conference on logic programming and Nonmonotonic reasoning, LPNMR 2013

作者： Babb, Joseph Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ United States

ISBN: (纸本)9783642405631

We present Version 2 of system Cplus2ASP, which implements the definite fragment of action language C+. Its input language is fully compatible with the language of the Causal Calculator Version 2, but the new system is significantly faster thanks to modern answer set solving techniques. the translation implemented in the system is a composition of several recent theoretical results. the system orchestrates a tool chain, consisting of f2lp, clingo, iclingo, and as2transition. Under the incremental execution mode, the system translates a C+ description into the input language of iclingo, exploiting its incremental grounding mechanism. the correctness of this execution is justified by the module theorem extended to programs with nested expressions. In addition, the input language of the system has many useful features, such as external atoms by means of Lua calls and the user interactive mode. the system supports extensible multi-modal translations for other action languages, such as B and BC, as well. © 2013 Springer-Verlag.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：