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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献
10 册 图书

馆藏范围

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

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 190 篇 软件工程
- 19 篇 控制科学与工程
- 13 篇 电气工程
- 12 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
87 篇 理学
- 71 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
37 篇 管理学
- 28 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
4 篇 教育学
- 4 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

86 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 artificial intel...
9 篇 ontology
8 篇 logic gates
8 篇 mathematical log...
8 篇 functional progr...
6 篇 inductive logic ...
6 篇 programming tech...
6 篇 logics and meani...
6 篇 temporal logic
6 篇 logic design
4 篇 computer archite...
4 篇 logic
4 篇 logic circuits

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 madalina croitor...
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.

语言

357 篇 英文
8 篇 其他
4 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 365 条记录，以下是251-260 订阅

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

详细简洁

排序：

Real-time Maude: A tool for simulating and analyzing real-time and hybrid systems

Real-time Maude: A tool for simulating and analyzing real-ti...

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Ölveczky, Peter Csaba Meseguer, José Computer Science Laboratory SRI International Menlo Park CA 94025 United States

Rewriting logic can be used to specify a wide range of real-time and hybrid systems under a variety of time models, including discrete and dense time models. The Real-Time Maude tool, built on top of the Maude rewriting logic language, supports specification of real-time and hybrid systems in timed modules and timed object-oriented modules, which are transformed into equivalent Maude modules. The tool then supports execution of such specifications in several rewrite modes, corresponding to different criteria for advancing time. Besides system simulation by default execution in a given rewrite mode, the tool has a library of execution strategies and commands that can search all the possible computations from an initial state, within given rewrite mode and search bounds, to partially model check desired properties, including properties expressible in a class of linear time timed temporal logic formulas. The paper discusses the tool's theoretical basis, its specification language, and its library of evaluation and search strategies. The user can add new formal analysis strategies to the library, as illustrated by a scheduling case study. We also summarize our experience with applications and our future plans. We cordially thank Steven Eker, Mark Keaton, Narciso Martí-Oliet, Joseph Sifakis, and Carolyn Talcott for their comments and suggestions. ©2000 Published by Elsevier Science B. V.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

CINNI - A generic calculus of explicit substitutions and its application to λ- ς- and π-Calculi

CINNI - A generic calculus of explicit substitutions and its...

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Stehr, Mark-Oliver SRI International Computer Science Laboratory Menlo Park CA 94025 United States

We approach the general problem of representing higher-order languages, that are usually equipped with special variable binding constructs, in a less specialized first-order framework such as membership equational logic and the corresponding version of rewriting logic. The solution we propose is based on CINNI, a new calculus of explicit substitutions that makes use of a term representation that contains both the standard named notation and de Bruijn's indexed notation as special subcases. The calculus is parametric in the syntax of the object language, which allows us to apply it to different object languages such as λ-calculus, Abadi and Cardelli's object calculus (ς-calculus) and Milner's calculus of communicating mobile processes (π-calculus). As a practical result we obtain executable formal representations of these object languages in Maude with a representational distance close to zero. This work has been supported by DARPA through Rome Laboratories Contract F30602-C-0312, by DARPA and NASA through Contract NAS2-98073, by Office of Naval Research Contract N00014-99-C-0198, and by National Science Foundation Grant CCR-9900334. We would like to thank Jose Meseguer for his advice, including his early suggestion to represent higher-order languages in rewriting logic using explicit substitutions, Cesar Muñoz for many discussions on calculi of explicit substitutions, especially in connection with type theory and proof synthesis, and Narciso Martí-Oliet for many useful suggestions and his constructive criticism. We also appreciate the comments of several referees which helped to improve the paper. In particular, we are indebted to an anonymous referee for pointing out that the representation used by CINNI for pure terms is equivalent to Berkling's representation, and for providing us with the corresponding references. ©2000 Published by Elsevier Science B. V.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Parameterized theories and views in full Maude 2.0

Parameterized theories and views in full Maude 2.0

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Durán, Francisco Meseguer, José ETSII Universidad de Málaga Spain SRI International Menlo Park CA United States

Parameterized specification and programming is a key modularity and reusability technique crucial for managing the complexity of large specifications and programs. In the search for ever more powerful parameterized module composition operations, languages in the Clear/OBJ tradition, including OBJ3, CafeOBJ, and Maude, have used categorical constructions involving three key notions: (i) modules, which are theories with an initial or, more generally, free extension semantics;(ii) theories, with a loose semantics;and (iii) views, which are theory interpretations used to instantiate parameter theories, and to assert formal properties. It has for long been understood that the full generality and power of a module algebra based on these notions requires parameterized theories and views, not just parameterized modules. However, at present, none of the above-mentioned language implementations supports parameterized modules and views. This paper explains and illustrates with examples the language design of Full Maude 2.0, a new module algebra for Maude currently under development in which modules, theories, and views can all be parameterized. We also summarize the underlying categorical semantics, based on the notion of structured modules with freeness constraints, and explain the reflective design of the Full Maude 2.0 implementation. We are very thankful to Narciso Martí-Oliet for his collaboration in the development of this work, for his careful reading of several versions of the paper, and for his many helpful suggestions for improvement. We are also greatful to Joseph Goguen for his constructive criticism and comments on these ideas. ©2000 Published by Elsevier Science B. V.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Interactive robot programming based on human demonstration and advice 3rd

引用

3rd international workshop on Sensor Based Intelligent Robots

作者： Friedrich, H Dillmann, R Rogalla, O Univ Karlsruhe Inst Proc Control & Robot D-76128 Karlsruhe Germany

ISBN: (纸本)3540669337

Service robots require interactive programming interfaces that allow users without programming experience to easily instruct the robots. Systems following the programming by Demonstration (PbD) paradigm that were developed within the last years are getting closer to this goal. However, most of these systems lack the possibility for the user to supervise and influence the process of program generation after the initial demonstration was performed. In this paper an approach is presented, that enables the user to supervise the entire program generation process and to annotate, and edit system hypotheses. Moreover, the knowledge representation and algorithms presented enable the user to generalise the generated program by annotating conditions and object selection criteria via a 3D simulation and graphical user interface. The resulting PbD-system widens the PbD approach in robotics to programming based on human demonstrations and user annotations.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Discovering new knowledge from graph data using inductive logic programming 9th

引用

9th international workshop on Inductive logic programming (ILP-99)

作者： Miyahara, T Shoudai, T Uchida, T Kuboyama, T Takahashi, K Ueda, H Hiroshima City Univ Fac Informat Sci Hiroshima 7313194 Japan Kyushu Univ 39 Dept Informat Kasuga Fukuoka 8168580 Japan Univ Tokyo Ctr Collaborat Res Tokyo 1530041 Japan

ISBN: (纸本)3540661093

We present a method for discovering new knowledge from structural data which are represented by graphs in the framework of inductive logic programming. A graph, or network, is widely used for representing relations between various data and expressing a small and easily understandable hypothesis. Formal Graph System (FGS) is a kind of logic programming system which directly deals with graphs just like first order terms. By employing refutably inductive inference algorithms and graph algorithmic techniques, we are developing a knowledge discovery system KD-FGS, which acquires knowledge directly from graph data by using FGS as a knowledge representation language. In this paper we develop a logical foundation of our knowledge discovery system. A term tree is a pattern which consists of variables and tree-like structures. We give a polynomial-time algorithm for finding a unifier of a term tree and a tree in order to make consistency checks efficiently. Moreover we give experimental results on some graph theoretical notions with the system. The experiments show that the system is useful for finding new knowledge.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A fuzzy approach to hand functioning in virtual programming 3

A fuzzy approach to hand functioning in virtual programming

引用

3rd IEEE international Symposium on Computational Intelligence in Robotics and Automation, CIRA 1999

作者： Yuan, Xiaobu Sun, Hanqiu Department of Computer Science Memorial University of Newfoundland St. John'sNLA1B 3X5 Canada Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin N.T. Hong Kong Hong Kong

ISBN: (纸本)0780358066

Virtual assembly allows human operators to use their hands manipulating the graphics representation of machinery parts and programming assembly tasks directly in a three-dimensional operation space. The imprecise measurements of data gloves and uncertainty of human factors, however, make the incorporation of human hands an error-probing and time-consuming task. This paper investigates the application of fuzzy logic in posture recognition. It presents a simple yet efficient method to handle the imprecision in both the registered sample patterns and run-time glove inputs. Experiment results demonstrate the advantages of us-, ing this approach in robot programming of virtual assembly systems. © 1999 IEEE.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Disjunctive logic programming and autoepistemic logic

Disjunctive logic programming and autoepistemic logic

引用

3rd international workshop on logic programming and knowledge representation

作者： Yuan, LY You, JH Goebel, R Univ Alberta Dept Comp Sci Edmonton AB T6G 2H1 Canada

ISBN: (纸本)3540649581

In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable. Based on these two observations, we classify disjunctive logic program semantics into six different categories, and discuss the relationships among various semantics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

logic programming and knowledge representation - Third international workshop, LPKR'97, Selected Papers

Logic Programming and Knowledge Representation - Third Inter...

引用

3rd international workshop on logic programming and knowledge representation, LPKR 1997

ISBN: (纸本)3540649581

The proceedings contain 9 papers. The topics discussed include: knowledge representation with logic programs;DATALOG with nested rules;partial evidential stable models for disjunctive deductive databases;disjunctive logic programming and autoepistemic logic;a system for abductive learning of logic programs;refining action theories through abductive logic programming;abduction, argumentation and bi-disjunctive logic programs;reasoning with prioritized defaults;and generalizing updates: from models to programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DATALOG with nested rules

DATALOG with nested rules

引用

3rd international workshop on logic programming and knowledge representation

作者： Greco, S Leone, N Scarcello, F Univ Calabria DEIS I-87030 Commenda Di Rende Italy Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria Univ Calabria DEIS ISI CNR I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)3540649581

This paper presents an extension of disjunctive dat slog (Datalog(V)) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. Nested rules increase the knowledge representation power of Datalog(V) both from a theoretical and from a practical viewpoint. A number of examples show that nested rules allow to naturally model several real world situations that cannot be represented in Datalog(V). An in depth analysis of complexity and expressive power of the language shows that nested rules do increase the expressiveness of Datalog(V) without implying any increase in its computational complexity.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A system for abductive learning of logic programs

A system for abductive learning of logic programs

引用

3rd international workshop on logic programming and knowledge representation

作者： Lamma, E Mello, P Milano, M Riguzzi, F Univ Bologna DEIS I-40136 Bologna Italy Univ Ferrara Dipartimento Ingn I-44100 Ferrara Italy

ISBN: (纸本)3540649581

We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction problem has been defined as an extension of the Inductive logic programming framework. In the new problem definition, both the background and the target theories are abductive logic programs and abductive derivability is used as the coverage relation. LAP is based on the basic top-down ILP algorithm that has been suitably extended. In particular, coverage of examples is tested by using the abductive proof procedure defined by Kakas and Mancarella [24]. Assumptions can be made in order to cover positive examples and to avoid the coverage of negative ones. and these assumptions can be used as new training data. LAP can be applied for learning in the presence of incomplete knowledge and for learning exceptions to classification rules.

关键词： abduction learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：