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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

160 篇 会议
8 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

132 篇 工学
- 125 篇 计算机科学与技术...
- 75 篇 软件工程
- 16 篇 电气工程
- 8 篇 信息与通信工程
- 7 篇 控制科学与工程
- 4 篇 电子科学与技术（可...
- 3 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 农业工程
32 篇 理学
- 28 篇 数学
- 5 篇 系统科学
- 2 篇 物理学
- 2 篇 统计学（可授理学、...
11 篇 管理学
- 6 篇 图书情报与档案管...
- 5 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 临床医学

主题

33 篇 logic programmin...
17 篇 functional progr...
13 篇 semantics
6 篇 computer archite...
5 篇 computer science
5 篇 computer circuit...
5 篇 application soft...
5 篇 software enginee...
5 篇 dynamic programm...
4 篇 programming prof...
4 篇 object oriented ...
4 篇 programming
4 篇 logic gates
4 篇 computer system ...
4 篇 programming lang...
4 篇 logics and meani...
4 篇 logic design
3 篇 software systems
3 篇 libraries
3 篇 formal logic

机构

2 篇 cnrs f-75205 par...
2 篇 gran sasso sci i...
2 篇 no arizona univ ...
2 篇 univ paris dider...
2 篇 univ southampton...
2 篇 max-planck-insti...
2 篇 tohoku univ send...
2 篇 uva subotica ser...
2 篇 cau kiel inst in...
1 篇 xidian univ sch ...
1 篇 univ pisa dipart...
1 篇 institute for vi...
1 篇 univ almeria dep...
1 篇 tu dortmund univ...
1 篇 institut für inf...
1 篇 department of el...
1 篇 informatik ii rw...
1 篇 institute of inf...
1 篇 departamento de ...
1 篇 department of co...

作者

6 篇 hanus michael
3 篇 antoy sergio
3 篇 huch frank
3 篇 brassel bernd
2 篇 dameri enrico
2 篇 kiselyov oleg
2 篇 parlato gennaro
2 篇 habermehl peter
2 篇 simari guillermo...
2 篇 inverso omar
2 篇 eriksson agneta
2 篇 moreno gines
2 篇 tick e
2 篇 fischer sebastia...
2 篇 martelli maurizi...
2 篇 degano pierpaolo
2 篇 johansson anna-l...
2 篇 antoniou grigori...
2 篇 levi giorgio
2 篇 enea constantin

语言

173 篇 英文
1 篇 中文

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

共 174 条记录，以下是111-120 订阅

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

详细简洁

排序：

Incremental learning of functional logic programs 5th

引用

5th international symposium on functional and logic programming, FLOPS 2001

作者： Ferri-Ramírez, C. Hernández-Orallo, J. Ramírez-Quintana, M.J. DSIC UPV Camino de Vera s/n ValenciaE-46022 Spain

ISBN: (纸本)3540417397

In this work, we consider the extension of the Inductive functional logic programming (IFLP) framework in order to learn functions in an incremental way. In general, incremental learning is necessary when the number of examples is infinite, very large or presented one by one. We have performed this extension in the FLIP system, an implementation of the IFLP framework. Several examples of programs which have been induced indicate that our extension pays off in practice. An experimental study of some parameters which affect this efficiency is performed and some applications for programming practice are illustrated, especially small classification problems and data-mining of semi-structured data. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Well-typed logic programs are not wrong 5th

引用

5th international symposium on functional and logic programming, FLOPS 2001

作者： Deransart, Pierre Smaus, Jan-Georg INRIA-Rocquencourt BP 105 Le Chesnay Cedex78153 France CWI Kruislaan 413 Amsterdam1098 SJ Netherlands

ISBN: (纸本)3540417397

We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then all derivations starting in a "well-typed" query are again "well-typed". this property has been called subject reduction. We show that this property can also be phrased as a property of the proof-theoretic semantics of logic programs, thus abstracting from the usual operational (top-down) semantics. this proof-theoretic view leads us to questioning a condition which is usually considered necessary for subject reduction, namely the head condition. It states that the head of each clause must have a type which is a variant (and not a proper instance) of the declared type. We provide a more general condition, thus reestablishing a certain symmetry between heads and body atoms. the condition ensures that in a derivation, the types of two unified terms are themselves unifiable. We discuss possible implications of this result. We also discuss the relationship between the head condition and polymorphic recursion, a concept known in functional programming. © Springer-Verlag Berlin Heidelberg 2001.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

A framework for analysis of typed logic programs 5th

引用

5th international symposium on functional and logic programming, FLOPS 2001

作者： Lagoon, Vitaly Stuckey, Peter J. Dept. of Computer Science and Software Engineering University of Melbourne Parkville3052 Australia

ISBN: (纸本)3540417397

the paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program variables provided by regular tree grammars. Types are used to identify components of terms which can be equated during the programs execution. this information is reflected in form of set constraints in the generic abstract domain called Type(X). the domain allows for abstract compilation of typed logic programs into set logic programs. We demonstrate how the analyzers of groundness and sharing of typed logic programs are obtained by applying the existing (untyped) techniques based on Pos and Sharing to set logic programs. the corresponding analyses in Type(Pos) and Type(Sharing) are more precise than those in Pos and Sharing. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Simulating agent based processing in an ADS using C++ SIM

Simulating agent based processing in an ADS using C++ SIM

引用

international symposium on Autonomous Decentralized Systems (ISADAS)

作者： Chiewon Lee Junghwan Kim J. Stach E.K. Park Computer Science Telecommunications University of Missouri Kansas City MO USA

ISBN: (纸本)0769510655

Currently public networks have an enormous number of computers capable of providing many services. Autonomous mobile agents are being used to access their information sources. these agents are modeled in the context of network simulation as mobile network processes. the paper demonstrates that distributed mobile agents can be simulated effectively using C++ over CSIM. C++ over CSIM achieves the clarity and logic of agent based simulation for network services. Inheritance and specialization under object orientation allow the design and reuse of simulation objects. this combination facilitates rather straightforward simulation designs that are scalable, accurate, flexible and generalizable. the design for such large scale simulation is sketched and the run time behavior of the simulator is analyzed.

关键词： Object oriented modeling Computational modeling Mobile agents Analytical models Context modeling Wide area networks Cost function Mathematical programming Predictive models Visualization

来源：评论

学校读者我要写书评

暂无评论

Reliable software construction: A logic programming based methodology 5

Reliable software construction: A logic programming based me...

引用

5th IEEE international symposium on High Assurance Systems Engineering (HASE 2000)

作者： Gupta, G Univ Texas Dept Comp Sci Richardson TX 75083 USA

ISBN: (纸本)0769509274

In this position paper rile investigate how logic programing technology call aid software development. the overall goal is to provide a framework for specification and verification that is "computational" in nature rather than being based on traditional, more co,complex formalism such as theorem proving and term rewriting. Two approaches are discussed. In the first approach, given a program,written in a traditional language (eg., C), an equivalent logic program is automatically obtained this equivalent logic program serves as a high level abstraction of the original program and call be put to a number of uses including verification, structured debugging and generation of provably correct target code. the second approach is centered around domain specific languages. Given a task for which a software system is to be developed, a high-level domain specific language (DSL) is first designed. Domain experts can nse this DSL for writing programs at their level of abstraction. logic programming provides a framework in which programs written in this DSL can be interpreted, compiled, debugged, verified, and profiled.

关键词： Assembly Automatic logic units Computer science DSL Engineering drawings logic programming Paper technology Reliability engineering Software debugging Writing

来源：评论

学校读者我要写书评

暂无评论

Many-valued disjunctive logic programs with probabilistic semantics 5th

引用

5th international Conference on logic programming and Nonmonotonic Reasoning (LPNMR 99)

作者： Lukasiewicz, T Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)3540667490

We present many-valued disjunctive logic programs in which classical disjunctive logic program clauses are extended by a truth value that respects the material implication. Interestingly, these many-valued disjunctive logic programs have both a probabilistic semantics in probabilities over possible worlds and a truth-functional semantics. We then define minimal, perfect, and stable models and show that they have the same properties like their classical counterparts. In particular, perfect and stable models are always minimal models. Under local stratification, the perfect model semantics coincides with the stable model semantics. Finally, we show that some special cases of propositional many-valued disjunctive logic programming under minimal, perfect, and stable model semantics have the same complexity like their classical counterparts.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analysis of normal logic programs

Analysis of normal logic programs

引用

5th international symposium on Static Analysis (SAS 98)

作者： Fages, F Gori, R Ecole Normale Super CNRS LIENS F-75005 Paris France Univ Pisa Dipartimento Informat I-56125 Pisa Italy

ISBN: (纸本)3540650148

In this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. the analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.

关键词： abstract interpretation static analysis logic programming constructive negation

来源：评论

学校读者我要写书评

暂无评论

Static Analysis - 5th international symposium, SAS 1998, Proceedings

Static Analysis - 5th International Symposium, SAS 1998, Pro...

引用

5th international symposium on Static Analysis, SAS 1998

ISBN: (纸本)3540650148

the proceedings contain 22 papers. the topics discussed include: bidirectional data flow analysis in code motion: myth and reality;on a new method for dataflow analysis of java virtual machine subroutines;enabling sparse constant propagation of array elements via array SSA form;assessing the effects of flow-sensitivity on pointer alias analyses;analysis of normal logic programs;the correctness of set-sharing;deriving analyzers by folding/unfolding of natural semantics and a case study: slicing;on the power of homeomorphic embedding for online termination;analysis of imperative programs through analysis of constraint logic programs;improving control in functional logic program specialization;and directional type inference for logic programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：