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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

164 篇 会议
12 篇 期刊文献
11 册 图书

馆藏范围

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

日期分布

学科分类号

122 篇 工学
- 109 篇 计算机科学与技术...
- 78 篇 软件工程
- 10 篇 电气工程
- 6 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 5 篇 控制科学与工程
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 轻工技术与工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
- 1 篇 安全科学与工程
37 篇 理学
- 28 篇 数学
- 8 篇 物理学
- 3 篇 化学
- 2 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 1 篇 工商管理
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 农学
- 1 篇 作物学

主题

36 篇 logic programmin...
13 篇 functional progr...
9 篇 logic
9 篇 programming lang...
8 篇 mathematical log...
8 篇 logics and meani...
7 篇 software enginee...
7 篇 artificial intel...
6 篇 computer science
5 篇 programming tech...
5 篇 probabilistic lo...
5 篇 clocks
4 篇 fuzzy logic
4 篇 parallel process...
4 篇 formal logic
4 篇 programming
4 篇 semantics
4 篇 logic devices
4 篇 hardware
4 篇 haskell

机构

2 篇 ruleml inc on
2 篇 nasa ames resear...
2 篇 institut für inf...
2 篇 iohk edinburgh m...
2 篇 fraunhofer fokus...
2 篇 iohk ottawa on
2 篇 univ edinburgh e...
2 篇 department of co...
2 篇 fub inst comp sc...
2 篇 iohk mannheim
2 篇 dpto. de sistema...
2 篇 iohk england
2 篇 tech univ dresde...
2 篇 corp semant web ...
2 篇 iohk utrecht
2 篇 iohk glasgow lan...
2 篇 new mexico state...
2 篇 cau kiel inst in...
2 篇 chalmers univ te...
1 篇 univ tokyo grad ...

作者

5 篇 hanus michael
3 篇 pontelli enrico
3 篇 antoy sergio
2 篇 chakravarty manu...
2 篇 mow douglas a.
2 篇 braßel bernd
2 篇 saad emad
2 篇 current k.wayne
2 篇 mackenzie kennet...
2 篇 paschke adrian
2 篇 vinogradova poli...
2 篇 mueller jann
2 篇 herbert kuchen
2 篇 nilsson henrik
2 篇 jones michael pe...
2 篇 guild n.c.f.
2 篇 baldwin j.f.
2 篇 wadler philip
2 篇 meseguer jose
2 篇 melkonian oresti...

语言

179 篇 英文
5 篇 其他
3 篇 中文

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

共 187 条记录，以下是71-80 订阅

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

详细简洁

排序：

Model-based knowledge representation and reasoning via answer set programming

Model-based knowledge representation and reasoning via answe...

引用

9th international symposium on functional and logic programming

作者： Schaub, Torsten Univ Potsdam Inst Informat D-14482 Potsdam Germany

ISBN: (纸本)9783540789680

the field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and more popular nowadays. this development was primarily driven by the availability of highly efficient Boolean constraint solvers, like satisfiability and answer set solvers. the general idea is to translate an application problem into a logical specification. this specification is in turn passed to a solver, which outputs models representing solutions to the initial application problem. the talk will provide an introduction to answer set programming (ASP), its proof-theoretic foundations, methodology, implementation techniques along with a glimpse of an exemplary application. Besides knowledge representation and reasoning, ASP has its roots in deductive databases, nonmonotonic reasoning, and logic programming. Applications are specified in ASP in terms of sets of logical rules. Modern ASP solvers rely on high-performance Boolean constraint solving techniques, which allow them to tackle application domains consisting of millions of variables. Meanwhile, this approach proved to be an effective tool in a range of applications, like planning, model checking, and bio-informatics.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Declarative diagnosis of missing answers in constraint functional-logic programming

Declarative diagnosis of missing answers in constraint funct...

引用

9th international symposium on functional and logic programming, FLOPS 2008

作者： Caballero, Rafael Rodríguez Artalejo, Mario Del Vado Vírseda, Rafael Dpto. de Sistemas Informáticos y Computación Universidad Complutense de Madrid

ISBN: (纸本)3540789685

We present a declarative method for diagnosing missing computed answers in , a generic scheme for lazy Constraint functional-logic programming which can be instantiated by any constraint domain given as parameter. As far as we know, declarative diagnosis of missing answers in such an expressive framework has not been tackled before. Our approach combines and extends previous work done separately for constraint logic programming and lazy functional programming languages. Diagnosis can be started whenever a user finds that the set of computed answers for a given goal with finite search space misses some expected solution w.r.t. an intended interpretation of the program, that provides a declarative description of its expected behavior. Diagnosis proceeds by exploring a proof tree, that provides a declarative view of the answer-collection process performed by the computation, and it ends up with the detection of some function definition in the program that is incomplete w.r.t. the intended interpretation. We can prove the logical correctness of the diagnosis method under the assumption that the recollection of computed answers performed by the goal solving system can be represented as a proof tree. We argue the plausibility of this assumption, and we describe the prototype of a tool which implements the diagnosis method. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A hoare logic for call-by-value functional programs

A hoare logic for call-by-value functional programs

引用

9th international Conference on Mathematics of Program Construction

作者： Regis-Gianas, Yann Pottier, Francois INRIA Saclay Ile de France ProVal F-91893 Orsay France Univ Paris Sud CNRS LRI F-91405 Orsay France INRIA Paris F-78153 Le Chesnay France

ISBN: (纸本)9783540705932

We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style of Hindley and Milner. It is the theoretical basis for a tool that extracts proof obligations out of programs annotated with logical assertions. these proof obligations, expressed in a typed, higher-order logic, are discharged using off-the-shelf automated or interactive theorem provers. Although the technical apparatus that we exploit is by now standard, its application to call-by-value functional programming languages appears to be new, and (we claim) deserves attention. As a sample application, we check the partial correctness of a balanced binary search tree implementation.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Some extensions of migrativity for triangular norms

Some extensions of migrativity for triangular norms

引用

9th international symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2008

作者： Fodor, Janos Rudas, Imre J. Budapest Tech Bécsiút 96/b H-1034 Budapest Hungary

In this paper we introduce and describe continuous triangular norms that are migrative with respect to another fixed t-norm T0, in particular to the three prototypes TM, TP and TL. Depending on characteristic properties of T0, classes of nilpotent and strict migrative t-norms are naturally formed. In these cases the characterization and construction is carried out by solving functional equations for the generators. In the third case an ordinalsum- like construction is resulted.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Intelligent Computer Mathematics - 9th international Conference, AISC 2008 - 15th symposium, Calculemus 2008 - 7th international Conference, MKM 2008, Proceedings

Intelligent Computer Mathematics - 9th International Confere...

引用

9th Int. Conf. Artificial Intelligence and Symbolic Computation, AISC 2008 - 15th symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008

ISBN: (纸本)3540851097

the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism in the development of English-Indonesian machine translation system;case studies in model manipulation for scientific computing;mechanising a proof of Craig's interpolation theorem for intuitionistic logic in nominal Isabelle;ASIC meets natural typography;the monoids of order eight and nine;extending graphical representations for compact closed categories with applications to symbolic quantum computation;a full first-order constraint solver for decomposable theories;search techniques for rational polynomial orders;strategies for solving sat in grids by randomized search;towards an implementation of a computer algebra system in a functional language;and automated model building: from finite to infinite models.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An Asynchronous Circuit Design with Fast Forwarding Technique at Advanced Technology Node

An Asynchronous Circuit Design with Fast Forwarding Techniqu...

引用

Ninth international symposium on Quality Electronic Design (ISQED 2008)

作者： Chin-Khai Tang Chun-Yen Lin Yi-Chang Lu Graduate Institute of Electronics Engineering National Taiwan University Taipei Taiwan

In this paper, a new asynchronous circuit design is presented. A special technique that enables fast forwarding is applied to the circuits, and the forward transition improves to less than 2. the handshaking process and cycle time of the asynchronous circuits are analyzed, and its performance and functionality under fabrication and temperature variations are evaluated through Monte Carlo simulations in 65nm technology. the proposed asynchronous circuits are compared to the static and domino logic circuits to assess their delay variations and functional success rates.

关键词： Asynchronous circuits Clocks Fabrication Delay Time factors logic circuits Temperature Latches Environmental factors Integrated circuit interconnections

来源：评论

学校读者我要写书评

暂无评论

Efficient Selection of Observation Points for functional Tests

Efficient Selection of Observation Points for Functional Tes...

引用

Ninth international symposium on Quality Electronic Design (ISQED 2008)

作者： Jian Kang Sharad C. Seth Yi-Shing Chang Vijay Gangaram University of Nebraska Lincoln UK Intel Corporation USA

the fault coverage of existing functional tests can be enhanced by additional observation points. For a given set of functional tests, this paper proposes an efficient fault-dropping fault simulation method for selecting a subset of observation points at a small fraction of the cost of non-fault-dropping fault simulation. Experimental results on industrial circuits demonstrate the effectiveness of the method in achieving close to optimal results in the size of the selected subset with an order of magnitude less time, without losing achievable coverage. the technique is particularly applicable to industrial designs where fault-simulation times can be prohibitively expensive, even when only a sample of faults is simulated using distributed techniques.

关键词： Circuit testing Circuit faults Circuit simulation logic testing Automatic test pattern generation Electronic equipment testing Cost function Manufacturing Computational modeling Test pattern generators

来源：评论

学校读者我要写书评

暂无评论

Design and verification of the programming circuit in an application-specific FPGA

Design and verification of the programming circuit in an app...

引用

international Conference on Solid-State and Integrated Circuit Technology

作者： Zhichao Yang Stanley L. Chen Zhongli Liu Institute of Semiconductors Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424421855

In this paper we present a methodology and its implementation for the design and verification of programming circuit used in a family of application-specific FPGAs that share a common architecture. Each member of the family is different either in the types of functional blocks contained or in the number of blocks of each type. the parametrized design methodology is presented here to achieve this goal. Even though our focus is on the programming circuitry that provides the interface between the FPGA core circuit and the external programming hardware, the parametrized design method can be generalized to the design of entire chip for all members in the FPGA family. the method presented here covers the generation of the design RTL files and the support files for synthesis, place-and-route layout and simulations. the proposed method is proven to work smoothly within the complete chip design methodology. We will describe the implementation of this method to the design of the programming circuit in details including the design flow from the behavioral-level design to the final layout as well as the verification. Different package options and different programming modes are included in the description of the design. the circuit design implementation is based on SMIC 0.13-micron CMOS technology.

关键词： Field programmable gate arrays Design methodology logic programming Circuit testing Reconfigurable logic Hardware Circuit synthesis Circuit simulation Packaging CMOS technology

来源：评论

学校读者我要写书评

暂无评论

Declarative diagnosis of missing answers in constraint functional-logic programming 08

Declarative diagnosis of missing answers in constraint funct...

引用

Proceedings of the 9th international conference on functional and logic programming

作者： Rafael Caballero Mario Rodríguez Artalejo Rafael Del Vado Vírseda Dpto. de Sistemas Informáticos y Computación Universidad Complutense de Madrid

ISBN: (纸本)9783540789680

We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint functional-logic programming which can be instantiated by any constraint domain D given as parameter. As far as we know, declarative diagnosis of missing answers in such an expressive framework has not been tackled before. Our approach combines and extends previous work done separately for constraint logic programming and lazy functional programming languages. Diagnosis can be started whenever a user finds that the set of computed answers for a given goal with finite search space misses some expected solution w.r.t. an intended interpretation of the program, that provides a declarative description of its expected behavior. Diagnosis proceeds by exploring a proof tree, that provides a declarative view of the answer-collection process performed by the computation, and it ends up with the detection of some function definition in the program that is incomplete w.r.t. the intended interpretation. We can prove the logical correctness of the diagnosis method under the assumption that the recollection of computed answers performed by the goal solving system can be represented as a proof tree. We argue the plausibility of this assumption, and we describe the prototype of a tool which implements the diagnosis method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantitative logic programming revisited 08

Quantitative logic programming revisited

引用

Proceedings of the 9th international conference on functional and logic programming

作者： Mario Rodríguez-Artalejo Carlos A. Romero-Díaz Departamento de Sistemas Informáticos y Computación Universidad Complutense de Madrid Spain

ISBN: (纸本)9783540789680

Uncertainty in logic programming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. this paper is intended as a first step towards the investigation of uncertainty in Constraint functional logic programming. We revise an early proposal, namely van Emden's Quantitative logic programming [22], and we improve it in two ways. Firstly, we generalize van Emden's QLP to a generic scheme QLP(D) parameterized by any given Qualification Domain D, which must be a lattice satisfying certain natural axioms. We present several interesting instances for D, one of which corresponds to van Emden's QLP. Secondly, we generalize van Emden's results by providing stronger ones, concerning both semantics and goal solving. We present Qualified SLD Resolution over D, a sound and strongly complete goal solving procedure for QLP(D), which is applicable to open goals and can be efficiently implemented using CLP technology over any constraint domain CD able to deal with qualification constraints over D. We have developed a prototype implementation for van Emden's QLP as an instance of QLP(D), on top of the CFLP system TOY.

关键词： qualification constraints quantitative logic programming qualification domains

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：