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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

8 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

6 篇 工学
- 6 篇 计算机科学与技术...
- 6 篇 软件工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 农业工程
1 篇 理学
- 1 篇 物理学
1 篇 农学
- 1 篇 作物学

主题

2 篇 logic programmin...
1 篇 problem solving
1 篇 robot programmin...
1 篇 atoms
1 篇 forestry

机构

2 篇 tu wien austria
2 篇 university of po...
2 篇 inria rennes
1 篇 drexel universit...
1 篇 new mexico state...
1 篇 johannes kepler ...
1 篇 aalto university
1 篇 ku leuvan
1 篇 ut austin united...

作者

2 篇 fichte johannes ...
1 篇 kaminski r.
1 篇 bogaerts bart
1 篇 ostrowski m.
1 篇 wanko p.
1 篇 schaub torsten
1 篇 woltran stefan
1 篇 balduccini marce...
1 篇 harrison amelia
1 篇 faber wolfgang
1 篇 schellhorn s.
1 篇 son tran cao
1 篇 alviano mario
1 篇 janhunen t.
1 篇 schaub t.
1 篇 israney ankush
1 篇 young ryan
1 篇 kronegger martin
1 篇 romero javier
1 篇 szeider stefan

语言

9 篇 英文

检索条件"任意字段=10th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2017"

共 9 条记录，以下是1-10 订阅

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

详细简洁

排序：

Preface to the proceedings of the 10th annual workshop on answer set programming and other computing paradigms

引用

CEUR workshop Proceedings 2017年 1868卷

作者： Bogaerts, Bart Harrison, Amelia KU Leuvan Belgium UT Austin United States

来源：评论

学校读者我要写书评

暂无评论

workshop on answer set programming and other computing paradigms, aspocp 2010

Workshop on Answer Set Programming and Other Computing Parad...

引用

8th International Symposium on Highly-Efficient Accelerators and Reconfigurable Technologies, HEART 2017

the proceedings contain 6 papers. the topics discussed include: symmetry-breaking answer set solving;a logical characterization of ordered disjunction;an optimization for reasoning with forest logic programs;using ASP with recent extensions for causal explanations;interpolation in equilibrium logic and answer set programming: the propositional case;and improving DPLL solver performance with domain-specific heuristics: the ASP case.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Backdoor trees for answer set programming 10

Backdoor trees for answer set programming

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

作者： Fichte, Johannes K. Szeider, Stefan TU Wien Vienna Austria

We translate the concept of backdoor trees from SAT to propositional answer set programming (ASP). By means of backdoor trees we can reduce a reasoning task for a general ASP instance to reasoning tasks on several tractable ASP instances. We demonstrate that the number of tractable ASP instances can be drastically reduced in comparison to a related approach based on strong backdoors.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

CEUR workshop Proceedings

CEUR Workshop Proceedings

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

the proceedings contain 9 papers. the topics discussed include: multi-context systems: dynamics and evolution;generalized answer set planning with incomplete information;CASP for robot control in hybrid domains;Clingo goes linear constraints over reals and integers;a parallel LPMLNsolver: primary report;refining and generalizing plog - preliminary report;forgetting auxiliary atoms in forks;a multiparametric view on answer set programming;and backdoor trees for answer set programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Properties of answer set programming with convex generalized atoms 6

Properties of answer set programming with convex generalized...

引用

6th workshop on answer set programming and other computing paradigms, aspocp 2013, co-located with the 29th International Conference on Logic programming, ICLP 2013

作者： Alviano, Mario Faber, Wolfgang 87036 Italy

In recent years, answer set programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized quantifiers, or abstract constraints, the idea is to have more complicated satisfaction patterns in the lattice of Herbrand interpretations than traditional, simple atoms. In this paper we refer to any of these constructs as generalized atoms. Several semantics with differing characteristics have been proposed for these extensions, rendering the big picture somewhat blurry. In this paper, we analyze the class of programs that have convex generalized atoms (originally proposed by Liu and Truszczynski in [10]) in rule bodies and show that for this class many of the proposed semantics coincide. this is an interesting result, since recently it has been shown that this class is the precise complexity boundary for the FLP semantics. We investigate whether similar results also hold for other semantics, and discuss the implications of our findings. © 2013 ***. All rights reserved.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

CASP for robot control in hybrid domains 10

CASP for robot control in hybrid domains

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

作者： Young, Ryan Balduccini, Marcello Israney, Ankush Drexel University United States

the task of planning in hybrid domains has recently attracted considerable attention, motivated by the potential for useful practical applications. Lately, approaches have been developed that resulted in efficient planning algorithms. In this paper, we push the investigation further and (1) develop execution monitoring and diagnostic algorithms for hybrid domains based on Constraint ASP (CASP);(2) propose an agent architecture that ties together planning, execution monitoring, and diagnostics for hybrid domains;(3) demonstrate our approach on two simple, but non-trivial scenarios, including one on a physical robot.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Generalized answer set planning with incomplete information 10

Generalized answer set planning with incomplete information

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

作者： Romero, Javier Schaub, Torsten Son, Tran Cao University of Potsdam Germany INRIA Rennes France New Mexico State University Las Cruces United States

answer set Planning was one of the first challenging applications of answer set programming (ASP). However, when putting plans into practice, their execution and monitoring lead to an increased complexity. Foremost, this is due to the inherent incompleteness of information faced in real-world scenarios. this fundamental problem has already been addressed in various ways, as in conformant, assertional, and assumption-based planning, and often combined with additional sensing actions. Our objective is to conceive a framework for planning and execution under incomplete information by combining the key concepts of the aforementioned approaches in a uniform ASP-based framework. this paper reports on our first step in this direction. More precisely, we define a series of increasingly complex ASP problems reflecting the successive integration of the key concepts. Our prime concern lies in obtaining a uniform characterization that matches the expressive realm of ASP. this is reflected by developing appropriate approximations that are implemented by means of metaencoding techniques.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Clingo goes linear constraints over reals and integers 10

Clingo goes linear constraints over reals and integers

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

作者： Janhunen, T. Kaminski, R. Ostrowski, M. Schaub, T. Schellhorn, S. Wanko, P. Aalto University Finland INRIA Rennes France University of Potsdam Germany

the recent series 5 of the ASP system clingo provides generic means to enhance basic answer set programming (ASP) with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

A multiparametric view on answer set programming 10

A multiparametric view on answer set programming

引用

10th workshop on answer set programming and other computing paradigms, aspocp 2017

作者： Fichte, Johannes K. Kronegger, Martin Woltran, Stefan TU Wien Vienna Austria Johannes Kepler University Linz Austria

Disjunctive answer set programming (ASP) is an important framework for declarative modeling and problem solving, where the computational complexity of basic decision problems like consistency (deciding whether a program has an answer set) is located on the second level of the polynomial hierarchy. During the last decades different approaches have been applied to find tractable fragments of programs, in particular, also using parameterized complexity. However, the full potential of parameterized complexity has not been unlocked since only one or very few parameters have been considered at once. In this paper, we consider several natural parameters for the consistency problem of disjunctive ASP. In addition, we also take the size of the answer set into account;a restriction that is particularly interesting for applications requiring small solutions. Previous work on parameterizing the consistency problem by the size of answer sets yielded mostly negative results. In contrast, we start from recent findings for the problem WMMSAT and show several novel fixed-parameter tractability (fpt) results based on combinations of parameters. Moreover, we establish a variety of hardness results (paraNP, W[2], and W[1]-hardness) to assess tightness of our combined parameters.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：