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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

668 篇 会议
32 篇 期刊文献
19 册 图书

馆藏范围

718 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

648 篇 工学
- 645 篇 计算机科学与技术...
- 356 篇 软件工程
- 28 篇 控制科学与工程
- 22 篇 电气工程
- 18 篇 信息与通信工程
- 3 篇 材料科学与工程（可...
- 3 篇 建筑学
- 3 篇 生物工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 农业工程
129 篇 理学
- 120 篇 数学
- 5 篇 物理学
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
33 篇 管理学
- 23 篇 图书情报与档案管...
- 13 篇 管理科学与工程(可...
- 7 篇 工商管理
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

247 篇 logic programmin...
46 篇 answer set progr...
44 篇 semantics
22 篇 computer circuit...
22 篇 artificial intel...
21 篇 knowledge repres...
20 篇 formal logic
18 篇 nonmonotonic rea...
12 篇 calculations
11 篇 mathematical log...
11 篇 logics and meani...
9 篇 constraint progr...
8 篇 answer-set progr...
8 篇 atoms
8 篇 inductive logic ...
8 篇 ontology
7 篇 knowledge repres...
7 篇 programming tech...
6 篇 software enginee...
6 篇 data description

机构

21 篇 vienna univ tech...
11 篇 univ potsdam pot...
10 篇 univ kentucky de...
8 篇 univ bath dept c...
8 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 tu wien austria
6 篇 inria rennes ren...
6 篇 university of po...
5 篇 univ potsdam ins...
5 篇 univ a coruna la...
5 篇 simon fraser uni...
5 篇 univ genoa dibri...
5 篇 univ calabria ar...
5 篇 new mexico state...
5 篇 univ calabria de...
5 篇 univ alberta dep...
4 篇 vienna universit...
4 篇 university of ca...

作者

35 篇 schaub torsten
25 篇 gebser martin
23 篇 ricca francesco
19 篇 tompits hans
18 篇 eiter thomas
17 篇 woltran stefan
16 篇 leone nicola
14 篇 alviano mario
12 篇 faber wolfgang
12 篇 cabalar pedro
11 篇 brain martin
11 篇 de vos marina
10 篇 calimeri frances...
10 篇 fink michael
10 篇 inoue katsumi
9 篇 ianni giovambatt...
9 篇 son tran cao
8 篇 giordano laura
8 篇 eiter t
8 篇 lifschitz vladim...

语言

713 篇 英文
4 篇 中文
2 篇 其他

检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 719 条记录，以下是41-50 订阅

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

详细简洁

排序：

Gradient-Based Supported Model Computation in Vector Spaces 16th

Gradient-Based Supported Model Computation in Vector Spaces

引用

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

作者： Takemura, Akihiro Inoue, Katsumi Grad Univ Adv Studies Dept Informat SOKENDAI Tokyo Japan Natl Inst Informat Tokyo Japan

ISBN: (纸本)9783031157073;9783031157066

We propose a method for computing supported models of normal logic programs in vector spaces using gradient information. First, the program is translated into a definite program and embedded into a matrix representing the program. We introduce a loss function based on the implementation of the immediate consequence operator T-P by matrix-vector multiplication with a suitable thresholding function, and we incorporate regularization terms into the loss function to avoid undesirable results. the proposed thresholding operation is an almost everywhere differentiable alternative to the non-linear thresholding operation. We report the results of several experiments where our method shows promising performance when used with adaptive gradient update.

关键词： logic programming Supported Model Computation Differentiable logic 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

来源：评论

学校读者我要写书评

暂无评论

A Qualitative Temporal Extension of Here-and-there logic 16th

A Qualitative Temporal Extension of Here-and-There Logic

引用

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

作者： Eiter, thomas Schneider, Patrik TU Wien Inst Log & Computat Vienna Austria Siemens AG Munich Germany

ISBN: (纸本)9783031157073;9783031157066

Model-based Diagnosis (MBD) is an approach to diagnosis, where an (objective) model of a system is diagnosed to find a set of explanations revealing root causes for issues. Temporal behavioral models are prominent approach for temporal MBD, where their associated temporal formulas (TBFs) by Brusoni et al. (Artificial Intelligence, 102:39-79, 1998) can be used to relate explanations to observations under temporal constraints based on Allen's Interval Algebra (IA). Due to expressive limitations of the constructs, we envision an extended language of TBFs that allows for complex formulas and nesting of formulas in temporal constraints. To this end, we present a language that extends propositional resp. FO logic with IA relations and provide semantics for it based on here-and-there (HT) logic as well as on Equilibrium logic. Furthermore, we lift a well-known tableau calculus for propositional HT logic to the temporal setting and report about an experimental prototype implementation. Based on these results, rich notions of diagnostic explanations from temporal behavior models may be developed.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Statistical Statements in Probabilistic logic programming 16th

Statistical Statements in Probabilistic Logic Programming

引用

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

作者： Azzolini, Damiano Bellodi, Elena Riguzzi, Fabrizio Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy

ISBN: (纸本)9783031157073;9783031157066

Probabilistic logic Programs under the distribution semantics (PLPDS) do not allow statistical probabilistic statements of the form "90% of birds fly", which were defined "Type 1" statements by Halpern. In this paper, we add this kind of statements to PLPDS and introduce the PASTA ("Probabilistic Answer set programming for STAtistical probabilities") language. We translate programs in our new formalism into probabilistic answer set programs under the credal semantics. this approach differs from previous proposals, such as the one based on "probabilistic conditionals" as, instead of choosing a single model by making the maximum entropy assumption, we take into consideration all models and we assign probability intervals to queries. In this way we refrain from making assumptions and we obtain a more neutral framework. We also propose an inference algorithm and compare it with an existing solver for probabilistic answer set programs on a number of programs of increasing size, showing that our solution is faster and can deal with larger instances.

关键词： Probabilistic logic programming Statistical statements Statistical Relational Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Representing Abstract Dialectical Frameworks with Binary Decision Diagrams 16th

Representing Abstract Dialectical Frameworks with Binary Dec...

引用

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

作者： Ellmauthaler, Stefan Gaggl, Sarah Alice Rusovac, Dominik Wallner, Johannes P. Tech Univ Dresden Cfaed Knowledge Based Syst Grp Dresden Germany Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany Graz Univ Technol Inst Software Technol Graz Austria

ISBN: (纸本)9783031157073;9783031157066

A Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (RoBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by RoBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics for search space exploitation, based on easily retrievable properties of RoBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.

关键词： Abstract dialectical frameworks Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：