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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

298 篇 会议
27 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

245 篇 工学
- 229 篇 计算机科学与技术...
- 117 篇 软件工程
- 19 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 信息与通信工程
- 6 篇 机械工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
53 篇 理学
- 39 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
- 2 篇 物理学
23 篇 管理学
- 14 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 经济学
- 3 篇 理论经济学
- 3 篇 应用经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 2 篇 社会学
1 篇 医学

主题

70 篇 logic programmin...
18 篇 inductive logic ...
15 篇 artificial intel...
12 篇 programming
12 篇 mathematical log...
11 篇 programming tech...
11 篇 logics and meani...
10 篇 software enginee...
10 篇 logic gates
10 篇 programming lang...
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 microsoft res re...
3 篇 univ paris 13 li...
3 篇 carnegie mellon ...
3 篇 aalto university...
3 篇 univ penn philad...
2 篇 univ wales dept ...
2 篇 stanford univ ct...
2 篇 politecn torino ...
2 篇 indian inst tech...
2 篇 univ freiburg in...
2 篇 univ wisconsin d...
2 篇 czech tech univ ...
2 篇 univ london impe...
2 篇 department of in...
2 篇 univ paris 13 li...
2 篇 harvard univ cam...
2 篇 columbia univ ct...
2 篇 ibm unternehmens...

作者

8 篇 gebser martin
6 篇 srinivasan ashwi...
6 篇 alphonse erick
5 篇 schaub torsten
5 篇 ricca francesco
4 篇 osmani aomar
4 篇 page david
4 篇 camacho rui
3 篇 yamamoto akihiro
3 篇 king ross
3 篇 rouveirol celine
3 篇 moreno gines
3 篇 leger hippolyte
3 篇 janhunen tomi
3 篇 maratea marco
3 篇 bouthinon domini...
3 篇 lebbah mustapha
2 篇 muggleton stephe...
2 篇 fronhöfer b
2 篇 khatibsyarbini

语言

332 篇 英文
7 篇 其他
5 篇 中文

检索条件"任意字段=13th International Conference on Inductive Logic Programming"

共 344 条记录，以下是151-160 订阅

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

详细简洁

排序：

Road Curb Detection using 3D Lidar and Integral Laser Points for Intelligent Vehicles

Road Curb Detection using 3D Lidar and Integral Laser Points...

引用

6th international conference on Soft Computing and Intelligent Systems (SCIS) / 13th international Symposium on Advanced Intelligence Systems (ISIS)

作者： Yao, Wentao Deng, Zhidong Zhou, Lipu Tsinghua Univ Dept Comp Sci & Technol Tsinghua Key Natl Lab Informat Sci & Technol State Key Lab Intelligent Technol & Syst Beijing 100084 Peoples R China

ISBN: (纸本)9781467327435;9781467327428

Road curb detection and tracking is essential for the autonomous driving of intelligent vehicles on highways and urban roads. In this paper, we present a fast and robust road curb detection algorithm using 3D lidar data and Integral Laser Points (ILP) features. Range and intensity data of the 3D lidar is decomposed into elevation data and data projected on the ground plane. First, left and right road curbs are detected for each scan line using the ground projected range and intensity data and line segment features. then, curb points of each scan line are determined using elevation data. the ILP features are proposed to speed up the both detection procedures. Finally, parabola model and RANSAC algorithm is used to fit the left and right curb points and generate vehicle controlling parameters. the proposed method and feature provide fast and reliable road curb detection speed and performance. Experiments show good results on various highways and urban roads under different situations.

关键词： scan line Intelligent vehicles Urban road Freeway Kerbstones Lidar inductive logic programming Road Line sections Fasting

来源：评论

学校读者我要写书评

暂无评论

Worst-case optimal reasoning with forest logic programs

Worst-case optimal reasoning with forest logic programs

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Feier, Cristina Institute of Information Systems Vienna University of Technology Favoritenstrasse 11 A-1040 Vienna Austria

ISBN: (纸本)9781577355601

the paper introduces a worst-case optimal tableau algorithm for reasoning with Forest logic Programs, a decidable fragment of Open Answer Set programming. FoLPs are a useful device for tight integration of the Description logic and the logic programming worlds: reasoning with the DL SHOQ can be simulated within the fragment. the algorithm reuses a knowledge compilation technique previously introduced, but improves on previous results by decreasing the worst-case running time with one exponential level. the decrease in complexity is due to the usage in conjunction of a new redundancy and of a new caching rule. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Automating Induction with an SMT Solver

引用

13th international conference on Verification, Model Checking, and Abstract Interpretation

作者： Leino, K. Rustan M. Microsoft Res Redmond WA USA

ISBN: (纸本)9783642279393;9783642279409

Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants. satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However. SMT solvers do not natively support induction, so inductive proofs require some encoding into the SMT solver's input. this paper shows a surprisingly simple tactic a rewriting strategy and a heuristic for when to apply it that has shown to be useful in verifying simple inductive theorems, like those that can occur during program verification. the paper describes the tactic and its implementation in a program verifier. and reports on the positive experience with using the tactic.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Answer set programming via mixed integer programming

Answer set programming via mixed integer programming

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Liu, Guohua Janhunen, Tomi Niemelä, Ilkka Aalto University School of Science Department of Information and Computer Science Finland

ISBN: (纸本)9781577355601

Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with another widely applied paradigm, viz. mixed integer programming. As a theoretical result, we establish translations from non-disjunctive logic programs to linear constraints used in mixed integer programming so that the solutions to the constraints correspond to the answer sets of the programs. these translations create the basis for an extended answer set programming language that includes linear constraints as a primitive and enables more compact encodings of problems. On a practical level, we have implemented a prototype system that computes answer sets using a state-of-the-art mixed integer programming solver. the reported experiments demonstrate the effectiveness of this approach applied to a number of optimization problems and problems with variables ranging over large domains. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Relational and Algebraic Methods in Computer Science - 13th international conference, RAMiCS 2012, Proceedings

Relational and Algebraic Methods in Computer Science - 13th ...

引用

13th international conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2012

ISBN: (纸本)9783642333132

the proceedings contain 23 papers. the topics discussed include: transitive separation logic;unifying lazy and strict computations;foundations of coloring algebra with consequences for feature-oriented programming;towards an algebra for real-time programs;automated reasoning in higher-order regular algebra;towards certifiable implementation of graph transformation via relation categories;simple rectangle-based functional programs for computing reflexive-transitive closures;using relations to develop a haskell program for computing maximum bipartite matchings;relations as executable specifications: taming partiality and non-determinism using invariants;left-handed completeness;on completeness of omega-regular algebras;categories of algebraic contexts equivalent to idempotent semirings and domain semirings;and relational representation theorem for powerset quantales.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Solving puzzles described in english by automated translation to answer set programming and learning how to do that translation

Solving puzzles described in english by automated translatio...

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Baral, Chitta Dzifcak, Juraj School of Computing Informatics and DSE Arizona State University United States

ISBN: (纸本)9781577355601

We present a system capable of automatically solving combinatorial logic puzzles given in (simplified) English. It uses an ontology to represent the puzzles in ASP which is applicable to a large set of logic puzzles. To translate the English descriptions of the puzzles into this ontology, we use a λ-calculus based approach using Probabilistic Combinatorial Categorial Grammars (PCCG) where the meanings of words are associated with parameters to be able to distinguish between multiple meanings of the same word. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Stable models in generalized possibilistic logic

Stable models in generalized possibilistic logic

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Dubois, Didier Prade, Henri Schockaert, Steven Université Paul Sabatier CNRS IRIT Toulouse France Cardiff University School of Computer Science and Informatics Cardiff United Kingdom

ISBN: (纸本)9781577355601

Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, taken from a totally ordered, but essentially qualitative scale. Recently, a generalization has been proposed that extends possibilistic logic to a meta-epistemic logic, endowing it with the capability of reasoning about epistemic states, rather than merely constraining them. In this paper, we further develop this generalized possi-bilistic logic (GPL). We introduce an axiomatization showing that GPL is a fragment of a graded version of the modal logic KD, and we prove soundness and completeness w.r.t. a semantics in terms of possibility distributions. Next, we reveal a close link between the well-known stable model semantics for logic programming and the notion of minimally specific models in GPL. More generally, we analyze the relationship between the equilibrium logic of Pearce and GPL, showing that GPL can essentially be seen as a generalization of equilibrium logic, although its notion of minimal specificity is slightly more demanding than the notion of minimality underlying equilibrium logic. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Specifying and reasoning with underspecified knowledge bases using answer set programming

Specifying and reasoning with underspecified knowledge bases...

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Chaudhri, Vinay K. Son, Tran Cao AI Center SRI International Mento Park CA United States Computer Science Department New Mexico State University Las Cruces NM United States

ISBN: (纸本)9781577355601

A large and complex knowledge base that models some aspect of the real world can rarely be fully specified. Two examples of such underspecification are that (i) some of the cardinality constraints are omitted;(ii) some properties of all individual instances of a class are specialized across a class hierarchy, but specific references to which particular values are specialized are omitted. Such knowledge bases are of great practical interest as they are the basis of an empirically tested knowledge acquisition system that has been used to construct a knowledge base from a significant portion of a biology textbook. In this paper, we formalize an underspecified knowledge base using answer set programming, and give a set of rules called UMAP that support inheritance reasoning in such a knowledge base. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Automated verification of epistemic properties for general game playing

Automated verification of epistemic properties for general g...

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Haufe, Sebastian thielscher, Michael Department of Computer Science Dresden University of Technology Germany School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781577355601

Automatically deriving properties of new games is one of the fundamental challenges for general game-playing systems, whose task is to learn to play any previously unknown game solely by being given the rules of that game. A recently developed method uses Answer Set programming for verifying finitely-bounded temporal invariance properties against a given game description by structural induction. Addressing the new challenge posed by the recent extension of the general Game Description Language to include games with imperfect information and randomness, we extend this method to epistemic properties about games. We formally prove this extension to be correct, and we report on experiments that show its practical applicability. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Stream reasoning with answer set programming: Preliminary report

Stream reasoning with answer set programming: Preliminary re...

引用

13th international conference on the Principles of Knowledge Representation and Reasoning, KR 2012

作者： Gebser, M. Grote, T. Kaminski, R. Obermeier, P. Sabuncu, O. Schaub, T. Universität Potsdam Germany DERI Galway Ireland Simon Fraser University Canada Griffith University Australia

ISBN: (纸本)9781577355601

the advance of Internet and Sensor technology has brought about new challenges evoked by the emergence of continuous data streams. While existing data-stream management systems allow for high-throughput stream processing, they lack complex reasoning capacities. We address this shortcoming and elaborate upon an approach to knowledge-intense stream reasoning based on Answer Set programming (ASP). the emphasis thus shifts from rapid data processing to complex reasoning. To accommodate this in ASP, we develop new techniques that allow us to formulate problem encodings dealing with emerging as well as expiring data in a seamless way. We thus propose novel language constructs and modeling techniques for specifying and reasoning with time-decaying logic programs. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共35页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：