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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是131-140 订阅

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

详细简洁

排序：

Temporal logic Monitoring Rewards via Transducers 17

Temporal Logic Monitoring Rewards via Transducers

引用

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

作者： De Giacomo, Giuseppe Favorito, Marco Iocchi, Luca Patrizi, Fabio Ronca, Alessandro Univ Roma La Sapienza DIAG Rome Italy

ISBN: (纸本)9780999241172

In Markov Decision Processes (MDPs), rewards are assigned according to a function of the last state and action. this is often limiting, when the considered domain is not naturally Markovian, but becomes so after careful engineering of an extended state space. the extended states record information from the past that is sufficient to assign rewards by looking just at the last state and action. non-Markovian Reward Decision Processes (NMRDPs) extend MDPs by allowing for non-Markovian rewards, which depend on the history of states and actions. non-Markovian rewards can be specified in temporal logics on finite traces such as LTLf/LDLf, with the great advantage of a higher abstraction and succinctness;they can then be automatically compiled into an MDP with an extended state space. We contribute to the techniques to handle temporal rewards and to the solutions to engineer them. We first present an approach to compiling temporal rewards which merges the formula automata into a single transducer, sometimes saving up to an exponential number of states. We then define monitoring rewards, which add a further level of abstraction to temporal rewards by adopting the four-valued conditions of runtime monitoring;we argue that our compilation technique allows for an efficient handling of monitoring rewards. Finally, we discuss applications to reinforcement learning.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

ASPMT(QS): non-monotonic spatial reasoning with answer set programming modulo theories 13th

ASPMT(QS): Non-monotonic spatial reasoning with answer set p...

引用

13th international conference on logic programming and nonmonotonic reasoning, LPNMR 2015

作者： Walęga, Przemyslaw Andrzej Bhatt, Mehul Schultz, Carl Institute of Philosophy University of Warsaw Warsaw Poland Department of Computer Science University of Bremen Bremen Germany

ISBN: (纸本)9783319232638

the systematic modelling of dynamic spatial systems [9] is a key requirement in a wide range of application areas such as comonsense cognitive robotics, computer-aided architecture design, dynamic geographic information systems. We present ASPMT(QS), a novel approach and fully-implemented prototype for non-monotonic spatial reasoning — a crucial requirement within dynamic spatial systems– based on Answer Set programming Modulo theories (ASPMT). ASPMT(QS) consists of a (qualitative) spatial representation module (QS) and a method for turning tight ASPMT instances into Sat Modulo theories (SMT) instances in order to compute stable models by means of SMT solvers. We formalise and implement concepts of default spatial reasoning and spatial frame axioms using choice formulas. Spatial reasoning is performed by encoding spatial relations as systems of polynomial constraints, and solving via SMT with the theory of real nonlinear arithmetic. We empirically evaluate ASPMT(QS) in comparison with other prominent contemporary spatial reasoning systems. Our results show that ASPMT(QS) is the only existing system that is capable of reasoning about indirect spatial effects (i.e. addressing the ramification problem), and integrating geometric and qualitative spatial information within a non-monotonic spatial reasoning context. © Springer international Publishing Switzerland 2015.

关键词： Cognitive systems

来源：评论

学校读者我要写书评

暂无评论

SHACL: A Description logic in Disguise 16th

SHACL: A Description Logic in Disguise

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Bogaerts, Bart Jakubowski, Maxime Van den Bussche, Jan Vrije Univ Brussel Brussels Belgium Univ Hasselt Hasselt Belgium

ISBN: (纸本)9783031157073;9783031157066

SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. In recent years, SHACL's popularity has risen quickly. this rise in popularity comes with questions related to its place in the semantic web, particularly about its relation to OWL (the de facto standard for expressing ontological information on the web) and description logics (which form the formal foundations of OWL). We answer these questions by arguing that SHACL is in fact a description logic. On the one hand, our answer is surprisingly simple, some might even say obvious. But, on the other hand, our answer is also controversial. By resolving this issue once and for all, we establish the field of description logics as the solid formal foundations of SHACL.

关键词： Shapes SHACL Description logics Ontologies

来源：评论

学校读者我要写书评

暂无评论

Advances in Multi-engine ASP Solving 14th

Advances in Multi-engine ASP Solving

引用

14th international conference of the Italian-Association-for-Artificial-Intelligence (AIIA)

作者： Maratea, Marco Pulina, Luca Ricca, Francesco Univ Genoa DIBRIS I-16145 Genoa Italy Univ Sassari POLCOMING I-07100 Sassari Italy Univ Calabria Dip Matemat & Informat I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)9783319243092;9783319243085

Algorithm selection techniques are known to improve the performance of systems for several knowledge representation and reasoning frameworks. this holds also in the case of Answer Set programming (ASP), which is a rule-based programming paradigm with roots in logic programming and non-monotonic reasoning. Indeed, the multi-engine approach to ASP solving implemented in me-asp was particularly effective on the instances of the third ASP competition. In this paper we report about the advances we made on me-asp in order to deal with the new standard language ASPCore 2.0, which substantially extends the previous version of the standard language. An experimental analysis conducted on the Fifth ASP Competition benchmarks and solvers confirms the effectiveness of our approach also in comparison to rival systems.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Argumentation-based Scene Interpretation Using Defeasible logic programming 17

Argumentation-based Scene Interpretation Using Defeasible Lo...

引用

international conference on Advanced Robotics (ICAR)

作者： Koc, Cagatay Sariel, Sanem Istanbul Tech Univ Artificial Intelligence & Robot Lab Istanbul Turkey

ISBN: (纸本)9781467375092

In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we present an approach that addresses this problem by applying an argumentation-based scene interpretation framework for accurately modelling and representing the observations and beliefs of an agent. Our approach is based on temporal and probabilistic defeasible logic programming for reasoning. the performance of our approach is evaluated on simulation experiments in the Stage Robot Simulator. We also show that our approach is applicable to real world scenarios with an autonomous Pioneer 3-AT robot.

关键词： logic programming Robot Agents Beliefs Face World models

来源：评论

学校读者我要写书评

暂无评论

Relative expressiveness of defeasible logics II

Relative expressiveness of defeasible logics II

引用

29th international conference on logic programming ICLP

作者： Maher, Michael J. Univ New S Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia

Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).

关键词： defeasible logic non-monotonic reasoning relative expressiveness

来源：评论

学校读者我要写书评

暂无评论

17th conference of the Italian Association for Artificial Intelligence, AIIA 2018

17th Conference of the Italian Association for Artificial In...

引用

17th conference of the Italian Association for Artificial Intelligence, AI*IA 2018

ISBN: (纸本)9783030038397

the proceedings contain 41 papers. the special focus in this conference is on Italian Association for Artificial Intelligence. the topics include: On the Notion of Goal in Business Process Models;towards an Ontological Modelling of Preference Relations;a Generalized Framework for Ontology-Based Data Access;creative Concept Generation by Combining Description logic of Typicality, Probabilities and Cognitive Heuristics;a Comparative Study of Defeasible Argumentation and non-monotonic Fuzzy reasoning for Elderly Survival Prediction Using Biomarkers;compact Preference Representation via Fuzzy Constraints in Stable Matching Problems: theoretical and Experimental Studies;answer Set programming for Declarative Content Specification: A Scalable Partitioning-Based Approach;a Tableau Calculus for a Multi-modal logic of Dishonesty;goal Distribution in Business Process Models;timed Memory in Resource-Bounded Agents;a Tool for the Verification of Data-Aware Business Processes;exploring Abstract Argumentation-Based Approaches to Tackle Inconsistent Observations in Inductive logic programming;expectation Maximization in Deep Probabilistic logic programming;neural Random Access Machines Optimized by Differential Evolution;the Role of Coherence in Facial Expression Recognition;Extremely Randomized CNets for Multi-label Classification;bayesian Markov logic Networks: Bayesian Inference for Statistical Relational Learning;an Integration-Based Approach to Pattern Clustering and Classification;Top-Down Attention Recurrent VLAD Encoding for Action Recognition in Videos;neural Learning for Question Answering in Italian;an Information Model for Computing Accountabilities;detecting Inappropriate Comments to News;annotating Concept Abstractness by Common-Sense Knowledge;iterative Width Search for Multi Agent Privacy-Preserving Planning;operating Room Scheduling via Answer Set programming;a Goal Triggering Mechanism for Continuous Human-Robot Interaction;novelty-Aware Matrix Factorization Base

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning System to Improve the Performance of ASP Solving Based on Encoding Selection 16th

A Machine Learning System to Improve the Performance of ASP ...

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Liu, Liu Truszczynski, Mirek Lierler, Yuliya Univ Kentucky Lexington KY 40506 USA Univ Nebraska Omaha NE 68182 USA

ISBN: (纸本)9783031157073;9783031157066

Answer set programming (ASP) has long been used for modeling and solving hard search problems. Experience shows that the performance of ASP tools on different ASP encodings of the same problem may vary greatly from instance to instance and it is rarely the case that one encoding outperforms all others. We describe a system and its implementation that given a set of encodings and a training set of instances, builds performance models for the encodings, predicts the execution time of these encodings on new instances, and uses these predictions to select an encoding for solving.

关键词： answer set programming encoding selection machine learning

来源：评论

学校读者我要写书评

暂无评论

Epistemic logic Programs: A Study of Some Properties 16th

Epistemic Logic Programs: A Study of Some Properties

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Costantini, Stefania Formisano, Andrea Univ Aquila DISIM Laquila Italy Univ Udine DMIF Udine Italy

ISBN: (纸本)9783031157073;9783031157066

Epistemic logic Programs (ELPs), extend Answer Set programming (ASP) with epistemic operators. the semantics of such programs is provided in terms of world views, which are sets of belief sets. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the Epistemic Splitting Property, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to 'traditional' ASP. We analyze the possibility to change the perspective, shifting from a bottom-up to a top-down approach to splitting. Our new definition: (i) copes with concerns regarding unfoundedness of world views and subjective constraint monotonicity;(ii) is provably applicable to many of the existing semantics;(iii) operates similarly to "traditional" ASP;(iv) provably coincides with the bottom-up notion of splitting at least on the class of Epistemically Stratified Programs (which are, intuitively, those where the use of epistemic operators is stratified).

关键词： Answer Set programming Epistemic logic Programs Epistemic Splitting

来源：评论

学校读者我要写书评

暂无评论

An algebraic account of modularity in ID-logic

An algebraic account of modularity in ID-logic

引用

3rd international Workshop on Answer Set programming: Advances in theory and Implementation, ASP 2005, Co-located Event with the 19th international Joint conference on Artificial Intelligence, IJCAI 2005

作者： Vennekens, Joost Denecker, Marc Dept. of Computer Science K.U. Leuven Celestijnenlaan 200A B-3001 Leuven Belgium

ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, an algebraic theory which generalizes the semantics of several non-monotonic reasoning formalisms. this allows us to apply certain abstract modularity theorems, developed within the framework of approximation theory, to ID-logic. As such, we are able to offer elegant and simple proofs of generalizations of known theorems, as well as some new results.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：