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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

27 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

25 篇 工学
- 25 篇 计算机科学与技术...
- 13 篇 软件工程
- 3 篇 电气工程
- 2 篇 机械工程
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
6 篇 理学
- 6 篇 数学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

10 篇 logic programmin...
4 篇 semantics
2 篇 computer circuit...
2 篇 functional progr...
2 篇 functional progr...
1 篇 0.6 microns
1 篇 computer science
1 篇 fuzzy logic
1 篇 software systems
1 篇 design for test
1 篇 metals
1 篇 dft
1 篇 linear logic
1 篇 boundary-scan te...
1 篇 application spec...
1 篇 concurrent compu...
1 篇 application soft...
1 篇 querying
1 篇 abduction
1 篇 fdega

机构

1 篇 depto. de sistem...
1 篇 departamento de ...
1 篇 univ pisa dipart...
1 篇 departamento de ...
1 篇 univ complutense...
1 篇 department of co...
1 篇 fudan univ asic ...
1 篇 dept informat ci...
1 篇 department of co...
1 篇 department of co...
1 篇 univ minnesota d...
1 篇 depto. de lengua...
1 篇 the university o...
1 篇 dept. of compute...
1 篇 inria-rocquencou...
1 篇 univ politecn va...
1 篇 univ nova lisboa...
1 篇 max-planck-insti...
1 篇 tokyo inst techn...
1 篇 portland state u...

作者

1 篇 hernández-orallo...
1 篇 dahl veronica
1 篇 martelli m
1 篇 r.h.c. yap
1 篇 stuckey peter j.
1 篇 anita szabo
1 篇 boye johan
1 篇 porto antónio
1 篇 deransart pierre
1 篇 bruynooghe mauri...
1 篇 darlington john
1 篇 vidal g
1 篇 albert e
1 篇 lópez-fraguas fr...
1 篇 hortalá-gonzález...
1 篇 köhler martin
1 篇 fernández antoni...
1 篇 porto a
1 篇 caballero rafael
1 篇 nadathur g

语言

30 篇 英文
1 篇 中文

检索条件"任意字段=5th International Symposium on Functional and Logic Programming, FLOPS 2001"

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

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

详细简洁

排序：

Parameterized logic programs where computing meets learning 5th

引用

5th international symposium on functional and logic programming

作者： Sato, T Tokyo Inst Technol Dept Comp Sci Meguro Ku Tokyo 152 Japan

ISBN: (纸本)3540417397

In this paper, we describe recent attempts to incorporate learning into logic programs as a step toward adaptive software that can learn from an environment. Although there are a. variety of types of learning, we focus on parameter learning of logic programs, one for statistical learning by the EM algorithm and the other for reinforcement learning by learning automatons. Both attempts are not full-fledged yet, but in the former case, thanks to the general framework and an efficient EM learning algorithm combined with a tabulated search, we have obtained very promising results that open up the prospect of modeling complex symbolic-statistical phenomena.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

the metalanguage λProlog and its implementation 5th

引用

5th international symposium on functional and logic programming

作者： Nadathur, G Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)3540417397

Stimulated by concerns of software certification especially as it relates to mobile code, formal structures such as specifications and proofs are beginning to play an explicit role in computing. In representing and manipulating such structures, an approach is needed that pays attention to the binding operation that is present in them. the language lambdaProlog provides programming support for a higher-order treatment of abstract syntax that is especially suited to this task. this support is realized by enhancing the traditional strength of logic programming in the metalanguage realm with an ability for dealing directly with binding structure. this paper identifies the features of lambdaProlog that endow it with such a capability, illustrates their use and and describes methods for their implementation. Also discussed is a new realization of lambdaProlog called Teyjus that incorporates the implementation ideas presented.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

An effective bottom-up semantics for first-order linear logic programs 5th

引用

5th international symposium on functional and logic programming

作者： Bozzano, M Delzanno, G Martelli, M Univ Genoa Dipartimento Informat & Sci Informaz I-16146 Genoa Italy

ISBN: (纸本)3540417397

We study the connection between algorithmic techniques for symbolic model checking [ACJT96,FS98,AJ99], and declarative and operational aspects of linear logic programming [And92,AP90]. Specifically, we show that the construction used to decide verification problems for Timed Petri Nets [AJ99] can be used to define a new fixpoint semantics for the fragment of linear logic called LO [AP90]. the fixpoint semantics is based on an effective T-P operator. As an alternative to traditional top-down approaches [And92,AP90,APC93], the effective fixpoint operator. can be used to define a bottom-up evaluation procedure for first-order linear logic programs.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Abstract compilation for sharing analysis

引用

5th international symposium on functional and logic programming

作者： Amato, G Spoto, F Univ Pisa Dipartimento Informat I-56100 Pisa Italy IRISA F-35042 Rennes France

ISBN: (纸本)3540417397

An abstract domain for non pair-sharing and freeness analysis of logic programs has been recently developed by using the automatic technique of linear refinement. W.r.t. previously available domains, it can be used for abstract compilation, which allows a modular and goal-independent analysis of logic programs. In this paper, we describe our implementation of an analyser which uses that domain. Sometimes, we have sacrificed precision for efficiency. We evaluate it over a set of benchmarks and we compare the results with those obtained through a goal-dependent analysis. Not surprisingly, our goal-independent analysis is slower. However, it is almost always as precise as the goal-dependent one. To the best of our knowledge, this is the first goal-independent implementation of sharing analysis based on abstract interpretation, as well as the first implementation of a linearly refined domain.

关键词： abstract interpretation domain theory linear refinement linear logic logic programming

来源：评论

学校读者我要写书评

暂无评论

Reactive Web agents with open constraint programming

Reactive Web agents with open constraint programming

引用

international symposium on Autonomous Decentralized Systems (ISADAS)

作者： K.Q. Zhu Wee-Yeh Tan R.H.C. Yap A.E. Santosa Department of Computer Science National University of Singapore Singapore

ISBN: (纸本)0769510655

this paper describes a new programming system for writing Web applications with reactive agents, i.e. the agents can have complex responses which depend on how the environment changes. Our prototype system is based on the open constraint programming framework using the constraint logic programming language CLP(R). the benefit of reactive Web agents is that activities of agents can be coordinated and synchronized using a common store and the agents can themselves be written as a system of interacting rules. Our thesis is that such a system makes it easy to write powerful reactive applications. We use a stock trading system to illustrate our reactive agents. Some details of the implementation are also given.

关键词： Writing logic programming Concurrent computing Inductors Computer science Application software Prototypes Multiagent systems Application specific processors Relational databases

来源：评论

学校读者我要写书评

暂无评论

Improving control in functional logic program specialization

Improving control in functional logic program specialization

引用

5th international symposium on Static Analysis (SAS 98)

作者： Albert, E Alpuente, M Falaschi, M Julián, P Vidal, G Univ Politecn Valencia DSIC Valencia 46022 Spain Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy Dept Informat Ciudad Real 13071 Spain

ISBN: (纸本)3540650148

We have recently defined a framework for Narrowing-driven Partial Evaluation (NPE) of functional logic programs. this method is as powerful as partial deduction of logic programs and positive supercompilation of functional programs. Although it is possible to treat complex terms containing primitive functions (e.g. conjunctions or equations) in the NPE framework, its basic control mechanisms do not allow for effective polygenetic specialization of these complex expressions. We introduce a sophisticated unfolding rule endowed with a dynamic narrowing strategy which permits flexible scheduling of the elements (in conjunctions) which are reduced during specialization. We also present a novel abstraction operator which extends some partitioning techniques defined in the framework of conjunctive partial deduction. We provide experimental results obtained from an implementation using the INDY system which demonstrate that the control refinements produce better specializations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

5th international symposium on programming Language Implementation and logic programming, PLILP 1993

5th International Symposium on Programming Language Implemen...

引用

5th international symposium on programming Language Implementation and logic programming, PLILP 1993

ISBN: (纸本)9783540571865

the proceedings contain 33 papers. the special focus in this conference is on programming Language Implementation and logic programming. the topics include: Executable specifications for language implementation;avoiding dynamic delays in functional logic programs;a debugging model for functional logic programs;a conservative approach to meta-programming in constraint logic programming;the versatility of handling disjunctions as constraints;improvements in compile-time analysis for ground prolog;a new top-down parsing algorithm for left-recursive DCGs;specification and implementation of grammar couplings using attribute grammars;programming language specification and prototyping using the MAX system;flang and its implementation;efficient lazy narrowing using demandedness analysis;a demand driven computation strategy for lazy narrowing;functional programming languages with logical variables: a linear logic view;objects with state in contextual logic programming;a novel method for parallel implementation of findall;a parallel implementation for AKL;inlining to reduce stack space;a WAM-based implementation of a logic language with sets;executing bounded quantifications on shared memory multiprocessors;a lattice of abstract graphs;higher-order chaotic iteration sequences;proving the correctness of compiler optimisations based on strictness analysis;abstract complexity of prolog based on WAM;development of rewriting strategies;narrowing approximations as an optimization for equational logic programs;a back end generator;selflog: language and implementation;embedding declarative subprograms into imperative constructs;stack management of runtime structures in distributed implementations and efficient register allocation for large basic blocks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

programming language implementation and logic programming: 5th international symposium, PLILP ’93 Tallinn, Estonia, August 25-27, 1993 proceedings 5th

Programming language implementation and logic programming: 5...

引用

5th international symposium on programming Language Implementation and logic programming, PLILP 1993

作者： Bruynooghe, Maurice Penjam, Jaan Department of Computer Science Katholieke Universiteit Leuven Celestijnenlaan 200A HeverleeB-3001 Belgium Software Department Institute of Cybernetics Akadeemia tee 21 TallinnEE0026 Estonia

来源：评论

学校读者我要写书评

暂无评论

Avoiding dynamic delays in functional logic programs 5th

Avoiding dynamic delays in functional logic programs

引用

5th international symposium on programming Language Implementation and logic programming, PLILP 1993

作者： Boye, Johan Department of Computer and Information Science Linköping University LinköpingS-58183 Sweden

ISBN: (纸本)9783540571865

In several functional logic programming languages, functional expressions must be evaluated before unification with another term, but this can only be done if the functional expression is ground. If the functional expression is non-ground, then unification must be delayed until all the arguments have become instantiated to ground terms. If the delaying mechanism uses dynamic tests, the program will be unnecessarily inefficient. We present an analysis method for statically determining at what point in the program a given functional expression can be evaluated. this analysis is then used for transforming a functional logic program into an equivalent program, in which most dynamic delays are avoided. We show that this transformation can lead to considerable improvements in performance, compared to a dynamic delaying strategy. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

functional programming languages with logical variables: A linear logic view 5th

Functional programming languages with logical variables: A l...

引用

5th international symposium on programming Language Implementation and logic programming, PLILP 1993

作者： Darlington, John Guo, Yi-Ke Köhler, Martin Department of Computing Imperial College 180 Queen’s Gate LondonSW7 2BZ United Kingdom

ISBN: (纸本)9783540571865

the idea of introducing logical variables into functional programming languages has been proposed for some years, and many concrete languages with this feature have been developed. Recently the semantic features of the languages in this paradigm have been uniformly modelled using the constraint computation formalism [RJK92]. However, the operational behaviour of these languages has not been studied systematically. In this paper, we propose a linear logic formalization of the the computational behaviour of functional programming languages with logical variables. It is shown that, with the resource-consciousness of linear logic, the computation of the paradigm can be uniformly modelled as deduction in the logic. therefore, the model provides the logical meaning for the computation as well as a general abstract machine for the implementation of these languages. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：