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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

229 篇 工学
- 218 篇 计算机科学与技术...
- 109 篇 软件工程
- 23 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 信息与通信工程
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 安全科学与工程
47 篇 理学
- 44 篇 数学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
14 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

69 篇 logic programmin...
17 篇 answer set progr...
15 篇 inductive logic ...
12 篇 mathematical log...
11 篇 artificial intel...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 programming
10 篇 programming lang...
9 篇 software enginee...
9 篇 logic
7 篇 application soft...
7 篇 logic gates
7 篇 inductive logic ...
7 篇 semantics
7 篇 programming tech...
7 篇 system testing
6 篇 software enginee...
6 篇 machine learning
6 篇 algorithm analys...

机构

3 篇 new mexico state...
3 篇 univ calabria ar...
3 篇 tu wien inst log...
3 篇 tech univ dresde...
2 篇 technological ed...
2 篇 univ oxford oxfo...
2 篇 univ nebraska om...
2 篇 univ helsinki de...
2 篇 network operatio...
2 篇 univ freiburg in...
2 篇 inria lille nord...
2 篇 tech univ dortmu...
2 篇 ecole polytech i...
2 篇 univ paris 13 li...
2 篇 univ pisa dept c...
2 篇 tech univ munich...
2 篇 portland state u...
2 篇 univ london impe...
2 篇 katholieke univ ...
1 篇 bolsista do prog...

作者

4 篇 riguzzi fabrizio
4 篇 ricca francesco
3 篇 gaggl sarah alic...
3 篇 kramer stefan
3 篇 page david
3 篇 son tran cao
3 篇 srinivasan ashwi...
3 篇 froehler sebasti...
3 篇 alphonse erick
2 篇 muggleton stephe...
2 篇 giordano laura
2 篇 toivonen h.
2 篇 ong irene m.
2 篇 revoredo k.
2 篇 bellodi elena
2 篇 osmani aomar
2 篇 bryant christoph...
2 篇 ray oliver
2 篇 hutter dieter
2 篇 costa vitor sant...

语言

314 篇 英文
2 篇 中文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=16th International Conference of Inductive Logic Programming"

共 318 条记录，以下是31-40 订阅

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

详细简洁

排序：

Syntactic ASP Forgetting with Forks 16th

Syntactic ASP Forgetting with Forks

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Aguado, Felicidad Cabalar, Pedro Fandinno, Jorge Pearce, David Perez, Gilberto Vidal, Concepcion Univ A Coruna Corunna Spain Univ Nebraska Omaha NE 68182 USA Univ Politecn Madrid Madrid Spain

ISBN: (纸本)9783031157073;9783031157066

In this paper, we present a syntactic transformation, called the unfolding operator, that allows forgetting an atom in a logic program (under ASP semantics). the main advantage of unfolding is that, unlike other syntactic operators, it is always applicable and guarantees strong persistence, that is, the result preserves the same stable models with respect to any context where the forgotten atom does not occur. the price for its completeness is that the result is an expression that may contain the fork operator. Yet, we illustrate how, in some cases, the application of fork properties may allow us to reduce the fork to a logic program, even in conditions that could not be treated before using the syntactic methods in the literature.

关键词： Answer Set programming Equilibrium logic Forgetting Strong Persistence Strong Equivalence Forks

来源：评论

学校读者我要写书评

暂无评论

A Practical Account into Counting Dung's Extensions by Dynamic programming 16th

A Practical Account into Counting Dung's Extensions by Dynam...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Dewoprabowo, Ridhwan Fichte, Johannes Klaus Gorczyca, Piotr Jerzy Hecher, Markus Tech Univ Dresden Dresden Germany TU Wien Vienna Austria

ISBN: (纸本)9783031157073;9783031157066

A Abstract argumentation and Dung's framework are popular for modeling and evaluating arguments in artificial intelligence. We consider various counting problems in abstract argumentation under practical aspects. We revisit algorithms and establish a framework that employs dynamic programming on tree decompositions for counting extensions of abstract argumentation frameworks under admissible, stable, and complete semantics. We provide an empirical evaluation and investigate conditions under which our approach is useful.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Modal logic S5 in Answer Set programming with Lazy Creation of Worlds 16th

Modal Logic S5 in Answer Set Programming with Lazy Creation ...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Alviano, Mario Batsakis, Sotiris Baryannis, George Univ Calabria Arcavacata Di Rende Italy Tech Univ Crete Iraklion Greece Univ Huddersfield Sch Comp & Engn Huddersfield W Yorkshire England

ISBN: (纸本)9783031157073;9783031157066

Modal logic S5 is used extensively for representing knowledge that includes statements about necessity and possibility, owing to its simplicity in handling chained modal operators. Significant research effort has been devoted in developing efficient reasoning mechanisms over complex S5 formulas, resulting in various solvers taking advantage of the boolean satisfiability problem (SAT). Among them, the most performant solver implements a heuristic for identifying worlds that can be merged, hence reducing the size of SAT instances to be checked. Recently, Answer Set programming (ASP) has also been considered, and different ASP encodings were proposed and tested, reaching state-of-the-art performance. In particular, a heuristic for identifying the propositional atoms that are relevant in every world resulted in a performance gain in previous experiments. this work addresses the open question of whether the aforementioned two heuristics can be combined, as well as possibly enabling lazy instantiation of the resulting encodings, and what their potential impact is on the performance of the ASP-based solver. Experiments show that lazy creation of worlds provides some further performance gain to the ASP-based solver on the tested instances.

关键词： Modal logic S5 Answer Set programming

来源：评论

学校读者我要写书评

暂无评论

xASP: An Explanation Generation System for Answer Set programming 16th

xASP: An Explanation Generation System for Answer Set Progra...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Trieu, Ly Ly Son, Tran Cao Balduccini, Marcello New Mexico State Univ Las Cruces NM 88003 USA St Josephs Univ Philadelphia PA 19131 USA

ISBN: (纸本)9783031157073;9783031157066

In this paper, we present a system, called xASP, for generating explanations that explain why an atom belongs to (or does not belong to) an answer set of a given program. the system can generate all possible explanations for a query without the need to simplify the program before computing explanations, i.e., it works with non-ground programs. these properties distinguish xASP from existing systems such as xClingo, DiscASP, exp(ASP(c)), and s(CASP), which also generate explanations for queries to logic programs under the answer set semantics but simplify and ground the programs (the three systems xClingo, DiscASP, exp(ASP(c))) or do not always generate all possible explanations (the system s(CASP)). In addition, the output of xASP is insensitive to syntactic variations such as the order conditions and the order of rules, which is also different from the output of s(CASP).

关键词： Explainable AI logic programming Answer Set programming

来源：评论

学校读者我要写书评

暂无评论

Enumeration of Minimal Models and MUSes in WASP 16th

Enumeration of Minimal Models and MUSes in WASP

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Alviano, Mario Dodaro, Carmine Fiorentino, Salvatore Previti, Alessandro Ricca, Francesco Dept Math & Comp Sci Arcavacata Di Rende Italy Ericsson Res Stockholm Sweden Univ Calabria Arcavacata Di Rende Italy

ISBN: (纸本)9783031157073;9783031157066

Several AI problems can be conveniently modelled in ASP, and many of them require to enumerate solutions characterized by an optimality property that can be expressed in terms of subset-minimality with respect to some objective atoms. In this context, solutions are often either (i) answer sets or (ii) sets of atoms that enforce the absence of answer sets on the ASP program at hand such sets are referred to as minimal unsatisfiable subsets (MUSes). In both cases, the required enumeration task is currently not supported by state-of-the-art ASP solvers.

关键词： Answer Set programming Enumeration Minimal models MUS

来源：评论

学校读者我要写书评

暂无评论

Metric Temporal Answer Set programming over Timed Traces 16th

Metric Temporal Answer Set Programming over Timed Traces

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Cabalar, Pedro Dieguez, Martin Schaub, Torsten Schuhmann, Anna Univ A Coruna Coruna Spain Univ Angers LERIA Angers France Univ Potsdam Potsdam Germany

ISBN: (纸本)9783031157073;9783031157066

In temporal extensions of Answer Set programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. In many applications, however, timing constraints are important like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. the resulting Metric Equilibrium logic provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in Metric Equilibrium logic and Monadic Quantified Equilibrium logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards Causality-Based Conflict Resolution in Answer Set Programs 16th

Towards Causality-Based Conflict Resolution in Answer Set Pr...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： thevapalan, Andre Haupt, Konstantin Kern-Isberner, Gabriele Tech Univ Dortmund D-44227 Dortmund Germany

ISBN: (纸本)9783031157073;9783031157066

Using answer set programming in real-world applications requires that the answer set program is correct and adequately represents knowledge. In this paper, we present strategies to resolve unintended contradictory statements resulting from modelling gaps and other flaws by modifying the program without manipulating the actual conflicting rules (inconsistency-causing rules with complementary head literals). We show how latent conflicts can be detected to prevent further conflicts during the resolution process or after subsequent modifications in the future. the presented approach is another step towards a general framework where professional experts who are not necessarily familiar with ASP can repair existing answer set programs and independently resolve conflicts resulting from contradictory statements in an informative way. In such a framework, conflict resolution strategies allow for generating possible solutions that consist of informative extensions and modifications of the program. In interaction with the professional expert, these solution options can then be used to obtain the solution that represents the underlying knowledge best.

关键词： Answer Set programming Conflicts Consistency Contradictions Interactive Conflict Resolution

来源：评论

学校读者我要写书评

暂无评论

Solving Problems in the Polynomial Hierarchy with ASP(Q) 16th

Solving Problems in the Polynomial Hierarchy with ASP(Q)

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Amendola, Giovanni Cuteri, Bernardo Ricca, Francesco Truszczynski, Mirek Univ Calabria Arcavacata Di Rende Italy Univ Kentuky Lexington KY USA

ISBN: (纸本)9783031157073;9783031157066

Answer Set programming with Quantifiers ASP(Q) is a recent extension of Answer Set programming (ASP) that allows one to model problems from the entire polynomial hierarchy. Earlier work focused on demonstrating modeling capabilities of ASP(Q). In this paper, we propose a modular ASP(Q) solver that translates a quantified ASP program together with a given data instance into a Quantified Boolean Formula (QBF) to be solved by any QBF solver. We evaluate the performance of our solver on several instances and with different back-end QBF solvers, demonstrating the efficacy of ASP(Q) as a tool for rapid modeling and solving of complex combinatorial problems. the benchmark problems we use include two new ones, Argumentation Coherence and Para-coherent ASP, for which we develop elegant ASP(Q) encodings.

关键词： Answer Set programming Quantifiers QBF

来源：评论

学校读者我要写书评

暂无评论

Deep Learning for the Generation of Heuristics in Answer Set programming: A Case Study of Graph Coloring 16th

Deep Learning for the Generation of Heuristics in Answer Set...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Dodaro, Carmine Ilardi, Davide Oneto, Luca Ricca, Francesco Univ Calabria DeMaCS Arcavacata Di Rende Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783031157073;9783031157066

Answer Set programming (ASP) is a well-established declarative AI formalism for knowledge representation and reasoning. ASP systems were successfully applied to both industrial and academic problems. Nonetheless, their performance can be improved by embedding domain-specific heuristics into their solving process. However, the development of domain-specific heuristics often requires both a deep knowledge of the domain at hand and a good understanding of the fundamental working principles of the ASP solvers. In this paper, we investigate the use of deep learning techniques to automatically generate domain-specific heuristics for ASP solvers targeting the well-known graph coloring problem. Empirical results show that the idea is promising: the performance of the ASP solver WASP can be improved.

关键词： answer set programming deep learning heuristics graph coloring

来源：评论

学校读者我要写书评

暂无评论

Control logic Encoding using RiskSpectrum ModelBuilder 16

Control Logic Encoding using RiskSpectrum ModelBuilder

引用

16th international conference on Probabilistic Safety Assessment and Management, PSAM 2022

作者： Krcal, Pavel Troili, Helena Bäckström, Ola Lloyd's Register Stockholm Sweden

Model-based safety assessment brings dependability modeling closer to the system design and allow for automated analysis of high-level models. RiskSpectrum ModelBuilder uses an object-oriented modeling language with elements of declarative programming called Figaro for describing the dependability logic of component types. We demonstrate how the Figaro language, and the concept of knowledge bases empowers dependability experts to create generic component descriptions that can be used in model-based safety assessment of various system types. In particular, we focus on the possibilities to encode complex control logic. One can create a single component type that can be utilized in systems with different topologies or in systems that contain different components. © 2022 Probabilistic Safety Assessment and Management, PSAM 2022. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：