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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

195 篇 会议
14 册 图书
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

153 篇 工学
- 134 篇 计算机科学与技术...
- 89 篇 软件工程
- 18 篇 电气工程
- 11 篇 控制科学与工程
- 5 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 机械工程
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 测绘科学与技术
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 石油与天然气工程
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 食品科学与工程（可...
- 1 篇 生物工程
49 篇 理学
- 46 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 6 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 教育学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 法学
1 篇 医学
- 1 篇 临床医学

主题

43 篇 logic programmin...
10 篇 mathematical log...
10 篇 probabilistic lo...
9 篇 fuzzy logic
9 篇 software enginee...
9 篇 logic gates
8 篇 computer circuit...
8 篇 semantics
7 篇 linear programmi...
7 篇 programming lang...
7 篇 artificial intel...
7 篇 logics and meani...
6 篇 optimization
6 篇 logic
5 篇 formal logic
5 篇 inductive logic ...
5 篇 knowledge repres...
4 篇 computer science
4 篇 programming
4 篇 application soft...

机构

2 篇 university of ma...
2 篇 univ london impe...
2 篇 institute of log...
2 篇 cornell univ dep...
2 篇 institute of mic...
2 篇 simon fraser uni...
2 篇 vienna univ tech...
2 篇 univ southampton...
2 篇 istanbul tech un...
2 篇 univ milano bico...
1 篇 osaka prefecture...
1 篇 national institu...
1 篇 system and softw...
1 篇 univ karlsruhe t...
1 篇 iit delhi dept c...
1 篇 dept. mathematic...
1 篇 univ bologna dei...
1 篇 univ wisconsin d...
1 篇 xidian univ inst...
1 篇 key laboratory o...

作者

4 篇 schaub torsten
4 篇 tompits hans
3 篇 muggleton stephe...
3 篇 riguzzi fabrizio
3 篇 woltran stefan
3 篇 lamma evelina
2 篇 neves mariana
2 篇 ternovska eugeni...
2 篇 gomes guida
2 篇 santos jose
2 篇 akira notsu
2 篇 penaloza rafael
2 篇 seiki ubukata
2 篇 voronkov andrei
2 篇 potena domenico
2 篇 storti emanuele
2 篇 olivetti nicola
2 篇 katsuhiro honda
2 篇 fadja arnaud ngu...
2 篇 de giacomo giuse...

语言

215 篇 英文
1 篇 其他
1 篇 中文

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

共 217 条记录，以下是71-80 订阅

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

详细简洁

排序：

Merging logic Programs under Answer Set Semantics

Merging Logic Programs under Answer Set Semantics

引用

25th international conference on logic programming (iclp)

作者： Delgrande, James Schaub, Torsten Tompits, Hans Woltran, Stefan Simon Fraser Univ Burnaby BC V5A 1S6 Canada Univ Potsdam D-14482 Potsdam Germany Tech Univ Wien A-1040 Vienna Austria Griffith Univ Nathan Qld Australia

ISBN: (纸本)9783642028458

this paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P-1,...,P-n, the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. the first informally selects those models of the programs that vary the least from the models of the other programs. the second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. P-0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the rnergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.

关键词： answer set programming belief merging strong equivalence

来源：评论

学校读者我要写书评

暂无评论

Applications of Declarative programming and Knowledge Management 2009

引用

丛书名： Lecture Notes in Computer Science

2009年

作者： Dietmar Seipel Michael Hanus Armin Wolf

来源：评论

学校读者我要写书评

暂无评论

Superficially Substructural Types 12

Superficially Substructural Types

引用

17th ACM SIGPLAN international conference on Functional programming

作者： Krishnaswami, Neelakantan R. Turon, Aaron Dreyer, Derek Garg, Deepak Northeastern Univ Boston MA USA

ISBN: (纸本)9781450310543

Many substructural type systems have been proposed for controlling access to shared state in higher-order languages. Central to these systems is the notion of a resource, which may be split into disjoint pieces that different parts of a program can manipulate independently without worrying about interfering with one another. Some systems support a logical notion of resource (such as permissions), under which two resources may be considered disjoint even if they govern the same piece of state. However, in nearly all existing systems, the notions of resource and disjointness are fixed at the outset, baked into the model of the language, and fairly coarse-grained in the kinds of sharing they enable. In this paper, inspired by recent work on "fictional disjointness" in separation logic, we propose a simple and flexible way of enabling any module in a program to create its own custom type of splittable resource (represented as a commutative monoid), thus providing fine-grained control over how the module's private state is shared with its clients. this functionality can be incorporated into an otherwise standard substructural type system by means of a new typing rule we call the sharing rule, whose soundness we prove semantically via a novel resource-oriented Kripke logical relation.

关键词： Languages Design theory Verification Substructural type systems separation logic sharing rule commutative monoids fictional disjointness ADTs hidden state dependent types capabilities Kripke logical relations

来源：评论

学校读者我要写书评

暂无评论

A First-Order logic of Limited Belief Based on Possible Worlds 17

A First-Order Logic of Limited Belief Based on Possible Worl...

引用

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

作者： Lakemeyer, Gerhard Levesque, Hector J. Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Univ Toronto Dept Comp Sci Toronto ON Canada

ISBN: (纸本)9780999241172

In a recent paper Lakemeyer and Levesque proposed a first-order logic of limited belief to characterize the beliefs of a knowledge base (KB). Among other things, they show that their model of belief is expressive, eventually complete, and tractable. this means, roughly, that a KB may consist of arbitrary first-order sentences, that any sentence which is logically entailed by the KB is eventually believed, given enough reasoning effort, and that reasoning is tractable under reasonable assumptions. One downside of the proposal is that epistemic states are defined in terms of sets of clauses, possibly containing variables, giving the logic a distinct syntactic flavour compared to the more traditional possible-world semantics found in the literature on epistemic logic. In this paper we show that the same properties as above can be obtained by defining epistemic states as sets of three-valued possible worlds. this way we are able to shed new light on those properties by recasting them using the more familiar notion of truth over possible worlds.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Human and Unhuman Commonsense Reasoning 17th

Human and Unhuman Commonsense Reasoning

引用

17th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Maher, Michael J. NICTA Sydney NSW Australia

ISBN: (纸本)9783642162411

Ford has introduced a non-monotonic logic, System LS, inspired by an empirical study of human non-monotonic reasoning. We define here a defeasible logic FDL based on Ford's logic, and in doing so identify some similarities and differences between Ford's logic and existing defeasible logics. Several technical results about FDL are established, including its inference strength in relation to other defeasible logics.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Comingle: Distributed logic programming for Decentralized Mobile Ensembles 17th

Comingle: Distributed Logic Programming for Decentralized Mo...

引用

17th IFIP WG 6.1 international conference on Coordination Models and Languages (COORDINATION) Held as Part of the 10th international Federated conference on Distributed Computing Techniques (DisCoTec)

作者： Lam, Edmund Soon Lee Cervesato, Iliano Fatima, Nabeeha Univ Pittsburgh Carnegie Mellon Univ Pittsburgh PA 15260 USA

ISBN: (纸本)9783319192826;9783319192819

Comingle is a logic programming framework aimed at simplifying the development of applications distributed over multiple mobile devices. Applications are written as a single declarative program (in a system-centric way) rather than in the traditional node-centric manner, where separate communicating code is written for each participating node. Comingle is based on committed-choice multiset rewriting and is founded on linear logic. We describe a prototype targeting the Android operating system and illustrate how Comingle is used to program distributed mobile applications. As a proof of concept, we discuss several such applications orchestrated using Comingle.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Control Synthesis of Energy Harvesting MEMS Devices with Load-based Spectral logic Specifications 17

Control Synthesis of Energy Harvesting MEMS Devices with Loa...

引用

IEEE 17th international conference on Control and Automation (ICCA)

作者： Chen, Gang Lu, Yu Su, Rong South China Univ Technol Shien Ming Wu Sch Intelligent Engn Guangzhou 511442 Peoples R China Nanjing Univ Sci & Technol Sch Energy & Power Engn Nanjing 210094 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (数字)9781665495721

ISBN: (纸本)9781665495721

this paper studies the control synthesis problem for energy harvesting MEMS devices with load-based spectral logic specifications. Firstly, a novel formal language has been proposed to define the specifications on frequency domain with respect to load, called load-based spectral logic. the conditions for specification satisfaction have been derived for the energy harvesting MEMS devices, which transform the formal specification constraints into a set of linear matrix inequalities. then an iterative control synthesis algorithm has been proposed to find a sequence of static output feedback controllers for the MEMS device, in which the control synthesis problem has been transformed into a sequence of semidefinite programming problems. Finally, a numerical example is provided to illustrate the main results of this paper.

关键词： Micromechanical devices Frequency-domain analysis Formal languages Transforms Iterative algorithms Convex functions Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

DATALOG with constraints - an answer-set programming system 17

DATALOG with constraints - an answer-set programming system

引用

17th National conference on Artificial Intelligence (AAAI-2000)/12th conference on Innovative Applications of Artificial Intelligence (IAAI-2000)

作者： East, D Truszczynski, M Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

ISBN: (纸本)0262511126

Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem constraints. However, for some applications, especially those requiring that transitive closure be computed, it requires additional variables and results in large theories. Consequently, it may not be a practical computational tool for such problems. On the other hand, ASP systems based on nonmonotonic logics, such as stable logic programming, can handle transitive closure computation efficiently and, in general, yield very concise theories as problem representations. their semantics is, however, more complex. Searching for the middle ground, in this paper we introduce a new nonmonotonic logic, DATALOG with constraints or DC. Informally DC theories consist of propositional clauses (constraints) and of Horn rules. the semantics is a simple and natural extension of the semantics of the propositional logic. However, thanks to the presence of Horn rules in the system, modeling of transitive closure becomes straightforward. We describe the syntax and semantics of DC, and study its properties. We discuss an implementation of DC and present results of experimental study of the effectiveness of DC, comparing it with the csat satisfiability checker and smodels implementation of stable logic programming. Our results show that DC is competitive with the other two approaches, in case of many search problems, often yielding much more efficient solutions.

关键词： constraint saitsfaction knowledge representation logic programming nonmonotonic reasoning search

来源：评论

学校读者我要写书评

暂无评论

ParaLog_e: A paraconsistent evidential logic programming language

ParaLog_e: A paraconsistent evidential logic programming lan...

引用

Proceedings of the 1997 17th international conference of the Chilean Computer Science Society

作者： Coelho Avila, Braulio Minoro Abe, Jair Pacheco de Almeida Prado, Jose Pontifical Catholic Univ of Parana/UEPG/IEA Curitiba Brazil

Inconsistency is a natural phenomenon arising from the description of the real world. this phenomenon may be encountered in several situations. Nevertheless, human beings are capable of reasoning adequately. the automation of such reasoning requires the development of formal theories. Paraconsistent logic was proposed by N.C.A. da Costa to provide tools to reason about inconsistencies. this paper describes an extension of the ParaLog logic programming Language, called ParaLoge that allows direct handling of inconsistency. Languages such as ParaLoge, capable of merging Classical logic programming concepts with those of inconsistency, widen the scope of logic programming applications in environments presenting conflicting beliefs and contradictory information.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：