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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Exploiting conjunctive queries in description logic programs

Exploiting conjunctive queries in description logic programs

引用

10th International Symposium on Artificial Intelligence and Mathematics

作者： Eiter, Thomas Ianni, Giovambattista Krennwallner, Thomas Schindlauer, Roman Vienna Univ Technol Inst Informat Syst 184 3 A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende CS Italy

Towards combining rules and ontologies for the Semantic Web, nonmonotonic Description Logic Programs (dl-programs) have been proposed as a powerful formalism to couple nonmonotonic logic programming and Description Logic reasoning on a clear semantic basis. In this paper, we present cq-programs, which enhance dl-programs with conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics knowledge bases, as well as with disjunctive rules. The novel formalism has two advantages. First, it offers increased expressivity because it allows for (U)CQs in the bodies of the rules. The (U)CQs allow one to access unnamed individuals in the rules and they increase the expressivity of the formalism, as evident from the increase in complexity from NEXP to 2-EXP. And second, when implemented as a combination between a logic programming system and a DL-reasoner, this integration of rules and ontologies gives rise to strategies for optimizing calls to the DL-reasoner, by exploiting specific support for (U)CQs. To this end, we present equivalence preserving transformations which can be used for program rewriting, and we present respective generic rewriting algorithms. Experimental results for a cq-program prototype show that this can lead to significant performance improvements, and suggest that cq-programs and program rewriting provide a useful basis for dl- and cq-program optimization.

关键词： Hybrid rule languages Conjunctive queries and description logics answer set programming Semantic web

来源：评论

学校读者我要写书评

暂无评论

HEX PROGRAMS WITH ACTION ATOMS

HEX PROGRAMS WITH ACTION ATOMS

引用

26th International Conference on Logic programming (ICLP)

作者： Basol, Selen Erdem, Ozan Fink, Michael Ianni, Giovambattista Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey TU Wien Inst Informat Syst A-1040 Vienna Austria Univ Calabria Dipartimento Matemat I-87036 Arcavacata Di Rende Italy

ISBN: (纸本)9783939897170

HEX programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectionally accessing external sources of knowledge and/or computation. The original framework, however, does not deal satisfactorily with stateful external environments: the possibility of predictably influencing external environments has thus not yet been considered explicitly. This paper lifts HEX programs to ACTHEX programs: ACTHEX programs introduce the notion of action atoms, which are associated to corresponding functions capable of actually changing the state of external environments. The execution of specific sequences of action atoms can be declaratively programmed. Furthermore, ACTHEX programs allow for selecting preferred actions, building on weights and corresponding cost functions. We introduce syntax and semantics of ACTHEX programs;ACTHEX programs can successfully be exploited as a general purpose language for the declarative implementation of executable specifications, which we illustrate by encodings of knowledge bases updates, action languages, and an agent programming language. A system capable of executing ACTHEX programs has been implemented and is publicly available.

关键词： answer set programming Logic programming interoperability Action languages

来源：评论

学校读者我要写书评

暂无评论

Architecture of a Web-Based Predictive Editor for Controlled Natural Language Processing

引用

4th International Workshop on Controlled Natural Language (CNL)

作者： Guy, Stephen Schwitter, Rolf Macquarie Univ Dept Comp Sydney NSW 2109 Australia

ISBN: (纸本)9783319102238

In this paper, we describe the architecture of a web-based predictive text editor being developed for the controlled natural language PENG ASP. This controlled language can be used to write non-monotonic specifications that have the same expressive power as answer set Programs. In order to support the writing process of these specifications, the predictive text editor communicates asynchronously with the controlled natural language processor that generates lookahead categories and additional auxiliary information for the author of a specification text. The text editor can display multiple sets of lookahead categories simultaneously for different possible sentence completions, anaphoric expressions, and supports the addition of new content words to the lexicon.

关键词： controlled natural language processing predictive editor web-based authoring tools answer set programming

来源：评论

学校读者我要写书评

暂无评论

Integrating Rule-Based AI Tools into Mainstream Game Development 2nd

Integrating Rule-Based AI Tools into Mainstream Game Develop...

引用

2nd International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Calimeri, Francesco Germano, Stefano Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783319999067;9783319999050

Rule-based declarative formalisms enjoy several advantages when compared with imperative solutions, especially when dealing with AI-based application development: solid theoretical bases, no need for algorithm design or coding, explicit and easily modifiable knowledge bases, executable declarative specifications, fast prototyping, quick error detection, modularity. For these reasons, ways for combining declarative paradigms, such as answer set programming (ASP), with traditional ones have been significantly studied in the recent years;there are however relevant contexts, in which this road is unexplored, such as development of real-time games. In such a setting, the strict requirements on reaction times, the presence of computer-human interactivity and a generally increased impedance between the two development paradigms make the task nontrivial. In this work we illustrate how to embed rule-based reasoning modules into the well-known Unity game development engine. To this end, we present an extension of EmbASP, a framework to ease the integration of declarative formalisms with generic applications. We prove the viability of our approach by developing a proof-of-concept Unity game that makes use of ASP-based AI modules.

关键词： answer set programming Artificial Intelligence Game programming Knowledge representation and reasoning Logic programs Rule-based systems Unity

来源：评论

学校读者我要写书评

暂无评论

Maintenance Scheduling for Cloud Infrastructure with Timing Constraints of Live Migration 7

Maintenance Scheduling for Cloud Infrastructure with Timing ...

引用

7th IEEE International Conference on Cloud Engineering (IEEE IC2E)

作者： Okuno, Shingo Iikura, Fumi Watanabe, Yukihiro Fujitsu Labs Ltd Kawasaki Kanagawa Japan

ISBN: (纸本)9781728102184

In this paper, we propose an implementation of a maintenance scheduler for cloud infrastructures. Live migration associated with maintenance work is important to ensure service continuity for all virtual machines in an infrastructure. However, executing the migration process when the machines are under heavy load negatively affects cloud users' businesses, such as by degrading performance and extending downtime. We can avoid this by finding an appropriate time period for live migration and performing the migration then. This idea is convenient for cloud users but inconvenient for cloud providers, that is, maintenance work should be completed as soon as possible for security reasons. To satisfy both the users' convenience and providers' requirements, we designed a maintenance scheduling problem to find the appropriate time period and to shorten the maintenance work period. Since it is a large-scale combinatorial optimization problem with complex constraints on maintenance requirements, we described the constraints by using answer set programming and implemented a maintenance scheduler on the basis of a divide-and-conquer approach to reduce the computational complexity exponentially. We evaluated our scheduler by using information on a real configuration of a commercial cloud infrastructure. While a naive approach to solving the maintenance scheduling problem could not find any feasible solutions within a realistic amount of time and memory, our implementation generated the best maintenance schedule for 1032 physical machines and 14208 virtual machines in 206 s with a memory usage of 1086 MB.

关键词： cloud computing infrastructure as a service (IaaS) maintenance scheduling live migration answer set programming divide-and-conquer approach

来源：评论

学校读者我要写书评

暂无评论

Distributed Deadlock Handling for Resource Allocation in Smart Spaces

Distributed Deadlock Handling for Resource Allocation in Sma...

引用

11th Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN) / 4th Conference on Smart Spaces (ruSMART)

作者： Aziz, Rehan Abdul Janhunen, Tomi Luukkala, Vesa Aalto Univ Sch Sci Dept Informat & Comp Sci Aalto Finland Nokia Res Ctr Sunnyvale CA USA

ISBN: (纸本)9783642228759

In a ubiquitous system, there are several interacting computational objects which use each others' resources. As the number of resources and their consumers grow in such systems, the delay that the consumers experience for obtaining control over resources increases with an existing rule-based resource allocation technique. Distributing the resource allocation, however, complicates the nature of deadlocks that may arise and requires more sophisticated techniques as compared to a setup with central control. The goal of this paper is to generalize the current resource allocation method to a distributed setting and, in particular, to propose an approach for handling deadlocks in this case.

关键词： semantic web resource allocation distributed deadlock answer set programming

来源：评论

学校读者我要写书评

暂无评论

A Translation-based Approach to the Verification of Modular Equivalence

A Translation-based Approach to the Verification of Modular ...

引用

4th International Workshop on answer set programming

作者： Oikarinen, Emilia Janhunen, Tomi Aalto Univ Dept Informat & Comp Sci FI-02015 Helsinki Finland

The goal of this article is to foster modular program development in answer set programming using a Gaifman-Shapiro-style module architecture. More specifically, a method for verifying the equivalence of logic program modules is devised and proved correct. The idea is to adapt a translation-based verification technique, which was originally devised for complete programs only, for program modules. In addition, optimization strategies are addressed in order to exploit the modular structure of programs in verification tasks. A number of experiments on verification strategies are also conducted using lpeq which implements the verification method for the smodels system. The preliminary experimental results reported in this article suggest that the modularization of equivalence verification leads to potential time savings especially if the modules involved share a common context.

关键词： answer set programming modular program development compositionality of stable model semantics module theorem translation-based verification method

来源：评论

学校读者我要写书评

暂无评论

Logic-based methodology to help security architects in eliciting high-level network security requirements 19

Logic-based methodology to help security architects in elici...

引用

34th ACM/SIGAPP Annual International Symposium on Applied Computing (SAC)

作者： Laborde, Romain Bulusu, Sravani Teja Wazan, Ahmad Samer Barrere, Francois Benzekri, Abdelmalek Univ Paul Sabatier Toulouse France

ISBN: (纸本)9781450359337

In this paper(1), we propose a security methodology that automates the process of security zone specification and high-level network security requirements elicitation. We define a set of formalized rules derived from the principles of complete mediation, least privileges and the Clark-Wilson lite formal model making our approach traceable and verifiable. We implemented the methodology in answer set programming to automatically compute an optimal network security zone model considering the cost of the security solution. A use case study of an e-commerce enterprise network infrastructure illustrates our methodology.

关键词： Network Security Requirements Security Zoning Integrity Model answer set programming

来源：评论

学校读者我要写书评

暂无评论

USA-Smart: Improving the quality of plans in answer set planning 6th

USA-Smart: Improving the quality of plans in answer set plan...

引用

6th International Symposium on Practical Aspects of Declarative Languages

作者： Balduccini, M Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA

ISBN: (纸本)3540222537

In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The general problem that we address is that of improving the quality of plans by taking in consideration statements that describe "most desirable" plans. We believe that USA-Smart proves that CR-Prolog provides a simple, elegant, and flexible solution to this problem, and can be easily applied to any planning domain. We also discuss how alternative extensions of A-Prolog can be used to obtain similar results.

关键词： planning answer set programming preferences

来源：评论

学校读者我要写书评

暂无评论

Causal Graph Justifications of Logic Programs

Causal Graph Justifications of Logic Programs

引用

30th International Conference on Logic programming

作者： Cabalar, Pedro Fandinno, Jorge Fink, Michael Univ A Coruna Dept Comp Sci Coruna Spain Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs formed by rule labels and edges that represent their application ordering. For positive programs, we show that the causal justifications obtained for a given atom have a direct correspondence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs. The most interesting contribution is that this causal information is obtained in a purely semantic way, by algebraic operations (product, sum and application) on a lattice of causal values whose ordering relation expresses when a justification is stronger than another. Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct. As a result, default negation behaves as "absence of proof" and no justification is derived from negative literals, something that turns out convenient for elaboration tolerance, as we explain with a running example.

关键词： answer set programming Causality Knowledge Representation Multi-valued Logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：