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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

182 篇 会议
14 册 图书
11 篇 期刊文献

馆藏范围

206 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

149 篇 工学
- 138 篇 计算机科学与技术...
- 63 篇 软件工程
- 35 篇 电气工程
- 13 篇 控制科学与工程
- 4 篇 信息与通信工程
- 4 篇 生物工程
- 3 篇 生物医学工程（可授...
- 2 篇 化学工程与技术
- 2 篇 交通运输工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 安全科学与工程
27 篇 理学
- 21 篇 数学
- 5 篇 生物学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
8 篇 管理学
- 7 篇 管理科学与工程(可...
- 4 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 文学
- 1 篇 外国语言文学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

49 篇 logic programmin...
13 篇 fuzzy logic
12 篇 mathematical log...
11 篇 programming
11 篇 artificial intel...
10 篇 formal logic
8 篇 programming lang...
7 篇 software enginee...
7 篇 logics and meani...
6 篇 programming tech...
6 篇 probabilistic lo...
5 篇 computer science
5 篇 logic gates
5 篇 semantics
4 篇 programming prof...
4 篇 constraint logic...
4 篇 application soft...
4 篇 kripke logical r...
4 篇 mathematical mod...
4 篇 algorithm analys...

机构

3 篇 univ kentucky de...
2 篇 industrial softw...
2 篇 max planck inst ...
2 篇 vienna univ tech...
2 篇 univ cyprus dept...
2 篇 institute of log...
2 篇 ben gurion univ ...
2 篇 imdea software i...
2 篇 international in...
2 篇 aarhus univ dk-8...
2 篇 wakayama univ de...
2 篇 michigan state u...
2 篇 kings coll londo...
1 篇 mpi informat d-6...
1 篇 transmeta corpor...
1 篇 inria
1 篇 ist austria klos...
1 篇 kielce univ tech...
1 篇 vig impex craiov...
1 篇 department of ma...

作者

4 篇 eiter thomas
3 篇 truszczynski mir...
3 篇 dimopoulos y
2 篇 egly uwe
2 篇 sarna-starosta b...
2 篇 stepanova daria
2 篇 woltran stefan
2 篇 dillon laura k.
2 篇 birkedal lars
2 篇 chlipala adam
2 篇 andrei voronkov
2 篇 dreyer derek
2 篇 turon aaron
2 篇 brewka gerhard
2 篇 kyaw myat thu
2 篇 myo thet naung
2 篇 brafman ri
2 篇 stirewalt r. e. ...
2 篇 krishnaswami nee...
1 篇 miller r

语言

202 篇 英文
4 篇 其他
1 篇 中文

检索条件"任意字段=18th International Conference on Logic Programming, ICLP 2002"

共 207 条记录，以下是41-50 订阅

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

详细简洁

排序：

Distributed logic programming using mobile agents

Distributed logic programming using mobile agents

引用

18th international conference on Advanced Information Networking and Applications

作者： Wang, TI Clark, KL Natl Cheng Kung Univ Dept Engn Sci Tainan 70101 Taiwan

ISBN: (纸本)0769520510

this paper(1) describes the use of mobile agent technologies in building a framework for supporting distributed logic programming and remote conditional querying. A mobile agent moves front server to server carrying its own knowledge. When it arrives at a server it is given read access to the some part of the server's knowledge base. It then answers its queries using the server's knowledge and its own, adding the results to its own knowledge. We can view the mobile agent's queries as conditional remote queries what answers would the server give if the knowledge carried by the agent were added to the server. To implement a prototype framework of mobile agents and knowledge servers we have used a new multi-paradigm and multi-threaded programming language Go!. this supports mobile agent's as knowledge objects and has powerful knowledge structuring features. the paper assumes some familiarity with Prolog.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Reducts of Propositional theories, Satisfiability Relations, and Generalizations of Semantics of logic Programs

Reducts of Propositional Theories, Satisfiability Relations,...

引用

25th international conference on logic programming (iclp)

作者： Truszczynski, Miroslaw Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

ISBN: (纸本)9783642028458

Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stable-model semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which seems to be essentially different. Our goal is to explain the relationship between the two semantics. Pearce, Ferraris and Lifschitz's extension of the stable-model semantics is best viewed in the setting of arbitrary propositional theories. We propose an extension of the Faber-Leone-Pfeifer semantics, or FLP semantics, for short, to the full propositional language, which reveals both common threads and differences between the FLP and stable-model semantics. We establish several properties of the FLP semantics. We apply a similar approach to define supported models for arbitrary propositional theories.

关键词： Stable models answer-set programming logic here-and-there

来源：评论

学校读者我要写书评

暂无评论

Embedding Fuzzy Controllers in Golog

Embedding Fuzzy Controllers in Golog

引用

18th IEEE international conference on Fuzzy Systems

作者： Ferrein, Alexander Schiffer, Stefan Lakemeyer, Gerhard Univ Cape Town Robot & Agents Res Lab ZA-7700 Rondebosch South Africa Rhein Westfal TH Aachen Knowledge Based Syst Grp Aachen Germany

ISBN: (纸本)9781424435968

High-level behaviour specification of an intelligent autonomous agent or robot is a non-trivial task. Various approaches exist some of which try to combine different paradigms like programming and planning. In this paper, we show how to integrate fuzzy logic controllers into the logic-based programming language Golog. Golog already allows for combining programming and planning. By adding the instrument of fuzzy controllers we provide the means to have a natural specification of rules for tasks that require a high amount of reactivity. Since the facilities already present in Golog remain, we add to an already powerful framework thus expanding the applicability of Golog for high-level behaviour specification of a robot or agent.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A Hoare-style proof system for robot programs

A Hoare-style proof system for robot programs

引用

18th National conference on Artificial Intelligence/14th conference on Innovative Applications of Artificial Intelligence

作者： Liu, YM Univ Toronto Dept Comp Sci Toronto ON M5G 3G4 Canada

ISBN: (纸本)0262511290

Golog is a situation calculus-based logic programming language for high-level robotic control. this paper explores Hoare's axiomatic approach to program verification in the Golog context. We present a novel Hoare-style proof system for partial, correctness of Golog programs. We prove total soundness of the proof system, and relative completeness of a subsystem of it for procedureless Golog programs. Examples are given to illustrate the use of the proof system.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Higher-Order Functional Reactive programming without Spacetime Leaks 13

Higher-Order Functional Reactive Programming without Spaceti...

引用

18th ACM SIGPLAN international conference on Functional programming

作者： Krishnaswami, Neelakantan R. Max Planck Inst Software Syst MPI SWS Saarbrucken Germany

ISBN: (纸本)9781450323260

Functional reactive programming (FRP) is an elegant approach to declaratively specify reactive systems. However, the powerful abstractions of FRP have historically made it difficult to predict and control the resource usage of programs written in this style. In this paper, we give a new language for higher-order reactive programming. Our language generalizes and simplifies prior type systems for reactive programming, by supporting the use of streams of streams, first-class functions, and higher-order operations. We also support many temporal operations beyond streams, such as terminatable streams, events, and even resumptions with first-class schedulers. Furthermore, our language supports an efficient implementation strategy permitting us to eagerly deallocate old values and statically rule out spacetime leaks, a notorious source of inefficiency in reactive programs. Furthermore, these memory guarantees are achieved without the use of a complex substructural type discipline. We also show that our implementation strategy of eager deallocation is safe, by showing the soundness of our type system with a novel step-indexed Kripke logical relation.

关键词： Functional reactive programming Kripke logical relations temporal logic guarded recursion dataflow capabilities comonads

来源：评论

学校读者我要写书评

暂无评论

On the automatic evolution of an OS kernel using temporal logic and AOP 03

On the automatic evolution of an OS kernel using temporal lo...

引用

18th IEEE international conference on Automated Software Engineering

作者： Åberg, RA Lawall, JL Südholt, M Muller, G Le Meur, AF INRIA Ecole Mines Nantes OBASCO Grp F-44307 Nantes 3 France

ISBN: (纸本)0769520359

Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. this task is particularly complicated when considering a large program, even when the modifications appear to be systematic. We illustrate this situation in the context of evolving the Linux kernel to support Bossa, an event-based framework for process-scheduler development. To support Bossa, events must be added at points scattered throughout the kernel. In each case, the choice of event depends on properties of one or a sequence of instructions. To describe precisely the choice of event, we propose to guide the event insertion by using a set of rules, amounting to an aspect, that describes the control-flow contexts in which each event should be generated. In this paper, we present our approach and describe the set of rules that allows proper event insertion. these rules use temporal logic to describe sequences of instructions that require events to be inserted. We also give an overview of an implementation that we have developed to automatically perform this evolution.

关键词： Kernel Automatic logic units Linux Scattering Contracts Protocols Operating systems programming profession Debugging Software engineering

来源：评论

学校读者我要写书评

暂无评论

Embedding defeasible logic into logic programs

引用

18th international conference on logic programming

作者： Antoniou, G Maher, MJ Univ Bremen Dept Comp Sci D-2800 Bremen 33 Germany Loyola Univ Dept Math & Comp Sci Chicago IL 60611 USA

ISBN: (纸本)3540439307

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of extended logic programs. In particular, we give a translation of a defeasible theory D into a program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D axe included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Experimental comparison of combination rules using simulated data

Experimental comparison of combination rules using simulated...

引用

18th international conference on Pattern Recognition (ICPR 2006)

作者： Zouari, Hela Heutte, Laurent Lecourtier, Yves Univ Rouen LITIS F-76800 St Etienne France

ISBN: (纸本)0769525210

In this paper, we report an experimental comparison between widely used combination rules, i.e. sum, product, maximum, borda count and best rank rules. We focus on the behavior of the considered combination rules for ensembles of classifiers exhibiting different performance of recognition. TO this end a simulation method using as input a specified performance matrix (i.e. recognition rates for each position of the true class and rejection rates) is proposed this simulator generates ensembles of classifier outputs with specified profiles of performance within their list of solutions. Our experimental results tend to show that these profiles of performance are one of the factors that affect the behavior of the combination rules.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Approximation Fixpoint theory for Non-Deterministic Operators and Its Application in Disjunctive logic programming 18

Approximation Fixpoint Theory for Non-Deterministic Operator...

引用

18th international conference on Principles of Knowledge Representation and Reasoning, KR 2021

作者： Heyninck, Jesse Arieli, Ofer Department of Computer Science TU Dortmund Germany University of Cape Town CAIR South Africa School of Computer Science Tel-Aviv Academic College Israel

ISBN: (纸本)9781956792997

Approximation fixpoint theory (AFT) constitutes an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic reasoning, such as logic programming, default logic and autoepistemic logic. In this paper we extend AFT to non-deterministic constructs such as disjunctive information. this is done by generalizing the main constructions and corresponding results to non-deterministic operators, whose ranges are sets of elements rather than single elements. the applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming. Copyright © 2021, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A three-valued characterization for strong equivalence of logic programs

A three-valued characterization for strong equivalence of lo...

引用

18th National conference on Artificial Intelligence/14th conference on Innovative Applications of Artificial Intelligence

作者： Cabalar, P Univ A Coruna Dept Comp Sci Corunna Spain

ISBN: (纸本)0262511290

In this work we present additional results, related to the property of strong equivalence of logic programs. this property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be simply reduced to. equivalence in the logic of Here-and-there (HT). In this paper we provide an alternative based on 3-valued logic, using also, as a first step, a classical logic charaterization. We show that the 3-valued encoding provides a direct interpretation for nested expressions but, when moving to an unrestricted syntax, it generally yields different results from HT.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：