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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

511 篇 期刊文献
352 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

826 篇 工学
- 792 篇 计算机科学与技术...
- 401 篇 软件工程
- 59 篇 电气工程
- 26 篇 信息与通信工程
- 25 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
409 篇 理学
- 390 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
10 篇 法学
- 9 篇 法学
- 1 篇 社会学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

874 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
25 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
19 篇 stable model sem...
17 篇 stream reasoning
16 篇 aggregates
16 篇 computational co...
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

35 篇 univ potsdam pot...
19 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

49 篇 schaub torsten
44 篇 alviano mario
44 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
27 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
22 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
19 篇 zangari jessica
19 篇 perri simona
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 faber wolfgang

语言

849 篇 英文
20 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer Set Programming"

共 874 条记录，以下是701-710 订阅

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

详细简洁

排序：

Towards closed world reasoning in dynamic open worlds

Towards closed world reasoning in dynamic open worlds

引用

26th International Conference on Logic programming (ICLP)

作者： Slota, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal

The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge bases composed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve. In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties. To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.

关键词： belief change belief update hybrid knowledge bases ontologies rules description logics answer set programming semantic web

来源：评论

学校读者我要写书评

暂无评论

Towards ILP-Based LTLf Passive Learning 32nd

Towards ILP-Based LTLf Passive Learning

引用

32nd International Conference on Inductive Logic programming (ILP)

作者： Ielo, Antonio Law, Mark Fionda, Valeria Ricca, Francesco De Giacomo, Giuseppe Russo, Alessandra Univ Calabria Arcavacata Di Rende Italy ILASP Ltd Grantham England Univ Oxford Oxford England Imperial Coll London England

ISBN: (纸本)9783031492983;9783031492990

Inferring a LTLf formula from a set of example traces, also known as passive learning, is a challenging task for model-based techniques. Despite the combinatorial nature of the problem, current state-of-the-art solutions are based on exhaustive search. They use an example at the time to discard a single candidate formula at the time, instead of exploiting the full set of examples to prune the search space. This hinders their applicability when examples involve many atomic propositions or when the target formula is not small. This short paper proposes the first ILP-based approach for learning LTLf formula from a set of example traces, using a learning from answer sets system called ILASP. It compares it to both pure SAT-based techniques and the exhaustive search method. Preliminary experimental results show that our approach improves on previous SAT-based techniques and that has the potential to overcome the limitation of an exhaustive search by optimizing over the full set of examples. Further research directions for the ILP-based LTLf passive learning problem are also discussed.

关键词： answer set programming Linear temporal logic over finite traces Learning from answer sets

来源：评论

学校读者我要写书评

暂无评论

Describing Legal Policies as Story Tropes in Normative Systems 29

Describing Legal Policies as Story Tropes in Normative Syste...

引用

29th Annual International Conference on Legal Knowledge and Information Systems (JURIX)

作者： Thompson, Matthew Padget, Julian Satoh, Ken Univ Bath Dept Comp Sci Bath Avon England Natl Inst Informat Principles Informat Res Div Tokyo Japan

ISBN: (纸本)9781614997269;9781614997252

TropICAL is a Domain Specific Language (DSL) for the description of abstract legal policies. Taking inspiration from narrative tropes, our DSL enables the creation of component "policies" that may be reused between case descriptions. These components are compiled to social institutions, which are realised in answer set programming (ASP) code. In this way, the actions of defendant and plaintiff take the shape of a story which must conform to the rules in the ASP description. We propose the use of our DSL in a tool designed for lawyers to generate arguments for the argumentation process.

关键词： legal policies story tropes social institutions answer set programming

来源：评论

学校读者我要写书评

暂无评论

Declarative Reasoning Approaches for Agent Coordination

Declarative Reasoning Approaches for Agent Coordination

引用

8th Hellenic Conference on Artificial Intelligence (setN)

作者： Gouidis, Filippos Patkos, Theodore Flouris, Giorgos Plexousakis, Dimitris FORTH Inst Comp Sci Iraklion Crete Greece

ISBN: (纸本)9783319070636;9783319070643

Reasoning about Action and Change (RAC) and answer set programming (ASP) are two well-known fields in AI for logic-based reasoning. Each paradigm bears unique features and a possible integration can lead to more effective ways to address hard AI problems. In this paper, we report on implementations that embed RAC formalisms and concepts in ASP and present the experimental results obtained, building on a graph-based problem setting that introduces casual and temporal requirements.

关键词： answer set programming Event Calculus Reasoning about Action and Change Multi-Agent Action Coordination

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Stable model semantics for founded bounds

Stable model semantics for founded bounds

引用

29th International Conference on Logic programming ICLP

作者： Aziz, Rehan Abdul Chu, Geoffrey Stuckey, Peter J. Univ Melbourne Dept Comp & Informat Syst Victoria Lab Natl ICT Australia Melbourne Vic 3010 Australia

answer set programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effectively. In this paper, we generalize the notion of stable models to bound founded variables with arbitrary domains, where bounds on such variables need to be justified by some rule in the program in order for the model to be stable. We show how to handle significantly more general rule forms where bound founded variables can act as head or body variables, and where head and body variables can be related via complex constraints subject to certain monotonicity requirements. We describe a new unfounded set detection algorithm which allows us to enforce this generalization of the stable model semantics. We also show how these unfounded sets can be explained in order to allow effective conflict-directed clause learning. The new solver merges the best features of CP, SAT and ASP solvers and allows new types of problems to be solved very efficiently.

关键词： answer set programming stable model semantics finite domain solving

来源：评论

学校读者我要写书评

暂无评论

An access control conflict resolution model based on inductive learning of answer set program 4

An access control conflict resolution model based on inducti...

引用

4th International Conference on Intelligent Information Processing (ICIIP)

作者： Niu, Qinzhou Guo, Hongjian Guilin Univ Technol 319 Yanshan St Guilin City Guangxi Zhuang Peoples R China

ISBN: (纸本)9781450361910

The existing methods for automatically implementing access control policies are mainly traditional logic programming, that is, monotonic logic. There are some shortcomings in monotonic logic, the most important of which is that its design does not invalidate the initial belief in later observation. This limitation makes traditional logic methods not suitable for modeling and analyzing context-aware access control policies. When we need to enforce exceptions at runtime, inconsistencies and conflicts occur that cannot invalidate the initial strategy. Therefore, we propose a non-monotonic logic-based adaptive access control policy modeling and analysis inference scheme that can expressly indicate unavailable context data and incomplete access control policies. In this article, a formal method, Question set programming (ASP), is proposed to elegantly represent the unavailability of context data. In the following, we will automatically learn conflict resolution methods through cautious induction learning methods to make the modeling and analysis of adaptive access control policies more comprehensive and intelligent.

关键词： access control answer set programming exception handling conflict cautions induction learning

来源：评论

学校读者我要写书评

暂无评论

Implementing knowledge update sequences

Implementing knowledge update sequences

引用

6th Mexican International Conference on Artificial Intelligence (MICAI 2007)

作者： Guadarrama, Juan C. Acosta Tech Univ Clausthal Inst Comp Sci Clausthal Zellerfeld Germany

ISBN: (纸本)9783540766308

Update of knowledge bases is becoming an important topic in Artificial Intelligence and a key problem in knowledge representation and reasoning. One of the latest ideas to update logic programs is choosing between models of Minimal Generalised answer sets to overcome disadvantages of previous approaches. This paper describes an implementation of the declarative version of updates sequences that has been proposed as an alternative to syntax-based semantics. One of the main contributions of this implementation is to use DLV's Weak Constraints to compute the model(s) of an update sequence, besides presenting the precise definitions proposed by the authors and an online solver. As a result;the paper makes an outline of the basic structure of the system, describes the employed technology, discusses the major process of computing the models;and illustrates the system through examples.

关键词： answer set programming knowledge representation program transformation implementation non-monotonic reasoning belief revision

来源：评论

学校读者我要写书评

暂无评论

DECOM: A framework to support evolution of IoT services 18

DECOM: A framework to support evolution of IoT services

引用

9th International Symposium on Information and Communication Technology (SoICT)

作者： Huu Tam Tran Jahl, Alexander Geihs, Kurt Kuppili, Ramaprasad Xuan Thang Nguyen Thi Thanh Binh Huynh Univ Kassel Distributed Syst Grp Kassel Germany Univ Hanoi Fac Informat Technol Hanoi Vietnam Hanoi Univ Sci & Technol Hanoi Vietnam

ISBN: (纸本)9781450365390

In the heterogeneous and dynamic Internet of Things (IoT), applications and services are frequently subject to change for various reasons such as maintaining their functionality, reliability, availability, and performance. Detecting and communicating these changes are still performed manually by responsible developers and administrators. Such a mechanism will not be adequate anymore in the future of large-scale IoT environments. Therefore, we present a comprehensive framework named DECOM for automatic detection and communication of service changes. Here, we assume that capabilities and interfaces of IoT devices are described and provided through REST services. To be able to detect syntactic as well as semantic changes, we transform an extended version of the interface description into a logic program and apply a sequence of analysis steps to detect changes. The feasibility and applicability of the framework are demonstrated in an IoT application scenario.

关键词： Service Evolution answer set programming Change Detection Internet of Things Service Co-evolution

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT SOLVING OF TIME-DEPENDENT answer set PROGRAMS

EFFICIENT SOLVING OF TIME-DEPENDENT ANSWER SET PROGRAMS

引用

26th International Conference on Logic programming (ICLP)

作者： Fayruzov, Timur Janssen, Jeroen Vermeir, Dirk Cornelis, Chris De Cock, Martine Univ Ghent Dept Appl Math & Comp Sci Krijgslaan 281 S9 B-9000 Ghent Belgium Vrije Univ Brussel Dept Comp Sci B-1050 Brussels Belgium Univ Washington Inst Technol Tacoma WA 98402 USA

ISBN: (纸本)9783939897170

answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time point t then corresponds to the literals of an answer set that are grounded with time constant t. An important task when modelling time-dependent systems is to find steady states from which the system's behaviour does not change anymore. This task is complicated by the fact that it is typically not known in advance at what time steps these steady states occur. A brute force approach of estimating a time upper bound t(max) and grounding and solving the program w.r.t. that upper bound leads to a suboptimal solving time when the estimate is too low or too high. In this paper we propose a more efficient algorithm for solving Markovian programs, which are time-dependent programs for which the next state depends only on the previous state. Instead of solving these Markovian programs for a long time interval {0,...,t(max)}, we successively find answer sets of parts of the grounded program. Our approach guarantees the discovery of all steady states and cycles while avoiding unnecessary extra work.

关键词： answer set programming time-dependent programs gene regulation networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：