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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

254 篇 会议
24 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 230 篇 计算机科学与技术...
- 146 篇 软件工程
- 11 篇 电气工程
- 9 篇 控制科学与工程
- 8 篇 信息与通信工程
- 3 篇 建筑学
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
77 篇 理学
- 73 篇 数学
- 6 篇 统计学（可授理学、...
- 2 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
11 篇 管理学
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
3 篇 医学
- 3 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 法学
1 篇 军事学
- 1 篇 军队指挥学

主题

60 篇 logic programmin...
34 篇 answer set progr...
18 篇 non-monotonic re...
15 篇 knowledge repres...
9 篇 semantics
7 篇 inductive logic ...
6 篇 computer circuit...
5 篇 fuzzy logic
5 篇 formal logic
5 篇 programming
4 篇 belief revision
4 篇 epistemic logic ...
4 篇 non-monotonic lo...
4 篇 model checking
4 篇 ontologies
4 篇 defeasible logic
4 篇 knowledge repres...
4 篇 machine learning
3 篇 equilibrium logi...
3 篇 abduction

机构

9 篇 univ potsdam pot...
6 篇 univ calabria ar...
5 篇 univ a coruna la...
4 篇 new mexico state...
4 篇 vrije univ bruss...
4 篇 imperial coll lo...
4 篇 univ milano bico...
4 篇 univ angers leri...
3 篇 tu wien austria
3 篇 univ genoa dibri...
3 篇 univ calabria de...
3 篇 vienna univ tech...
3 篇 tech univ dresde...
2 篇 university of ma...
2 篇 univ torino dipa...
2 篇 katholieke univ ...
2 篇 univ calabria di...
2 篇 univ hasselt has...
2 篇 univ politecn ma...
2 篇 univ ferrara dip...

作者

16 篇 ricca francesco
9 篇 cabalar pedro
8 篇 alviano mario
7 篇 fandinno jorge
6 篇 schaub torsten
6 篇 maratea marco
5 篇 maher michael j.
5 篇 gebser martin
4 篇 eiter thomas
4 篇 son tran cao
3 篇 akbar siami nami...
3 篇 governatori guid...
3 篇 gaggl sarah alic...
3 篇 perez gilberto
3 篇 riguzzi fabrizio
3 篇 penaloza rafael
3 篇 formisano andrea
3 篇 aguado felicidad
3 篇 russo alessandra
3 篇 ielo antonio

语言

282 篇 英文

检索条件"任意字段=17th International Conference on Logic Programming and Non-monotonic Reasoning"

共 282 条记录，以下是201-210 订阅

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

详细简洁

排序：

Synthesis of multi-level pipelines for programmable logic devices

Synthesis of multi-level pipelines for programmable logic de...

引用

2010 17th international conference on Telecommunications, ICT 2010

作者： Damaj, Issam Division of Sciences and Engineering American University of Kuwait P.O. Box 3323 Safat 13034 Kuwait

ISBN: (纸本)9781424452477

Recently, hardware and software engineers have been showing considerable attention to high-level parallelization and hardware synthesis methodologies. State-of-the-art approaches have benefited from the emergence of modern highdensity Field Programmable Gate Arrays. In this paper, we explore the effectiveness of a formal methodology in the design of pipelined versions of a matrix multiplication algorithm. the suggested methodology adopts a functional programming notation for specifying algorithms and for reasoning about them. the parallel behavior of the specification is then derived and mapped onto hardware. Several pipelined implementations are developed with different performance characteristics. the refined designs are tested under Agility's RC-1000 reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance analysis and evaluation of the proposed implementations are presented in comparison with an Intel Core 2 DUO processor. © 2009 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Robust Task Execution through Experience-based Guidance for Cognitive Robots 17

Robust Task Execution Through Experience-based Guidance for ...

引用

international conference on Advanced Robotics (ICAR)

作者： Sariel, Sanem Yildiz, Petek Karapinar, Sertac Altan, Dogan Kapotoglu, Melis Istanbul Tech Univ Artificial Intelligence & Robot Lab Istanbul Turkey

ISBN: (纸本)9781467375092

Robustness in task execution requires tight integration of continual planning, monitoring, reasoning and learning processes. In this paper, we investigate how robustness can be ensured by learning from experience. Our approach is based on a learning guided planning process for a robot that gains its experience from action execution failures through lifelong experiential learning. Inductive logic programming (ILP) is used as the learning method to frame hypotheses for failure situations. It provides first-order logic representation of the robot's experience. the robot uses this experience to construct heuristics to guide its future decisions. the performance of the learning guided planning process is analyzed on our Pioneer 3-AT robot. the results reveal that the hypotheses framed for failure cases are sound and ensure safety and robustness in future tasks of the robot.

关键词： Robot Task execution experience CASING FAILURE Robustness inductive logic programming Learning methods Learning processes Planning process Heuristics

来源：评论

学校读者我要写书评

暂无评论

Is logic really dead or only just sleeping? 17

引用

17th international conference on logic programming, ICLP 2001

作者： Kowalski, Robert Department of Computing Imperial College London United Kingdom

ISBN: (纸本)9783540429357

there was a time when logic was the dominant paradigm for human reasoning. As George Boole put it around one hundred and fifty years ago,logic was synonymous with the “Laws of thought”. Later, for most of the latter half of the twentieth century,it was the mainstream of Artificial Intelligence. But then it all went wrong. Artificial Intelligence researchers, frustrated by the lack of progress, blamed many of their problems on the logic-based approach. they argued that humans do not reason logically, and therefore machines should not be designed to reason logically either. Other approaches began to make progress where logic was judged to have failed - approaches that were designed to simulate directly the neurological mechanisms of animal and human intelligence. Insect-like robots began to appear,and the beginning of a new Machine Intelligence was born. logic seemed to be dieing - and to be taking logic programming (LP) with it.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A System for Explainable Answer Set programming 36

A System for Explainable Answer Set Programming

引用

36th international conference on logic programming (ICLP)

作者： Cabalar, Pedro Fandinno, Jorge Muniz, Brais Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany

We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. these annotations allow tracing the application of rules or the atoms derived by them. the input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver. xclingo translates the annotations into additional predicates and rules and uses the ASP solver clingo to obtain the extension of those auxiliary predicates. this information is used afterwards to construct derivation trees containing textual explanations. the language allows selecting which atoms to explain and, in its turn, which atoms or rules to include in those explanations. We illustrate the basic features through a diagnosis problem from the literature.

关键词： Answer Set programming Causal justifications non-monotonic reasoning ASP debugging Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strategy 16th

Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade ...

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Boehl, Elisa Gaggl, Sarah Alice Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany

ISBN: (纸本)9783031157073;9783031157066

Answer set programming (ASP) solvers have advanced in recent years, with a variety of different specialisation and overall development. thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process, the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. the core idea is to collect diverse answer sets one after another by iteratively solving and updating the program. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. the evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.

关键词： multi-shot answer set programming navigation diverse answer sets

来源：评论

学校读者我要写书评

暂无评论

Improving Safety in Collaborative Robot Tasks 17

Improving Safety in Collaborative Robot Tasks

引用

17th IEEE international conference on Industrial Informatics (INDIN)

作者： Mandal, Avijit Sharma, Divyasheel Sukhwani, Mohak Jetley, Raoul Sarkar, Santonu ABB Bangalore Karnataka India BITS Pilani Sancoale Goa India

ISBN: (纸本)9781728129273

In recent times, there has been significant interest in collaborative robots where the tasks performed by a robot are non-repetitive and complex, and humans and robots share an overlapping workspace. In such a case, the robot controller must necessarily be safety-aware. In this paper, we propose a mechanism to evaluate a robot program and compute a safety score for each action that the robot is about to perform. To this end, we have implemented a code analyzer that examines the robot's Move instructions and assigns a safety score. A subjective logic based approach is used to compute the safety score for each instruction. We have evaluated the approach through ABB's RobotStudio (R) simulator. We simulate two scenarios: First, where two robots share a workspace and second, where a robot moves along a path with an obstacle. the simulations show that using our code analyzer and safety score formalism;it is possible to evaluate the application code for safety and enable avoidance of potentially unsafe behavior.

关键词： Safety Human-Robot Co-operation RAPID programming Collaborative Robots Subjective logic

来源：评论

学校读者我要写书评

暂无评论

State Transition in Multi-agent Epistemic Domains Using Answer Set programming 16th

State Transition in Multi-agent Epistemic Domains Using Answ...

引用

16th international conference on logic programming and non-monotonic reasoning (LPNMR)

作者： Izmirlioglu, Yusuf Pham, Loc Son, Tran Cao Pontelli, Enrico New Mexico State Univ Las Cruces NM 88003 USA

ISBN: (纸本)9783031157073;9783031157066

In this paper we develop a state transition function for partially observable multi-agent epistemic domains and implement it using Answer Set programming (ASP). the transition function computes the next state upon an occurrence of a single action. thus it can be used as a module in epistemic planners. Our transition function incorporates ontic, sensing and announcement actions and allows for arbitrary nested belief formulae and general common knowledge. A novel feature of our model is that upon an action occurrence, an observing agent corrects his (possibly wrong) initial beliefs about action precondition and his observability. By examples, we show that this step is necessary for robust state transition. We establish some properties of our state transition function regarding its soundness in updating beliefs of agents consistent with their observability.

关键词： Answer Set programming Multi-agent systems Epistemic planning State transition

来源：评论

学校读者我要写书评

暂无评论

Default reasoning with a constraint resolution principle 4th

引用

4th international conference on logic programming and Automated reasoning, LPAR 1993

作者： Panitz, Sven Eric Künstliche Intelligenz/Softwaretechnologie Johann Wolfgang Goethe-Universität Fachbereich 20 Postfach 11 19 32 Frankfurt am Main 1160054 Germany

ISBN: (纸本)9783540569442

Common non-monotonic deduction systems such as Reiters default logic or inheritance networks must handle the multiple extension problem, i.e. generally they have distinct consistent sets of conclusions (extensions) which can be drawn from a theory. Most of these systems do not provide any control structure that helps to determine in which of these extensions inferences are made. Default proof theories are in most cases only able to prove if a sentence is in at least one extension. We create a resolution based system for default reasoning where an explicit control set can be built during reasoning and where default assumptions made in a deduction are remembered as constraints. the resulting system is a cumulative default logic which assures an even stricter cumulativity than Brewka’s Cumulative Default logic and is strong enough to express Poole’s Framework for default reasoning. It turns out that the created system ranges from the logic with restricted quantifiers of H.J.Bürckert via Reiter’s default logic to the logic of theory change of Gärdenfors. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

reasoning about Measures of Unmeasurable Sets 17

Reasoning about Measures of Unmeasurable Sets

引用

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

作者： Console, Marco Hofer, Matthias Libkin, Leonid Univ Edinburgh Edinburgh Midlothian Scotland ENS Paris PSL Paris France Neo4j San Mateo CA USA

ISBN: (纸本)9780999241172

In a variety of reasoning tasks, one estimates the likelihood of events by means of volumes of sets they define. Such sets need to be measurable, which is usually achieved by putting bounds, sometimes ad hoc, on them. We address the question how unbounded or unmeasurable sets can be measured nonetheless. Intuitively, we want to know how likely a randomly chosen point is to be in a given set, even in the absence of a uniform distribution over the entire space. To address this, we follow a recently proposed approach of taking intersection of a set with balls of increasing radius, and defining the measure by means of the asymptotic behavior of the proportion of such balls taken by the set. We show that this approach works for every set definable in first-order logic with the usual arithmetic over the reals (addition, multiplication, exponentiation, etc.), and every uniform measure over the space, of which the usual Lebesgue measure (area, volume, etc.) is an example. In fact we establish a correspondence between the good asymptotic behavior and the finiteness of the VC dimension of definable families of sets. Towards computing the measure thus defined, we show how to avoid the asymptotics and characterize it via a specific subset of the unit sphere. Using definability of this set, and known techniques for sampling from the unit sphere, we give two algorithms for estimating our measure of unbounded unmeasurable sets, with deterministic and probabilistic guarantees, the latter being more efficient. Finally we show that a discrete analog of this measure exists and is similarly well-behaved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Computational logic — CL 2000 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： John Lloyd Veronica Dahl Ulrich Furbach Manfred Kerber Kung-Kiu Lau Catuscia Palamidessi Luís Moniz Pereira Yehoshua Sagiv Peter J. Stuckey

ISBN: (数字)9783540449577

ISBN: (纸本)9783540677970

these are the proceedings of the First international conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. the theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. the conference was collocated with the following events: { 6th international conference on Rules and Objects in Databases (DOOD 2000) { 10th international Workshop on logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th international conference on Inductive logic programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { logic programming: theory and Extensions { Constraints { Automated Deduction: Putting theory into Practice { Knowledge Representation and non-monotonic reasoning { Database Systems (DOOD 2000) { logic programming: Implementations and Applications. the LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. the acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream.

关键词： Artificial Intelligence Software Engineering/programming and Operating Systems Computer System Implementation Mathematical logic and Formal Languages logics and Meanings of Programs programming Techniques

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：