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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,428 篇 会议
70 册 图书
56 篇 期刊文献

馆藏范围

1,553 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,261 篇 工学
- 1,246 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

388 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
16 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
6 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1554 条记录，以下是871-880 订阅

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

详细简洁

排序：

Belief revision of logic programs under answer set semantics

Belief revision of logic programs under answer set semantics

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Delgrande, James Schaub, Torsten Tompits, Hans Woltran, Stefan School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada Institut für Informatik Universität Potsdam August-Bebel-Str. 89 D-14482 Potsdam Germany Institut für Informationssysteme Technische Universität Wien Favoritenstraße 9-11 A-1040 Vienna Austria Griffith University Australia

ISBN: (纸本)9781577353843

We address the problem of belief revision in (nonmonotonic) logic programming under answer set semantics: given logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. Unlike previous approaches in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing our results, we build upon the model theory of logic programs furnished by SE models. Since SE models provide a formal, monotonic characterisation of logic programs, we can adapt well-known techniques from the area of belief revision to revision in logic programs. We investigate two specific operators: (logic program) expansion and a revision operator based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical AGM-style belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties;in particular, our revision operators satisfy the majority of the AGM postulates for revision. A complexity analysis reveals that our revision operators do not increase the complexity of the base formalism. As a consequence, we present an encoding for computing the revision of a logic program by another, within the same logic programming framework. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Paraconsistent logic Programs with Four-Valued Rough Sets

引用

6th international conference on Rough Sets and Current Trends in Computing

作者： Maluszynski, Jan Szalas, Andrzej Vitoria, Aida Coll Econ & Comp Sci PL-10061 Olsztyn Poland Warsaw Univ Inst Informat PL-02097 Warsaw Poland Linkoping Univ Dept Sci & Technol S-60174 Norrkoping Sweden

ISBN: (纸本)9783540884231

this paper presents a language for defining four-valued rough sets and to reason about them. Our framework brings together two major fields: rough sets and paraconsistent logic programming. On the one hand it provides a paraconsistent approach, based on four-valued rough sets, for integrating knowledge from different sources and reasoning in the presence of inconsistencies. On the other hand, it also caters for a specific type of uncertainty that originates from the fact that an agent may perceive different objects of the universe as being indiscernible. this paper extends the ideas presented in [9]. Our language allows the user to define similarity relations and use the approximations induced by them in the definition of other four-valued sets. A positive aspect is that it allows users to tune the level of uncertainty or the source of uncertainty that best suits applications.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

24th international conference on logic programming, ICLP 2008

24th International Conference on Logic Programming, ICLP 200...

引用

24th international conference on logic programming, ICLP 2008

ISBN: (纸本)9783540899815

the proceedings contain 90 papers. the special focus in this conference is on Foundations, Developments, and Applications in the Area of logic programming. the topics include: the life of a logic programming system;uniting the prolog community;constraint handling rules;authorization and obligation policies in dynamic systems;a tour from theory and research to applications and market;using answer set programming for knowledge representation and reasoning;building a knowledge base system for an integration of logic programming and classical logic;answer set programming without unstratified negation;equivalences in answer-set programming by countermodels in the logic of here-and-there;dynamic programming algorithms as products of weighted logic programs;detecting inconsistencies in large biological networks with answer set programming;a logic programming approach to home monitoring for risk prevention in assisted living;automatic composition of melodic and harmonic music by answer set programming;on the continuity of gelfond-lifschitz operator and other applications of proof-theory in asp;a declarative theorem prover for first-order classical logic;towards ludics programming: interactive proof search;a folding algorithm for eliminating existential variables from constraint logic programs;dynamic analysis of bounds versus domain propagation;compiling fuzzy answer set programs to fuzzy propositional theories;partial functions and equality in answer set programming;composing normal programs with function symbols;verification from declarative specifications using logic programming;transactions in constraint handling rules;an implementation of ACD term rewriting and quantified equilibrium logic and foundations for answer set programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

reasoning about agent deliberation

Reasoning about agent deliberation

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Alechina, N. Dastani, M. Logan, B.S. Meyer, J.-J.Ch. School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom Deparment of Information and Computing Sciences Universiteit Utrecht 3584CH Utrecht Netherlands

ISBN: (纸本)9781577353843

We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL designed for the implementation of cognitive agents with beliefs, goals and plans. the logics are variants of PDL, and allow us to prove safety and liveness properties of SimpleAPL agent programs under different deliberation strategies. We show how to axiomatize different deliberation strategies for SimpleAPL programs, and, for each strategy we consider, prove a correspondence between the operational semantics of SimpleAPL and the models of the corresponding logic. We illustrate the utility of our approach with an example in which we show how to verify correctness properties for a simple agent program under different deliberation strategies. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

the life of a logic programming system

The life of a logic programming system

引用

24th international conference on logic programming, ICLP 2008

作者： Santos Costa, Vítor DCC-FCUP CRACS University of Porto Portugal

ISBN: (纸本)3540899812

logic programming and the Prolog language have a major role in Computing. Prolog, and its derived languages, have been widely used in a impressive variety of application domains. thus, a bit of the history of logic programming reflects in the history of systems such as Dec-10 Prolog [32], M-Prolog [15], C-Prolog [19], Quintus Prolog [20], SICStus Prolog [6], BIM-Prolog [17], ECLiPSe [1], BinProlog [30], SWI-Prolog [34], CIAO [14], and B-Prolog [35], to mention but a few. I briefly present the evolution of one such system, YAP, and present a personal perspective on the challenges ahead for YAP (and for logic programming). © 2008 Springer Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Notions of strong equivalence for logic programs with ordered disjunction

Notions of strong equivalence for logic programs with ordere...

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Faber, Wolfgang Tompits, Hans Woltran, Stefan Department of Mathematics University of Calabria Via P. Bucci cubo 30b 87036 Rende CS Italy Institut für Informationssysteme 184/3 Technische Universität Wien Favoritenstrasse 9-11 A-1040 Vienna Austria Institut für Informationssysteme 184/2 Technische Universität Wien Favoritenstrasse 9-11 A-1040 Vienna Austria

ISBN: (纸本)9781577353843

Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. the semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard answer-set programming the question of when a program is to be considered equivalent to another received increasing attention in recent years, this problem has not been addressed for programs with ordered disjunctions so far. In this paper, we discuss the concept of strong equivalence in this setting. We introduce different versions of strong equivalence for programs with ordered disjunctions and provide model-theoretic characterisations, extending well-known ones for strong equivalence between ordinary logic programs. Furthermore, we discuss the relationships between the proposed notions and study their computational complexity. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Separation logic tutorial

Separation logic tutorial

引用

24th international conference on logic programming, ICLP 2008

作者： O’Hearn, Peter Queen Mary Univ. of London United Kingdom

ISBN: (纸本)9783540899815

Separation logic is an extension of Hoare's logic for reasoning about programs that manipulate pointers. It is based on the separating conjunction P∈∈Q, which asserts that P and Q hold for separate portions of computer memory. this tutorial on separation logic has three parts. 1 Basics. Concentrating on highlights from the early work [1,2,3,4]. 1 Model theory. the model theory of separation logic evolved from the general resource models of bunched logic [5,6,7] and includes an account of program dynamics in terms of their interaction with resource [8,9]. 1 Proof theory. I will describe those aspects of the proof theory, particularly new entailment questions (frame and anti-frame inference [10,11]), which are important for applications in mechanized program verification. © 2008 Springer Berlin Heidelberg.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Computing of p-stable models based on semi-negative normal programs with constraints

Computing of p-stable models based on semi-negative normal p...

引用

9th Mexican international conference on Computer Science

作者： Zepeda, Claudia Luis Carballido, Jose Benemerita Univ Autonoma Puebla Fac Ciencias Computac Ciudad UnivCol San Manuel Puebla Pue Mexico Univ Politecn Puebla Puebla Mexico

ISBN: (纸本)9780769534398

Currently non-monotonic reasoning (NMR) is a promising approach to model features of common sense reasoning. In order to formalize NMR the research community has applied monotonic logics. the present paper furthers the study of one of the semantics useful in this formalization called p-stable. We introduce three different formats for normal programs with constraints: Negative normal programs, Restricted negative normal programs and Semi-Negative normal programs. these forms help to simplify the search of p-stable models of the original program. One of the main results of this paper indicates that the p-stable semantics for semi-negative normal programs with constraints agrees with the Comp semantics. In this way all the applications based on the Comp, semantics of semi-negative programs can also be based on p-stable semantics of this type of programs. It is worth to mention that this class of programs can express interesting problems as the 3-coloring problem.

关键词： logic programming p-stable semantics stable semantics Clark's completion

来源：评论

学校读者我要写书评

暂无评论

Algebra of programming using dependent types

Algebra of programming using dependent types

引用

9th international conference on Mathematics of Program Construction, MPC 2008

作者： Mu, Shin-Cheng Ko, Hsiang-Shang Jansson, Patrik Institute of Information Science Academia Sinica Taiwan Department of Computer Science and Information Engineering National Taiwan University Taiwan Department of Computer Science and Engineering Chalmers University of Technology University of Gothenburg Sweden

ISBN: (纸本)3540705937

Dependent type theory is rich enough to express that a program satisfies an input/output relational specification, but it could be hard to construct the proof term. On the other hand, squiggolists know very well how to show that one relation is included in another by algebraic reasoning. We demonstrate how to encode functional and relational derivations in a dependently typed programming language. A program is coupled with an algebraic derivation from a specification, whose correctness is guaranteed by the type system. © 2008 Springer-Verlag.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

the System BioC for reasoning about Biological Models in Action Language C

The System BioC for Reasoning about Biological Models in Act...

引用

international conference on Tools for artificial intelligence (ICTAI)

作者： Steve Dworschak Torsten Grote Arne König Torsten Schaub Philippe Veber Institut für Informatik Universität Postdam Potsdam Brandenburg Germany

We elaborate upon the usage of action language C for representing and reasoning about biological models. First, we provide a simple extension of C allowing for variables and show its usefulness in modeling biochemical reactions according to the well-known model of BIOCHAM. Second, we show how the biological action description language C TAID can be mapped onto C. Finally, we describe a toolbox for using action languages, including among them, a compiler mapping C and C TAID to logic programs under answer sets semantics along with a Web-service integrating different front- and back-ends for addressing dynamical systems by means of action description languages via answer set programming. this is accompanied by an empirical evaluation with existing systems for processing action description languages.

关键词： Biological system modeling logic programming Application specific processors Reactive power Program processors Dynamic programming artificial intelligence Natural languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 84 85 86 87 88 89 90 91 92 93 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：