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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

14 篇 会议

馆藏范围

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

日期分布

学科分类号

12 篇 工学
- 11 篇 计算机科学与技术...
- 10 篇 软件工程
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 生物工程
5 篇 理学
- 4 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 法学
- 1 篇 法学

主题

5 篇 logic programmin...
1 篇 computer circuit...
1 篇 search engines
1 篇 commerce
1 篇 petri nets
1 篇 semantics
1 篇 assembly
1 篇 monte carlo meth...

机构

2 篇 university of po...
2 篇 university of kl...
1 篇 dipartimento di ...
1 篇 universitaê de t...
1 篇 royal holloway u...
1 篇 imperial college...
1 篇 tu wien austria
1 篇 informatics inst...
1 篇 principles of in...
1 篇 university of co...
1 篇 alma ai alma mat...
1 篇 scuola normale s...
1 篇 czech technical ...
1 篇 dipartimento di ...
1 篇 inria bretagne a...
1 篇 department of co...
1 篇 alpen-adria univ...
1 篇 ted university a...
1 篇 department of co...
1 篇 2-1-2 hitotsubas...

作者

3 篇 morak michael
2 篇 toni francesca
2 篇 faber wolfgang
2 篇 satoh ken
1 篇 sileno giovanni
1 篇 paulino-passos g...
1 篇 contissa giusepp...
1 篇 moinard yves
1 篇 riguzzi fabrizio
1 篇 calegari roberta
1 篇 nguyen ha thanh
1 篇 woltran stefan
1 篇 perrussel lauren...
1 篇 hecher markus
1 篇 lamma evelina
1 篇 chrpa lukaâës
1 篇 sabuncu orkunt
1 篇 stathis kostas
1 篇 fandinno jorge
1 篇 åžimåek mehmet c...

语言

14 篇 英文

检索条件"任意字段=2020 International Conference on Logic Programming Workshop, ICLP20WS 2020"

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

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

详细简洁

排序：

iclp20ws 2020 - international conference on logic programming 2020 workshop Proceedings, co-located with 36th international conference on logic programming, iclp 2020

ICLP20WS 2020 - International Conference on Logic Programmin...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

The proceedings contain 15 papers. The topics discussed include: encoding choice logics in ASP;determining action reversibility in STRIPS using answer set programming;solving assembly line workload smoothing problem via answer set programming;a multi-shot ASP encoding for the aircraft routing and maintenance planning problem;action languages and COVID-19: lessons learned;causal analysis of events occurring in trajectories of dynamic domains;operationalizing declarative and procedural knowledge: a benchmark on logic programming Petri Nets (LPPNs);actual causality in contextual abduction;and dynamic epistemic logic with ASP updates: application to conditional planning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structural Decompositions of Epistemic logic Programs

Structural Decompositions of Epistemic Logic Programs

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Hecher, Markus Morak, Michael Woltran, Stefan Tu Wien Austria University of Potsdam Germany University of Klagenfurt Austria

来源：评论

学校读者我要写书评

暂无评论

Operationalizing Declarative and Procedural Knowledge: A Benchmark on logic programming Petri Nets (LPPNs)

Operationalizing Declarative and Procedural Knowledge: A Ben...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Sileno, Giovanni Informatics Institute University of Amsterdam Netherlands

Modelling, specifying and reasoning about complex systems requires to process in an integrated fashion declarative and procedural aspects of the target domain. The paper reports on an experiment conducted with a propositional version of logic programming Petri Nets (LPPNs), a notation extending Petri Nets with logic programming constructs. Two semantics are presented: A denotational semantics that fully maps the notation to ASP via Event Calculus;and a hybrid operational semantics that process separately the causal mechanisms via Petri nets, and the constraints associated to objects and to events via Answer Set programming (ASP). These two alternative specifications enable an empirical evaluation in terms of computational efficiency. Experimental results show that the hybrid semantics is more efficient w.r.t. sequences, whereas the two semantics follows the same behaviour w.r.t. branchings (although the denotational one performs better in absolute terms). © 2020 CEUR-ws. All rights reserved.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

An Epistemic logic for Reasoning about Strategies in General Auctions

An Epistemic Logic for Reasoning about Strategies in General...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Mittelmann, Munyque Perrussel, Laurent UniversitAê de Toulouse-IRIT France

In this paper, we present the Epistemic Auction Description Language (E-ADL), a language for epistemic and strategic reasoning in auctions from the playerâs perspective. An automated auction player faces the challenge of understanding and processing several different auction-based markets. With E-ADL, an agent can evaluate the mechanism with well-known properties of economic theory, such as strategy-proofness and efficiency. Moreover, with the epistemic component, the agent can reason about other agentsâ private valuation and their awareness of the protocol properties. © 2020 CEUR-ws. All rights reserved.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

Solving Assembly Line Workload Smoothing Problem via Answer Set programming

Solving Assembly Line Workload Smoothing Problem via Answer ...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Sabuncu, Orkunt ÅžimÅek, Mehmet Cem Ted University Ankara Turkey

Assembly line balancing problems aim to assign production tasks to workstations or people while satisfying some constraints and optimizing various criteria such as production rate or number of workstations needed. One specific instance is Simple Assembly Line Workload Smoothing Problem (SALBP-ws) that focuses on smoothing workloads of all workstations. This is important for establishing equity among workers or maintaining sustainable conditions for workstations. In this work, we develop several Answer Set programming encodings for solving SALBP-ws. The performed experiments showcase better scalability results compared to problem specific exact methods based on branch and bound technique. Additionally, we propose a new criterion that handles the workstation idle times hierarchically, as a measure of smoothness of an assignment. © 2020 CEUR-ws. All rights reserved.

关键词： Assembly

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Gibbs Sampling for Probabilistic logic Programs

An Analysis of Gibbs Sampling for Probabilistic Logic Progra...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Azzolini, Damiano Riguzzi, Fabrizio Lamma, Evelina Dipartimento di Ingegneria University of Ferrara Via Saragat 1 FerraraI-44122 Italy Dipartimento di Matematica e Informatica University of Ferrara Via Saragat 1 FerraraI-44122 Italy

Markov Chain Monte Carlo (MCMC) is one of the most used families of algorithms based on sampling. They allow to sample from the posterior distribution when direct sampling from it is infeasible, due to the complexity of the distribution itself. Gibbs sampling is one of these algorithm that has been applied in many situations. In this paper we compare an implementation of Gibbs sampling for Probabilistic logic Programs on several datasets, in order to better understand its performance. For all the experiments we compute the convergence time, execution time and population standard deviation of the samples. © 2020 CEUR-ws. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Determining Action Reversibility in STRIPS Using Epistemic logic Programs

Determining Action Reversibility in STRIPS Using Epistemic L...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Faber, Wolfgang Morak, Michael University of Klagenfurt Austria

In planning and reasoning about action and change, reversibility of actions is the problem of deciding whether the effects of an action can be reverted by applying other actions in order to return to the original state. While this problem has been studied for some time, recently there as been renewed interest in the context of the language PDDL. After reviewing the concepts, in this paper we propose a solution by leveraging an existing translation from PDDL to Answer Set programming (ASP), which we then use to solve the problem via epistemic logic programs (ELPs). This work provides a sound and complete system for determining reversibility of PDDL actions (restricted to the STRIPS fragment), while also providing insight into the performance of state-ofthe-art ELP solvers. © 2020 CEUR-ws. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Determining Action Reversibility in STRIPS Using Answer Set programming

Determining Action Reversibility in STRIPS Using Answer Set ...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Chrpa, LukAâËs Faber, Wolfgang FiËser, Daniel Morak, Michael Czech Technical University in Prague Czech Republic Alpen-Adria University Klagenfurt Austria

In planning and reasoning about action and change, reversibility of actions is the problem of deciding whether the effects of an action can be reverted by applying other actions in order to return to the original state. While this problem has been studied for some time, recently there has been renewed interest in the context of the language PDDL. After reviewing the concepts, in this paper we propose a solution by leveraging an existing translation from PDDL domains and problems to Answer Set programming (ASP). This work serves as the basis for the first sound and complete system for determining reversibility of PDDL actions, for now restricted to the STRIPS fragment. © 2020 CEUR-ws. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Epistemic logic with ASP Updates: Application to Conditional Planning

Dynamic Epistemic Logic with ASP Updates: Application to Con...

引用

2020 international conference on logic programming workshop, iclp20ws 2020

作者： Cabalar, Pedro Fandinno, Jorge FariÃas Del Cerro, Luis University of Corunna Spain University of Potsdam Germany Institut de Recherche en Informatique de Toulouse Universty of Toulouse Cnrs France

Dynamic Epistemic logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agentâs knowledge is captured by modal epistemic operators whereas the system evolution is described in terms of (some subset of) dynamic logic modalities in which actions are usually represented as semantic objects called event models. In this paper, we study a variant of DEL, that we call DEL[ASP], where actions are syntactically described by using an Answer Set programming (ASP) representation instead of event models. This representation directly inherits high level expressive features like indirect effects, qualifications, state constraints, defaults, or recursive fluents that are common in ASP descriptions of action domains. Besides, we illustrate how this approach can be applied for obtaining conditional plans in single-agent, partially observable domains where knowledge acquisition may be represented as indirect effects of actions. © 2020 CEUR-ws. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Using ASP with recent extensions for causal explanations 3

Using ASP with recent extensions for causal explanations

引用

3rd workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010 - Collocated with the international conference on logic programming, iclp 2010

作者： Moinard, Yves INRIA Bretagne Atlantique IRISA Campus de Beaulieu Rennes Cedex35042 France

We examine the practicality for a user of using Answer Set programming (ASP) for representing logical formalisms. We choose as an example a formalism aiming at capturing causal explanations from causal information. We provide an implementation, showing the naturalness and relative efficiency of this translation job. We are interested in the ease for writing an ASP program, in accordance with the claimed "declarative" aspect of ASP. Limitations of the earlier systems (poor data structure and difficulty in reusing pieces of programs) made that in practice, the "declarative aspect" was more theoretical than practical. We show how recent improvements in working ASP systems facilitate a lot the translation, even if a few improvements could still be useful. © 2020 workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：