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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

33 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

29 篇 工学
- 29 篇 计算机科学与技术...
- 22 篇 软件工程
- 3 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 材料科学与工程（可...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 农业工程
8 篇 理学
- 8 篇 数学
3 篇 管理学
- 3 篇 图书情报与档案管...
1 篇 农学
- 1 篇 作物学

主题

6 篇 logic programmin...
6 篇 semantics
3 篇 computer circuit...
2 篇 prolog (programm...
2 篇 abstracting
1 篇 fuzzy logic
1 篇 message passing
1 篇 propositional pr...
1 篇 cameras
1 篇 mobile robots
1 篇 singular spectru...
1 篇 calculations
1 篇 probabilistic lo...
1 篇 computers
1 篇 integer programm...
1 篇 water vapor radi...
1 篇 remote sensing
1 篇 robot vision sys...
1 篇 algebra
1 篇 specification la...

机构

2 篇 institute for in...
2 篇 institute of mat...
2 篇 vienna universit...
2 篇 computer science...
2 篇 p. o. box 20 80 ...
1 篇 fsb university o...
1 篇 department of co...
1 篇 department of in...
1 篇 dipartimento di ...
1 篇 free university ...
1 篇 department of co...
1 篇 peter great st p...
1 篇 department of co...
1 篇 department of ma...
1 篇 russian acad sci...
1 篇 lifia-institut i...
1 篇 univ saarland d-...
1 篇 deis università ...
1 篇 department of co...
1 篇 bim kwikstraat 4...

作者

2 篇 meyer manfred
2 篇 neumann gustaf
2 篇 hein hans-günthe...
1 篇 schuerman kees
1 篇 parigot michel
1 篇 powers david m. ...
1 篇 ornaghi mario
1 篇 delgado-rannauro...
1 篇 börger egon
1 篇 k. v. ignatev
1 篇 belmesk m.
1 篇 m. m. kopichev
1 篇 müller jörg
1 篇 véron andré
1 篇 xu jiyang
1 篇 voronkov andrei
1 篇 van der hock wie...
1 篇 dorochevsky mich...
1 篇 lamma evelina
1 篇 henson martin c.

语言

34 篇 英文

检索条件"任意字段=2nd Russian Conference on Logic Programming, 1991"

共 34 条记录，以下是21-30 订阅

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

详细简洁

排序：

A WAM compilation scheme 2nd

A WAM compilation scheme

引用

2nd russian conference on logic programming, 1991

作者： Hein, Hans-Günther Meyer, Manfred Computer Science Department University of Kaiserslautern P. O. Box 30 49 KaiserslauternD-6750 Germany P. O. Box 20 80 KaiserslauternD-6750 Germany

ISBN: (纸本)9783540554608

In order to ease the compilation of logic programs, source-to-source transformations are applied to obtain still declarative programs. The horizontal compilation consists of grouping clauses together, performing a flattening process to remove nested compound terms, partially evaluating them, and reordering the constraints followed by variable classification. The constraints are mapped onto a single = primitive. For the resulting, very concise representation we present the vertical compilation rules for generating WAM code. They can be further optimized taking type inference information into account. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Some considerations on the logic PFD: A logic combining modality and probability 2nd

Some considerations on the logic PFD: A logic combining moda...

引用

2nd russian conference on logic programming, 1991

作者： van der Hock, Wiebe Free University Amsterdam Department of Mathematics and Computer Science De Boerelaan 1081 Amsterdam1081 HV Netherlands

ISBN: (纸本)9783540554608

We investigate a logic PFD, as introduced in [FA]. In our notation, this logic is enriched with operators Pr>, (r ∈ [0,1]) where the intended meaning of Pr>φ is ‘the probability of φ (at a given world) is strictly greater than r’. We also adopt the semantics of [FA]: a class of ‘F-restricted probabilistic Kripkean models’. We give a completeness proof that essentially differs from that in [FA]: our ‘peremptory lemma’ (a lemma in PFD rather than about it) facilitates the construction of a canonical model for PFD considerably. We show that this construction can be carried out using only finitary means, and also give a filtration-technique for the intended models. We then define an alternative (in some sense more natural) semantics for the logic, and derive some of its properties. Finally, we prove decidability of the logic. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

FIDO: Finite domain consistency techniques in logic programming 2nd

FIDO: Finite domain consistency techniques in logic programm...

引用

2nd russian conference on logic programming, 1991

作者： Meyer, Manfred Hein, Hans-Günther Müller, Jörg P. O. Box 20 80 KaiserslauternD-6750 Germany Computer Science Department University of Kaiserslautern P. O. Box 30 49 KaiserslauternD-6750 Germany

ISBN: (纸本)9783540554608

In this paper we discuss different implementation for FIDO, a logic programming language with finite domain constraints and consistency techniques. These approaches range from meta-interpretation over horizontal compilation (source-to-source transformation) through vertical compilation down to an extended Warren Abstract Machine. We will stress the horizontal compilation approach which already shows promising results, whereas the deeper integration on a lower implementation layer by extending the unification and control instructions of the WAM will finally give much better performance results. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Abstract syntax and logic programming 2nd

Abstract syntax and logic programming

引用

2nd russian conference on logic programming, 1991

作者： Miller, Dale Department of Computer and Information Science University of Pennsylvania PhiladelphiaPA19104-6389 United States

ISBN: (纸本)9783540554608

When writing programs to manipulate structures such as algebraic expressions, logical formulas, proofs, and programs, it is highly desirable to take the linear, human-oriented, concrete syntax of these structures and parse them into a more computation-oriented syntax. For a wide variety of manipulations, concrete syntax contains too much useless information (e.g., keywords and white space) while important information is not explicitly represented (e.g., function-argument relations and the scope of operators). In parse trees, much of the semantically useless information is removed while other relationships, such as between function and argument, are made more explicit. Unfortunately, parse trees do not adequately address important notions of object-level syntax, such as bound and free object-variables, scopes, alphabetic changes of bound variables, and object-level substitution. I will argue here that the abstract syntax of such objects should be organized around α-equivalence classes of λ-terms instead of parse trees. Incorporating this notion of abstract syntax into programming languages is an interesting challenge. This paper briefly describes a logic programming language that directly supports this notion of syntax. An example specifications in this programming language is presented to illustrate its approach to handling object-level syntax. A model theoretic semantics for this logic programming language is also presented. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of prolog as binary definite programs 2nd

Implementation of prolog as binary definite programs

引用

2nd russian conference on logic programming, 1991

作者： Demoen, Bart Mariëm, André K.U.Leuven Department of Computer Science Celestijneldaan 200 A LeuvenB-3030 Belgium BIM Kwikstraat 4 EverbergB-3078 Belgium

ISBN: (纸本)9783540554608

We describe how Prolog can be implemented with a sinaplified WAM, by transforming Prolog programs to binary definite programs. This removes "all operations from the WAM which are related to environments, as enviromnents are no longer needed for these transformed programs. The obvious catch is that the heap includes the information previously in the envLrolunents. We discuss the transformation scheme, including the treatment of disjunctions and cut and the primitives necessary to support the latter. We show how to implement built-in predicates and how to reintroduce optimizations lost in the general transformation. We show best mad worst case behavior and a performance analysis for a selected program. © Springer-Verlag Berlin Heidelberg 1992.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Free deduction: An analysis of "computations" in classical logic 2nd

Free deduction: An analysis of "computations" in classical l...

引用

2nd russian conference on logic programming, 1991

作者： Parigot, Michel Equipe de logique - CNRS UA 753 Université Paris 7 45-55 5ème étage 2 place jussieu Paris Cedex 0575251 France

ISBN: (纸本)9783540554608

Cut-elimination is a central tool in proof-theory, but also a way of computing with proofs used for constructing new functional languages. As such it depends on the properties of the deduction system in which proofs are written. For intuitionistic logic, natural deduction allows a cut-elimination procedure which effectively provides a computation mechanism with deep theoretical properties such as confluence and strong normalisation. For classical logic, on the contrary, neither natural deduction nor sequent calculus provide a suitable cut-elimination, and, in fact, the computational meaning of classical proofs is an open problem. In this paper, a new deduction sytem is introduced: free deduction. Free deduction is an adequate system for classical logic, allowing a global cut-elimination procedure in the style of intuitionistic natural deduction. We prove that, provided a choice of inputs (which corresponds to a fundamental non-determinism of classical logic), the cut-elimination procedure in free deduction provides a computation mechanism for classical logic which satisfies confluence and strong normalisation. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

The development of Oz and Mozart

引用

2nd International conference Multiparadigm programming in Mozart/Oz

作者： Smolka, G Univ Saarland D-6600 Saarbrucken Germany

ISBN: (纸本)3540250794

In this talk I will review the development of the programming language Oz and the programming system Mozart. I will discuss where in hindsight I see the strong and the weak points of the language. Moreover, I will compare Oz with Alice, a typed functional language we developed after Oz. The development of Oz started in 1991 at DFKI under my lead. The initial goal was to advance ideas from constraint and concurrent logic programming and also from knowledge representation and to develop a practically useful programming system. After a number of radical and unforeseen redesigns we arrived in 1995 at the final base language and a stable implementation (DFKI Oz). In 1996 we founded the Mozart Consortium with SICS and Louvain-la-Neuve. Oz was extended with support for persistence, distribution and modules and Mozart 1.0 was released in January 1999. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Treating enhanced entity relationship models in a declarative style 2nd

Treating enhanced entity relationship models in a declarativ...

引用

2nd russian conference on logic programming, 1991

作者： Kehrer, Norbert Neumann, Gustaf Vienna University of Economics and Business Administration Institute of Information Processing Augasse 2-6 ViennaA-1090 Austria

ISBN: (纸本)9783540554608

In this paper we present an approach to represent schema information, application data and integrity constraints in form of a logic program. An information system is specified by an enhanced entity relationship (EER) model which is transformed by means of a one-to-one mapping into a set of ground facts. The application data corresponding to the schema is represented by ground facts called observations. In order to check whether the application data conforms to the given schema, a set of general integrity rules is defined which expresses the dependencies (functional, inclusion and exclusion dependencies) implied by the EER model. In order to check whether the application EER model is a valid EER model a meta EER model is defined. Any application EER diagram appears as an instance of the meta EER diagram and can be represented using observations. This way the same set of integrity constraints can be used to check the conformance between the application data and the application EER diagram, the meta EER diagram and the application EER diagram. Since the representation of the meta EER diagram is an instance of the meta EER diagram, the validity of the meta EER diagram can be checked as well. The resulting logic program is composed of the application data, the application schema, the meta schema, a general set of constraints plus optionally additional application specific constraints and deduction rules. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A shared environment parallel logic programming system on distributed memory architectures 2nd

A shared environment parallel logic programming system on di...

引用

2nd European Distributed Memory Computing conference, EDMCC 1991

作者： Delgado-Rannauro, Sergio A. Dorochevsky, Michel Schuerman, Kees Véron, André Xu, Jiyang ECRC GmbH Arabellastr. 17 Munich 81D-8000 Germany

ISBN: (纸本)9783540539513

Current advances in Virtual Memory for Parallel Architectures have changed the idea that software architectures with global address spaces cannot execute well on Distributed Memory Message Passing (DMMP) architectures. This paper presents a parallel logic programming platform for complex applications based on a shared binding environment. The software architecture of this platform has been designed taking into account a range of parallel architectures, including DMMP machines. Preliminary results of the simulation of the software architecture on the EDS architecture, an Esprit II development of a DMMP machine, are also discussed. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Data Processing of a Ground-Based Radiometric Complex for Remote Sensing of Tropospheric Parameters 2

Adaptive Data Processing of a Ground-Based Radiometric Compl...

引用

2nd IEEE International conference on Control in Technical Systems (CTS)

作者： Drozhzhov, K. A. Ivanov, S. I. Ilin, G. N. Peter Great St Petersburg Polytech Univ St Petersburg Russia Russian Acad Sci Inst Appl Astron St Petersburg Russia

ISBN: (纸本)9781538607770

The paper presents algorithm development results for adaptive data processing of the troposphere parameters remote sensing. The algorithm is implemented in the LabVIEW graphical programming environment and processes data of the ground-based water vapor radiometer (WVR) in a quasi-real time scale. To identify trends and forecast changes in the time series of WVR data during intense precipitation, it is proposed to use the method of Singular Spectrum Analysis - "Caterpillar"-SSA". To determine the anomalous values of the initial time series data, the fuzzy method is used. The results of the comparison of the troposphere integral water vapor content obtained with the help of WVR and global navigation satellite systems are given.

关键词： remote sensing adaptive data processing water vapor radiometer singular spectrum analysis fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：