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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

45 篇 会议
3 册 图书
1 篇 期刊文献

馆藏范围

49 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

41 篇 工学
- 41 篇 计算机科学与技术...
- 36 篇 软件工程
- 3 篇 信息与通信工程
- 2 篇 电气工程
- 2 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 食品科学与工程（可...
13 篇 理学
- 10 篇 数学
- 2 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 农学
- 1 篇 作物学

主题

17 篇 logic programmin...
3 篇 semantics
2 篇 software enginee...
2 篇 mathematical log...
2 篇 discrete mathema...
2 篇 programming tech...
2 篇 artificial intel...
2 篇 logics and meani...
1 篇 graded modality
1 篇 belief revision
1 篇 compaction
1 篇 computation theo...
1 篇 disjunctive logi...
1 篇 program analysis
1 篇 debugging
1 篇 algorithms
1 篇 logic programing
1 篇 answer-set progr...
1 篇 knowledge repres...
1 篇 characterization...

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 aalto university...
2 篇 alpen-adria-univ...
2 篇 siemens ag öster...
2 篇 university of ca...
1 篇 dipartimento di ...
1 篇 dipartimento di ...
1 篇 polcoming univ. ...
1 篇 vienna universit...
1 篇 lamsade cnrs and...
1 篇 university of te...
1 篇 transdisciplinar...
1 篇 siemens ag munic...
1 篇 universidad poli...
1 篇 computational lo...
1 篇 nii tokyo
1 篇 university of ca...
1 篇 department of ap...
1 篇 school of comput...

作者

6 篇 gebser martin
5 篇 schaub torsten
3 篇 eiter thomas
3 篇 ricca francesco
2 篇 schenner gottfri...
2 篇 janhunen tomi
2 篇 maratea marco
2 篇 walęga przemysla...
2 篇 inoue katsumi
2 篇 zhang zhizheng
2 篇 cabalar pedro
2 篇 tompits hans
2 篇 ryabokon anna
1 篇 francesco calime...
1 篇 kaminski roland
1 篇 soh takehide
1 篇 dung phan minh
1 篇 kutz oliver
1 篇 schneider patrik
1 篇 mitchell david

语言

48 篇 英文
1 篇 其他

检索条件"任意字段=13th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2015"

共 49 条记录，以下是21-30 订阅

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

详细简洁

排序：

logic programming with graded modality 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Zhang, Zhizheng Zhang, Shutao School of Computer Science and Engineering Southeast University Nanjing China

ISBN: (纸本)9783319232638

logic programs with graded modality (LPGMs) combine ideas underlying graded modal logic and answer set programming. logic programming under answer set semantics is extended with a new graded modality M[lb:ub] where lb and ub are natural numbers satisfying lb ≤ ub. the modality is used to precede a literal in rules bodies, and thus allows for the representation of graded introspections: M[lb:ub]F intuitively means: it is known that the number of belief sets where F is true is between lb and ub. We define the semantics of logic programs with graded modality, give an algorithm for computing solutions of LPGMs, and show the effectiveness of the formalism for modeling two problems. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Implementing Preferences with asprin 1

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Brewka, Gerhard Delgrande, James Romero, Javier Schaub, Torsten INRIA Rennes Rennes France Simon Fraser University Burnaby Canada Universität Leipzig Leipzig Germany Universität Potsdam Potsdam Germany IIIS Griffith University Brisbane Australia

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

asprin offers a framework for expressing and evaluating combinations of quantitative and qualitative preferences among the stable models of a logic program. In this paper, we demonstrate the generality and flexibility of the methodology by showing how easily existing preference relations can be implemented in asprin. Moreover, we show how the computation of optimal stable models can be improved by using declarative heuristics. We empirically evaluate our contributions and contrast them with dedicated implementations. Finally, we detail key aspects of asprin’s implementation. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ASP solving for expanding universes 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Gebser, Martin Janhunen, Tomi Jost, Holger Kaminski, Roland Schaub, Torsten Aalto University HIIT Espoo Finland INRIA Rennes Rennes France University of Potsdam Potsdam Germany

ISBN: (纸本)9783319232638

Over the last years, Answer Set programming has significantly extended its range of applicability, and moved beyond solving static problems to dynamic ones, even in online environments. However, its nonmonotonic nature as well as its upstream instantiation process impede a seamless integration of new objects into its reasoning process, which is crucial in dynamic domains such as logistics or robotics. We address this problem and introduce a simple approach to successively incorporating new information into ASP systems. Our approach rests upon a translation of logic programs and thus refrains from any dedicated algorithms. We prove its modularity as regards the addition of new information and show its soundness and completeness. We apply our methodology to two domains of the Fifth ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Shift design with answer set programming 1

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Abseher, Michael Gebser, Martin Musliu, Nysret Schaub, Torsten Woltran, Stefan TU Wien Vienna Austria Aalto University HIIT Espoo Finland University of Potsdam Potsdam Germany INRIA Rennes Rennes France

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Answer Set programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ASP, Amalgamation, and the conceptual blending workflow 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Eppe, Manfred Maclean, Ewen Confalonieri, Roberto Kutz, Oliver Schorlemmer, Marco Plaza, Enric IIIA-CSIC Barcelona Spain University of Edinburgh Edinburgh United Kingdom Free University of Bozen-Bolzano Bolzano Italy International Computer Science Institute Berkeley United States

ISBN: (纸本)9783319232638

We present a framework for conceptual blending – a concept invention method that is advocated in cognitive science as a fundamental, and uniquely human engine for creative thinking. Herein, we employ the search capabilities of ASP to find commonalities among input concepts as part of the blending process, and we show how our approach fits within a generalised conceptual blending workflow. Specifically, we orchestrate ASP with imperative Python programming, to query external tools for theorem proving and colimit computation. We exemplify our approach with an example of creativity in mathematics. © Springer international Publishing Switzerland 2015.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

Multi-level algorithm selection for ASP 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Maratea, Marco Pulina, Luca Ricca, Francesco DIBRIS Univ. degli Studi di Genova Viale F. Causa 15 Genova16145 Italy POLCOMING Univ. degli Studi di Sassari Viale Mancini 5 Sassari07100 Italy Dip. di Matematica ed Informatica Univ. della Calabria Via P. Bucci Rende87030 Italy

ISBN: (纸本)9783319232638

Automated algorithm selection techniques have been applied successfully to Answer Set programming (ASP) solvers. ASP computation includes two levels of computation: variable substitution, called grounding, and propositional answer set search, called solving. In this paper we present me-aspML, an extended ASP system applying algorithm selection techniques to both levels of computation in order to choose the most promising solving strategy. Experiments conducted on benchmarks and solvers of the Fifth ASP Competition shows that me-aspML is able to solve more instances than state-of-the-art systems. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Solving disjunctive fuzzy answer set programs 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Mushthofa, Mushthofa Schockaert, Steven De Cock, Martine Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science Bogor Agricultural University Bogor Indonesia Center for Data Science University of Washington Tacoma Tacoma United States

ISBN: (纸本)9783319232638

Fuzzy Answer Set programming (FASP) is an extension of the popular Answer Set programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method. © Springer international Publishing Switzerland 2015.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Answer set programming modulo acyclicity 1

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Bomanson, Jori Gebser, Martin Janhunen, Tomi Kaufmann, Benjamin Schaub, Torsten Aalto University HIIT Espoo Finland University of Potsdam Potsdam Germany INRIA Rennes Rennes France

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. the resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. the implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation. © Springer international Publishing Switzerland 2015.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Relational and semantic data mining: — Invited Talk — 13th

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Lavrač, Nada Vavpetič, Anže Jožef Stefan Institute Jamova 39 Ljubljana1000 Slovenia Jožef Stefan International Postgraduate School Jamova 39 Ljubljana1000 Slovenia University of Nova Gorica Nova Gorica Slovenia

ISBN: (纸本)9783319232638

Inductive logic programming (ILP) and Relational Data Mining (RDM) address the task of inducing models or patterns from multi-relational data. One of the established approaches to RDM is propositionalization, characterized by transforming a relational database into a single-table representation. After introducing ILP and RDM, the paper provides an overview of propositionalization algorithms, which have been made publicly available through the web-based Clowd- Flows data mining platform. the paper concludes by presenting recent advances in Semantic Data Mining, characterized by exploiting relational background knowledge in the form of domain ontologies in the process of model and pattern construction. © Springer international Publishing Switzerland 2015.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Enablers and inhibitors in causal justifications of logic programs 1

引用

13th international conference on logic programming and nonmonotonic reasoning, lpnmr 2015

作者： Cabalar, Pedro Fandinno, Jorge Department of Computer Science University of Corunna A Corunna Spain

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated a justification represented as an algebraic expression. this expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively call enablers and inhibitors, are intimately related to default negation and have an essentially different nature from regular cause-effect relations. the most important result is a formal comparison to the recent algebraic approaches for justifications in LP: Why-not Provenance (WnP) and Causal Graphs (CG). We show that the current approach extends both WnP and CG justifications under theWell-Founded Semantics and, as a byproduct, we also establish a formal relation between these two approaches. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：