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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

254 篇 会议
24 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 230 篇 计算机科学与技术...
- 146 篇 软件工程
- 11 篇 电气工程
- 9 篇 控制科学与工程
- 8 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
77 篇 理学
- 73 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 法学
1 篇 军事学
- 1 篇 军队指挥学

主题

60 篇 logic programmin...
34 篇 answer set progr...
18 篇 non-monotonic re...
15 篇 knowledge repres...
9 篇 semantics
7 篇 inductive logic ...
6 篇 computer circuit...
5 篇 fuzzy logic
5 篇 formal logic
5 篇 programming
4 篇 belief revision
4 篇 epistemic logic ...
4 篇 non-monotonic lo...
4 篇 model checking
4 篇 ontologies
4 篇 defeasible logic
4 篇 knowledge repres...
4 篇 machine learning
3 篇 equilibrium logi...
3 篇 abduction

机构

9 篇 univ potsdam pot...
6 篇 univ calabria ar...
5 篇 univ a coruna la...
4 篇 new mexico state...
4 篇 vrije univ bruss...
4 篇 imperial coll lo...
4 篇 univ milano bico...
4 篇 univ angers leri...
3 篇 tu wien austria
3 篇 univ genoa dibri...
3 篇 univ calabria de...
3 篇 vienna univ tech...
3 篇 tech univ dresde...
2 篇 university of ma...
2 篇 univ torino dipa...
2 篇 katholieke univ ...
2 篇 univ calabria di...
2 篇 univ hasselt has...
2 篇 univ politecn ma...
2 篇 univ ferrara dip...

作者

16 篇 ricca francesco
9 篇 cabalar pedro
8 篇 alviano mario
7 篇 fandinno jorge
6 篇 schaub torsten
6 篇 maratea marco
5 篇 maher michael j.
5 篇 gebser martin
4 篇 eiter thomas
4 篇 son tran cao
3 篇 akbar siami nami...
3 篇 governatori guid...
3 篇 gaggl sarah alic...
3 篇 perez gilberto
3 篇 riguzzi fabrizio
3 篇 penaloza rafael
3 篇 formisano andrea
3 篇 aguado felicidad
3 篇 russo alessandra
3 篇 ielo antonio

语言

282 篇 英文

检索条件"任意字段=17th International Conference on Logic Programming and Non-monotonic Reasoning"

共 282 条记录，以下是151-160 订阅

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

详细简洁

排序：

Handling Semantic Inconsistencies in Commonsense Knowledge for Autonomous Service Robots 14

Handling Semantic Inconsistencies in Commonsense Knowledge f...

引用

14th IEEE international conference on Semantic Computing (ICSC)

作者： Jakob, Stefan Opfer, Stephan Jahl, Alexander Baraki, Harun Geihs, Kurt Univ Kassel Wilhelmshoher Allee 73 D-34121 Kassel Germany

ISBN: (纸本)9781728163321

the necessary amount of commonsense knowledge for autonomous domestic service robots is enormous and avoiding inconsistencies is consequently almost impossible. this is especially true for inconsistencies on a semantic level, that is, inconsistencies as interpreted by human beings where the properties of a concept may contradict each other. In contrast to Boolean algebra (A and A), these inconsistencies will not lead to a trivial solution like false, since they are not captured in a logic formalism. Instead, they will result in semantic contradictions when interpreting the solution. In order to tackle this problem, we propose a way to handle semantic inconsistencies, by utilising a commonsense knowledge database and implementing a dynamic knowledge base that is capable of resolving contradicting parts of knowledge. the applied non-monotonic reasoning mechanism is Answer Set programming, and ConceptNet5 is the commonsense knowledge database. Finally, we evaluate the performance of our approach and show its advantages in a complete household scenario.

关键词： Answer set programming Cognitive robotics Commonsense reasoning Dynamic knowledge Semantic inconsistencies Service robots

来源：评论

学校读者我要写书评

暂无评论

NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Beyond 14th

NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Bey...

引用

14th international conference on logic programming and nonmonotonic reasoning (LPNMR)

作者： Lopes, Carlos Knorr, Matthias Leite, Joao Univ Nova Lisboa NOVA LINCS Dept Informat Fac Ciencias & Tecnol P-2829516 Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

We present the latest, substantially improved, version of NoHR, a reasoner designed to answer queries over hybrid theories composed of an OWL ontology in Description logics and a set of non-monotonic rules in logic programming. Whereas the need to combine the distinctive features of these two knowledge representation and reasoning approaches stems from real world applications, their integration is nevertheless theoretically challenging due to their substantial semantical differences. NoHR has been developed as a plug-in for the widely used ontology editor Protege - in fact, the first hybrid reasoner of its kind for Protege, building on a combination of reasoners dedicated to OWL and rules - but it is also available as a library, allowing for its integration within other environments and applications. Compared to previous versions of NoHR, this is the first that supports all polynomial OWL profiles, and even beyond, allowing for its usage with real-world ontologies that do not fit within a single profile. In addition, NoHR has now an enhanced integration with its rule engine, which provides support for a vast number of standard built-in Prolog predicates that considerably extend its usability.

关键词： Query answering logic programming Description logic ontologies

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Coalgebraic Approach to Linear-Time logics

A Coalgebraic Approach to Linear-Time Logics

引用

17th international conference on the Foundations of Software Science and Computation Structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of Software (ETAPS)

作者： Cirstea, Corina Univ Southampton Southampton Hants England

ISBN: (纸本)9783642548307;9783642548291

We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth values induced canonically by the branching monad. this yields logics for reasoning about quantitative aspects of linear-time behaviour. Examples include reasoning about the probability of a linear-time behaviour being exhibited by a system with probabilistic branching, or about the minimal cost of a linear-time behaviour being exhibited by a system with weighted branching. In the case of non-deterministic branching, our logic supports reasoning about the possibility of exhibiting a given linear-time behaviour, and therefore resembles an existential version of the logic LTL.

关键词： branches Formal logic time characteristic reasoning Probability WDR92 gene set value

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the Characterization of the Maximal Ideal Recursive Semantics of RP-DeLP 17

On the Characterization of the Maximal Ideal Recursive Seman...

引用

17th international conference of the Catalan-Association-of-Artificial-Intelligence (CCIA)

作者： Alsinet, Teresa Bejar, Ramon Godo, Lluis Guitart, Francesc Univ Lleida Dept Comp Sci C Jaume 269 Lleida Spain CSIC Artificial Intelligence Res Inst IIIA Bellaterra Spain

ISBN: (纸本)9781614994527;9781614994510

Possibilistic Defeasible logic programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeated by a warrant procedure that systematically explores the universe of arguments in order to present an exhaustive synthesis of the relevant chains of pros and cons for the given conclusion. Recently, we have proposed a new warrant recursive semantics for P-DeLP, called Recursive P-DeLP (RP-DeLP for short), based on the claim that the acceptance of an argument should imply also the acceptance of all its subarguments which reflect the different premises on which the argument is based. In RP-DeLP, an output of a program is a pair of sets, a set of warranted and a set of blocked *** for both warranted and blocked conclusions are recursively based on warranted conclusions but, while warranted conclusions do not generate any conflict with the set of already warranted conclusions and the strict part of program (information we take for granted they hold true), blocked conclusions do. Conclusions that are neither warranted nor blocked correspond to rejected conclusions. this paper explores the relationship between the exhaustive dialectical analysis based semantics of P-DeLP and the recursive based semantics of RP-DeLP, and analyzes a non-monotonic inference operator for RP-DeLP which models the expansion of a given program by adding new weighed facts associated with warranted conclusions.

关键词： argumentation logic programming uncertainty non-monotonic inference

来源：评论

学校读者我要写书评

暂无评论

Towards an Inductive logic programming Approach for Explaining Black-Box Preference Learning Systems

Towards an Inductive Logic Programming Approach for Explaini...

引用

17th international conference on Principles of Knowledge Representation and reasoning (KR and R)

作者： D'Asaro, Fabio A. Spezialetti, Matteo Raggioli, Luca Rossi, Silvia Univ Naples Federico II Naples Italy Univ Aquila Laquila Italy CRdC Tecnol Naples Italy

ISBN: (纸本)9780999241172

In this paper we advocate the use of Inductive logic programming as a device for explaining black-box models, e.g. Support Vector Machines (SVMs), when they are used to learn user preferences. We present a case study where we use the ILP system ILASP to explain the output of SVM classifiers trained on preference datasets. Explanations are produced in terms of weak constraints, which can be easily understood by humans. We use ILASP both as a global and a local approximator for SVMs, score its fidelity, and discuss how its output can prove useful e.g. for interactive learning tasks and for identifying unwanted biases when the original dataset is not available. Finally, we highlight directions for further work and discuss relevant application areas.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

logic programming: the 12th international conference

引用

1995年

作者： Leon S. Sterling

13-16 June 1995, Tokyo, Japan ICLP, which is sponsored by the Association for logic programming, is one of two major annual international conferences reporting recent research results in logic programming. logic programming originates from the discovery that a subset of predicate logic could be given a procedural interpretation which was first embodied in the programming language, Prolog. the unique features of logic programming make it appealing for numerous applications in artificial intelligence, computer-aided design and verification, databases, and operations research, and for exploring parallel and concurrent computing. the last two decades have witnessed substantial developments in this field from its foundation to implementation, applications, and the exploration of new language *** covered : theoretical Foundations. Higher-Order logics. non-monotonic reasoning. programming Methodology. programming Environments. Extensions to logic programming. Constraint Satisfaction. Meta-programming. Language Design and Constructs. Implementation of logic programming Languages. Compilation Techniques. Architectures. Parallelism. reasoning about Programs. Deductive Databases. *** programming series, Research Reports and Notes

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tableau Calculus for the logic of Comparative Similarity over Arbitrary Distance Spaces

Tableau Calculus for the Logic of Comparative Similarity ove...

引用

17th international conference on logic for programming, Artificial Intelligence, and reasoning

作者： Alenda, Regis Olivetti, Nicola CNRS UMR 6168 LSIS F-13397 Marseille 20 France

ISBN: (纸本)9783642162411

the logic CSL (first introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev in 2005) allows one to reason about distance comparison and similarity comparison within a modal language. the logic can express assertions of the kind "A is closer/more similar to B than to C" and has a natural application to spatial reasoning, as well as to reasoning about concept similarity in ontologies. the semantics of CSL is defined in terms of models based on different classes of distance spaces and it generalizes the logic S4(u) of topological spaces. In this paper we consider CSL defined over arbitrary distance spaces. the logic comprises a binary modality to represent comparative similarity and a unary modality to express the existence of the minimum of a set of distances. We first show that the semantics of CSL can be equivalently defined in terms of preferential models. As a consequence we obtain the finite model property of the logic with respect to its preferential semantic, a property that does not hold with respect to the original distance-space semantics. Next we present an analytic tableau calculus based on its preferential semantics. the calculus provides a decision procedure for the logic, its termination is obtained by imposing suitable blocking restrictions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：