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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献

馆藏范围

355 篇 电子文献
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 篇 ontology
8 篇 logic gates
8 篇 functional progr...
6 篇 inductive logic ...
6 篇 temporal logic
5 篇 logic design
4 篇 computer archite...
4 篇 logic
4 篇 logic circuits
4 篇 computer program...
4 篇 nonvolatile memo...
3 篇 computer science
3 篇 fuzzy logic

机构

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 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.
2 篇 eiter t

语言

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

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

共 355 条记录，以下是291-300 订阅

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

详细简洁

排序：

Projection and unification for conceptual graphs 3rd

引用

3rd international Conference on Conceptual Structures (ICCS 95)

作者： Willems, M Vrije Universiteit Amsterdam De Boelelaan 1081a Amsterdam 1081 HV Netherlands

ISBN: (纸本)3540601619

In this paper we will investigate subsumption and unification for structured descripitons by considering conceptual graphs with their projection and (maximal) join. The importance of projection for conceptual graphs is well-known as it essentially defines a partial order (subsumption hierarchy) on the graphs, that allows one to speed up search considerably. We investigate the complexity of projection by introducing a weaker notion of structural similarity, polyprojection. We prove that a polyprojection implies a projection for so-called non-repeating conceptual graphs. Furthermore, we show that a polyprojection can be determined by a polynomial algorithm. Indeed, the algorithm presented generalizes well-known algorithms for subtree isomorphism, and subsumption between feature term graphs. A maximal join is defined as the join on a maximally extended compatible projection. The operation is closely related to unification in feature logics and logic programming, but it is allows more flexibility of representation. In essence, a maximal join corresponds to the greatest lower bound of two conceptual graphs when the partial order due to projection is a lattice. Finally, unification of structured descriptions as maximal join is shown to be polynomially related to projection.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Integration of genetic algorithms and fuzzy logic into a neural network simulation environment 3

Integration of genetic algorithms and fuzzy logic into a neu...

引用

3rd international workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 1995

作者： Wilke, P. Billing, G. Mansfeld, C. Nilson, J. C/O Lehrstuhl für Programmiersprachen Erlangen-Nürnberg Univ. Martensstrasse 3 Erlangen91058 Germany

ISBN: (纸本)0818669020

NEUROGRAPH is a simulation environment for neural networks. It provides an easy to use graphical user interface to design, construct and execute neural networks. The most important design goals were easy extensibility, good performance and the ability to solve real world problems. Extensibility is ensured by an extremely flexible, hierarchical internal representation (data structure), which can be easily manipulated by graphical tools. Current available extensions to the neural network simulator are components for genetic algorithms and fuzzy logic. As an example the automated generation of a neural network by a genetic algorithm is shown. This data structure can be interpreted for debugging purposes or can be executed directly for high performance computing. In the later case C or C++ code is generated from the internal representation of the neural functions, compiled and stored in an executable process (library). NEUROGRAPH has a file or process interface to interconnect which other processes. It is also possible to generate C or C++ code representing the neural network which can be incorporated in other applications. © 1995 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Open logic machine - III non-deterministic object feature representation via complexity evaluation

Open logic machine - III non-deterministic object feature re...

引用

Proceedings of the 3rd IEEE international workshop on Robot and Human Communication

作者： Kamejima, Kohji Aoki, Toshiyuki Watanabe, Yuriko C. Osaka Inst of Technology Osaka Japan

A dynamic feature representation scheme is presented for non-deterministic objects with complicated images. Object symbols are dynamically generated through the interaction with computable scene in which the object feature is modeled in terms of stochastic contraction mappings from image field into itself. Through a series of simulation studies, the scheme is demonstrated to detect and regenerate fractal objects.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A module system for meta-programming 4th

引用

4th international workshop on logic Program Synthesis and Transformation, LOPSTR 1994 and Metaprogramming in logic, META 1994

作者： Hill, P.M. School of Computer Studies University of Leeds LeedsLS2 9JT United Kingdom

ISBN: (纸本)9783540587927

The need for modules in the development of large programs is well known while meta-programming is widely regarded as a simple yet powerful methodology for knowledge representation and reasoning. Thus if we wish to reason about large knowledge bases, it is desirable that meta-programs should be designed to reason about modular programs. This paper describes a module system which allows the modules to be parametrised over the language symbols exported by the module and shows that this provides a natural environment for meta-programming where both the meta and object programs enjoy the same parametrised module system. © Springer-Verlag Berlin Heidelberg 1994.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A basis for a multilevel metalogic programming language 4th

引用

4th international workshop on logic Program Synthesis and Transformation, LOPSTR 1994 and Metaprogramming in logic, META 1994

作者： Barklund, Jonas Boberg, Katrin Dell’Acqua, Pierangelo Computing Science Dept Uppsala University Box 311 UppsalaS-751 05 Sweden

ISBN: (纸本)9783540587927

We are developing a multilevel metalogic programming language that we call Alloy. It is based on first-order predicate calculus extended with metalogical constructs. An Alloy program consists of a collection of theories, all in the same language, and a representation relation over these theories. The whole language is self-representable, including names for expressions with variables. A significant difference, as compared with many previous approaches, is that an arbitrary number of metalevels can be employed and that the object-meta relationship between theories need not be circular. The language is primarily intended for representation of knowledge and metaknowledge and is currently being used in research on hierarchical representation of legal knowledge. We believe that the language allows sophisticated expression and efficient automatic deduction of interesting sets of beliefs of agents. This paper aims to give a preliminary and largely informal definition of the core of the language, a simple but incomplete and inefficient proof system for the language and a sketch of an alternative, more efficient, proof system. The latter is intended to be used as a procedural semantics for the language. It is being implemented by an extension of an abstract machine for Prolog. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Contradiction: When avoidance equals removal Part I 4th

Contradiction: When avoidance equals removal Part I

引用

4th international workshop on Extensions of logic programming, ELP 1993

作者： Alferes, José Júlio Pereira, Luís Moniz CRIA Uninova and DCS U. Nova de Lisboa Monte da Caparica2825 Portugal

ISBN: (纸本)9783540580256

Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides "negation as failure", and its use in deductive databases, knowledge representation, and nonmonotonic reasoning. By introducing explicit negation into logic programs contradiction may appear. In this work we present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based on a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction. The work is divided into two parts: one is presented in this paper, and comprises the contradiction avoidance approach, and the other in [16] in this volume, comprises the contradiction removal approach and shows the equivalence between the avoidance and removal approaches. © Springer international Publishing AG 2017.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

representation and inference with consistent temporal propositions 4th

Representation and inference with consistent temporal propos...

引用

4th international workshop on Extensions of logic programming, ELP 1993

作者： Ribeiro, Cristina Porto, António Departamento de Informática Universidade Nova de Lisboa Monte da Caparica2825 Portugal

ISBN: (纸本)9783540580256

Reasoning with temporal information is essential in Artificial Intelligence. We consider a knowledge base where the internal representation language deals with temporally qualified propositions and constraints on the ordering of time points. As temporal information is typically partial, a representation including constraints on the order of temporal objects is particularly suited. Temporal statements associate maximal intervals to basic atemporal propositions. Queries posed to a knowledge base which includes facts and rules use deduction to explore its consequences and abduction to generate consistent hypotheses. The inference system relies on a set of constraint primitives providing temporal consistency both for points and for intervals. The relevant aspects of the temporal framework are the underlying propositional language, the abductive derivation procedure and the facility of built-in constraint handling. The abductive procedure in the inference system provides the strategy for completing partial information in order to produce informative answers. The integration of constraint solving with abduction allows a query oriented generation of answers where the enforcement of constraints is efficiently performed. © Springer international Publishing AG 2017.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

The Information Agent: an infrastructure agent supporting collaborative enterprise architectures

The Information Agent: an infrastructure agent supporting co...

引用

IEEE international workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： M. Barbuceanu M.S. Fox Enterprise Integration Laboratory Department of Industrial Engineering University of Toronto Canada

We introduce the Information Agent as a component of the information infrastructure supporting collaborative computing environments. We discuss the functions of the Information Agent, describe an architecture based on an agent program and a knowledge management system and present out choices for these components. We show how the architecture can be designed and implemented using description logic representation systems and argue for the advantages of this approach. Then we show how services supporting time-map management, conflict resolution, deductive queries and change management have been introduced and how all of these support the functions of the Information Agent.< >

关键词： Collaboration knowledge management Intelligent agent Computer architecture Environmental management Protocols Industrial engineering logic design Information management knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A representation of software systems evolution based on the theory of the general system 3rd

引用

3rd international workshop on Computer Aided Systems Theory, EUROCAST 1993

作者： Parets, José Anaya, Ana Rodríguez, María J. Paderewski, Patricia Dept. de Lenguajes y Sistemas Informáticos Facultad de Ciencias Universidad de Granada Granada18001 Spain

ISBN: (纸本)9783540576013

The more commonly used software development methods assign the activities and results of the process of modification and evolution of software systems to maintenance. In this paper we present an approach to the representation of the evolution of these systems, based on Le Moigne’s theory of the General System, and a prototype developed in an object-oriented programming language which implements the concepts used. To do this we distinguish, in the evolution of software systems, between the Functional and Structural History of the system. These concepts have allowed us to elaborate a recursive-evolutive model of the software development process, which permits us to implement the concepts of the theory and to make prototypes of software systems. Perhaps the most important contribution comes from the uniformity provided by a well founded epistemological background, the System Theory, which allows us to treat the design, functioning and modifications of software systems in an homogeneous way. © 1994, Springer Verlag. All rights reserved.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Support logic for feature representation, pattern recognition and machine learning

Support logic for feature representation, pattern recognitio...

引用

IEEE international Conference on Fuzzy Systems (FUZZ-IEEE)

作者： J.F. Baldwin R.M. Gooch T.P. Martin Department of Engineering Mathematics and Advanced Computing Research Centre University of Bristol Bristol UK

The formalism of support logic provides a framework for deductive inference, with mathematically sound and consistent treatment of uncertainty and evidence which is aggregated through the reasoning process. The authors apply support logic programming to pattern recognition. Initially, a pattern classifier is constructed by encoding expert knowledge of the problem domain into rules of support logic. Fuzzy sets allow the general properties of features to be described precisely. Semantic unification provides an alternative to the usual metric-based similarity criteria. The validity of the approach is established by cross-validating the support logic classifier against models from alternative paradigms. The authors then attempt to circumvent the requirement for a domain expert, and assess the extent to which data-driven learning processes can be used to automatically derive components of the support logic classifier.< >

关键词： Pattern recognition Machine learning logic programming Tin Uncertainty Fuzzy sets Extraterrestrial measurements Prototypes Acoustical engineering Mathematics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：