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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9 篇 会议

馆藏范围

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

日期分布

学科分类号

8 篇 工学
- 8 篇 计算机科学与技术...
- 8 篇 软件工程
- 1 篇 机械工程
- 1 篇 控制科学与工程
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

4 篇 logic programmin...
1 篇 computer circuit...
1 篇 expert systems
1 篇 specifications
1 篇 probabilistic lo...

机构

1 篇 imdea software i...
1 篇 cintesis faculty...
1 篇 eavise technolog...
1 篇 inesc-id institu...
1 篇 college of charl...
1 篇 arizona state un...
1 篇 cracs inesc tec ...
1 篇 madrid
1 篇 new mexico state...
1 篇 space and naval ...
1 篇 institute of com...
1 篇 university of ud...
1 篇 ku leuven depart...

作者

1 篇 gouveia filipe
1 篇 lynce inês
1 篇 morales josé f.
1 篇 obermeier philip...
1 篇 vennekens joost
1 篇 dovier agostino
1 篇 leclerc anthony ...
1 篇 côrte-real joana
1 篇 igne federico
1 篇 garcia-contreras...
1 篇 dries anton
1 篇 pontelli enrico
1 篇 wang yi
1 篇 kahl patrick tho...
1 篇 aerts bram
1 篇 hermenegildo man...
1 篇 rocha ricardo
1 篇 dutra inês
1 篇 monteiro pedro t...

语言

9 篇 英文

检索条件"任意字段=Technical Communications of the 34th International Conference on Logic Programming, ICLP 2018"

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

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

详细简洁

排序：

technical communications of the 34th international conference on logic programming, iclp 2018

Technical Communications of the 34th International Conferenc...

引用

technical communications of the 34th international conference on logic programming, iclp 2018

ISBN: (纸本)9783959770903

the proceedings contain 24 papers. the topics discussed include: epistemic logic programs with world view constraints;cumulative scoring-based induction of default theories;introspecting preferences in answer set programming;improving candidate quality of probabilistic logic models;towards incremental and modular context-sensitive analysis;declarative algorithms in datalog with extrema: their formal semantics simplified;towards static performance guarantees for programs with run-time checks;learning commonsense knowledge through interactive dialogue;application of logic-based methods to machine component design;and explanations generation for web service workflow.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards incremental and modular context-sensitive analysis 34

Towards incremental and modular context-sensitive analysis

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Garcia-Contreras, Isabel Morales, José F. Hermenegildo, Manuel V. Madrid Spain IMDEA Software Institute Pozuelo de Alarcón Madrid Spain

this is an extended abstract of [1]. © Isabel Garcia-Contreras, Jose F. Morales, and Manuel V. Hermenegildo;licensed under Creative Commons License CC-BY

ISBN: (纸本)9783959770903

this is an extended abstract of [1]. © Isabel Garcia-Contreras, Jose F. Morales, and Manuel V. Hermenegildo;licensed under Creative Commons License CC-BY

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Application of logic-based methods to machine component design 34

Application of logic-based methods to machine component desi...

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Aerts, Bram Vennekens, Joost EAVISE Technology Campus De Nayer KU Leuven Belgium

ISBN: (纸本)9783959770903

this paper describes an application worked out in collaboration with a company that produces made-to-order machine components. the goal of the project is to develop a system that can support the company's engineers by automating parts of their component design process. We propose a knowledge extraction methodology based on the recent DMN (Decision Model and Notation) standard and compare a rule-based and a constraint-based method for representing the resulting knowledge. We study the advantages and disadvantages of both approaches in the context of the company's real-life application. © Bram Aerts and Joost Vennekens;licensed under Creative Commons License CC-BY

关键词： Expert systems

来源：评论

学校读者我要写书评

暂无评论

Scalable robotic intra-logistics with answer set programming 34

Scalable robotic intra-logistics with answer set programming

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Obermeier, Philipp Institute of Computer Science University of Potsdam Germany

ISBN: (纸本)9783959770903

Over time, Answer Set programming (ASP) has gained traction as a versatile logic programming semantics with performant processing systems, used by a growing number of significant applications in academia and industry. However, this development is threatened by a lack of commonly accepted design patterns and techniques for ASP to address dynamic application on a real-world scale. To this end, we identified robotic intra-logistics as representative scenario, a major domain of interest in the context of the fourth industrial revolution. For this setting, we aim to provide a scalable and efficient ASP-based solutions by (1) stipulating a standardized test and benchmark framework;(2) leveraging existing ASP techniques through new design patterns;and (3) extending ASP with new functionalities. In this paper we will expand on the subject matter as well as detail our current progress and future plans. © Philipp Obermeier;licensed under Creative Commons License CC-BY

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Epistemic logic programs with world view constraints 34

Epistemic logic programs with world view constraints

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Kahl, Patrick thor Leclerc, Anthony P. Space and Naval Warfare Systems Center Atlantic North CharlestonSC United States College of Charleston CharlestonSC United States

ISBN: (纸本)9783959770903

An epistemic logic program is a set of rules written in the language of Epistemic Specifications, an extension of the language of answer set programming that provides for more powerful introspective reasoning through the use of modal operators K and M. We propose adding a new construct to Epistemic Specifications called a world view constraint that provides a universal device for expressing global constraints in the various versions of the language. We further propose the use of subjective literals (literals preceded by K or M) in rule heads as syntactic sugar for world view constraints. Additionally, we provide an algorithm for finding the world views of such programs. © Patrick thor Kahl and Anthony P. Leclerc;licensed under Creative Commons License CC-BY

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

MASP-reduce: A proposal for distributed computation of stable models 34

MASP-reduce: A proposal for distributed computation of stabl...

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Igne, Federico Dovier, Agostino Pontelli, Enrico University of Udine Udine Italy New Mexico State University NM United States

ISBN: (纸本)9783959770903

there has been an increasing interest in recent years towards the development of efficient solvers for Answer Set programming (ASP) and towards the application of ASP to solve increasing more challenging problems. In particular, several recent efforts have explored the issue of scalability of ASP solvers when addressing the challenges caused by the need to ground the program before resolution. this paper offers an alternative solution to this challenge, focused on the use of distributed programming techniques to reason about ASP programs whose grounding would be prohibitive for mainstream ASP solvers. the work builds on a proposal of a characterization of answer set solving as a form of non-standard graph coloring. the paper expands this characterization to include syntactic extensions used in modern ASP (e.g., choice rules, weight constraints). We present an implementation of the solver using a distributed programming framework specifically designed to manipulate very large graphs, as provided by Apache Spark, which in turn builds on the MapReduce programming framework. Finally, we provide a few preliminary results obtained from the first prototype implementation of this approach. © Federico Igne, Agostino Dovier, and Enrico Pontelli;licensed under Creative Commons License CC-BY

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Probabilistic action language pBC+ 34

Probabilistic action language pBC+

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Wang, Yi Arizona State University School of Computing Informatics Decision Systems Engineering Fulton Schools of Engineering Arizona State University P.O. Box 878809 TempeAZ85287-8809 United States

ISBN: (纸本)9783959770903

We present an ongoing research on a probabilistic extension of action language BC+. Just like BC+ is defined as a high-level notation of answer set programs for describing transition systems, the proposed language, which we call pBC+, is defined as a high-level notation of LPMLN programs - a probabilistic extension of answer set programs. As preliminary results accomplished, we illustrate how probabilistic reasoning about transition systems, such as prediction, postdiction, and planning problems, as well as probabilistic diagnosis for dynamic domains, can be modeled in pBC+ and computed using an implementation of LPMLN. For future work, we plan to develop a compiler that automatically translates pBC+ description into LPMLN programs, as well as parameter learning in probabilistic action domains through LPMLN weight learning. We will work on defining useful extensions of pBC+ to facilitate hypothetical/counterfactual reasoning. We will also find real-world applications, possibly in robotic domains, to empirically study the performance of this approach to probabilistic reasoning in action domains. © Yi Wang;licensed under Creative Commons License CC-BY

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Model revision of logical regulatory networks using logic-based tools 34

Model revision of logical regulatory networks using logic-ba...

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Gouveia, Filipe Lynce, Inês Monteiro, Pedro T. INESC-ID Instituto Superior Técnico Universidade de Lisboa Rua Alves Redol 9 Lisboa1000-029 Portugal

ISBN: (纸本)9783959770903

Recently, biological data has been increasingly produced calling for the existence of computational models able to organize and computationally reproduce existing observations. In particular, biological regulatory networks have been modeled relying on the Sign Consistency Model or the logical formalism. However, their construction still completely relies on a domain expert to choose the best functions for every network component. Due to the number of possible functions for k arguments, this is typically a process prone to error. Here, we propose to assist the modeler using logic-based tools to verify the model, identifying crucial network components responsible for model inconsistency. We intend to obtain a model building procedure capable of providing the modeler with repaired models satisfying a set of pre-defined criteria, therefore minimizing possible modeling errors. © Filipe Gouveia, Inês Lynce, and Pedro T. Monteiro;licensed under Creative Commons License CC-BY

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Improving candidate quality of probabilistic logic models 34

Improving candidate quality of probabilistic logic models

引用

technical communications of the 34th international conference on logic programming, iclp 2018

作者： Côrte-Real, Joana Dries, Anton Dutra, Inês Rocha, Ricardo CRACS INESC TEC Faculty of Sciences University of Porto Rua do Campo Alegre 1021 Porto4169-007 Portugal KU Leuven Department of Computer Science Celestijnenlaan 200A bus 2402 Leuven3001 Belgium CINTESIS Faculty of Sciences University of Porto Rua do Campo Alegre 1021 Porto4169-007 Portugal

ISBN: (纸本)9783959770903

Many real-world phenomena exhibit both relational structure and uncertainty. Probabilistic Inductive logic programming (PILP) uses Inductive logic programming (ILP) extended with probabilistic facts to produce meaningful and interpretable models for real-world phenomena. this merge between First Order logic (FOL) theories and uncertainty makes PILP a very adequate tool for knowledge representation and extraction. However, this flexibility is coupled with a problem (inherited from ILP) of exponential search space growth and so, often, only a subset of all possible models is explored due to limited resources. Furthermore, the probabilistic evaluation of FOL theories, coming from the underlying probabilistic logic language and its solver, is also computationally demanding. this work introduces a prediction-based pruning strategy, which can reduce the search space based on the probabilistic evaluation of models, and a safe pruning criterion, which guarantees that the optimal model is not pruned away, as well as two alternative more aggressive criteria that do not provide this guarantee. Experiments performed using three benchmarks from different areas show that prediction pruning is effective in (i) maintaining predictive accuracy for all criteria and experimental settings;(ii) reducing the execution time when using some of the more aggressive criteria, compared to using no pruning;and (iii) selecting better candidate models in limited resource settings, also when compared to using no pruning. © Joana Côrte-Real, Anton Dries, Inês Dutra, and Ricardo Rocha;licensed under Creative Commons License CC-BY

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：