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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

20 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

16 篇 工学
- 16 篇 计算机科学与技术...
- 15 篇 软件工程
- 2 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 农业工程
9 篇 理学
- 6 篇 数学
- 6 篇 系统科学
1 篇 农学
- 1 篇 作物学

主题

4 篇 logic programmin...
2 篇 object oriented ...
2 篇 constraint satis...
1 篇 computer circuit...
1 篇 group theory
1 篇 computer hardwar...
1 篇 static analysis
1 篇 computer system ...
1 篇 mathematical log...
1 篇 semantics
1 篇 special purpose ...
1 篇 programming tech...
1 篇 testing
1 篇 logics and meani...
1 篇 interpolation
1 篇 functional progr...
1 篇 grading
1 篇 constraint theor...

机构

2 篇 institut für inf...
2 篇 ercis leonardo-c...
2 篇 htwk leipzig fak...
1 篇 facoltà di scien...
1 篇 comenius unversi...
1 篇 institut für inf...
1 篇 forth-ics
1 篇 dipartimento di ...
1 篇 periplus instrum...
1 篇 department of ma...
1 篇 niederrhein univ...
1 篇 semantics gmbh
1 篇 dipartimento di ...
1 篇 dipartimento di ...
1 篇 university of wü...
1 篇 department of ma...
1 篇 institut für inf...
1 篇 kiel university ...
1 篇 ensiie samovar é...
1 篇 dipartimento di ...

作者

2 篇 waldmann johanne...
2 篇 teegen finn
2 篇 hofstedt petra
2 篇 liu ke
2 篇 dageförde jan c.
2 篇 löffler sven
2 篇 hanus michael
1 篇 skowronek patric...
1 篇 dubois catherine
1 篇 claudio sacerdot...
1 篇 michael hanus
1 篇 danilenko nikita
1 篇 flederer frank
1 篇 winkelmann hendr...
1 篇 ehmke dierk
1 篇 dovier agostino
1 篇 schmidt joshua
1 篇 lepper markus
1 篇 vella flavio
1 篇 formisano andrea

语言

21 篇 英文

检索条件"任意字段=28th International Workshop on Functional and Constraint Logic Programming, WFLP 2020"

共 21 条记录，以下是1-10 订阅

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

详细简洁

排序：

28th international workshop on functional and constraint logic programming, wflp 2020

28th International Workshop on Functional and Constraint Log...

引用

28th international workshop on functional and constraint logic programming, wflp 2020

ISBN: (纸本)9783030753320

the proceedings contain 8 papers. the special focus in this conference is on functional and constraint logic programming. the topics include: On the Performance of Bytecode Interpreters in Prolog;memoized Pull-Tabbing for functional logic programming;effectiveness of Annotation-Based Static Type Inference;a Framework for Generating Diverse Haskell-I/O Exercise Tasks;formally Verified Transformation of Non-binary constraints into Binary constraints;constraint-logic Object-Oriented programming with Free Arrays.

关键词：

来源：评论

学校读者我要写书评

暂无评论

22nd international Conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on functional and constraint logic programming, wflp 2019

22nd International Conference on Applications of Declarative...

引用

22nd international Conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on functional and constraint logic programming, wflp 2019

ISBN: (纸本)9783030467135

the proceedings contain 18 papers. the special focus in this conference is on Applications of Declarative programming and Knowledge Management. the topics include: Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order logic;KBSET – Knowledge-Based Support for Scholarly Editing and Text Processing with Declarative Markup and a Core Written in SWI-Prolog;structured Traversal of Search Trees in constraint-logic Object-Oriented programming;performance Analysis of Zippers;adding Data to Curry;free theorems Simply, via Dinaturality;Improving the Performance of the Paisley Pattern-Matching EDSL by Staged Combinatorial Compilation;ICurry;a Process Calculus for Formally Verifying Blockchain Consensus Protocols;modular Modeling and Optimized Scheduling of Building Energy Systems Based on Mixed Integer programming;finding Maximal Non-redundant Association Rules in Tennis Data;from Textual Information Sources to Linked Data in the Agatha Project;allen’s Interval Algebra Makes the Difference;exploring Properties of Icosoku by constraint Satisfaction Approach;the Regularization of Small Sub-constraint Satisfaction Problems;declarative programming for Microcontrollers - Datalog on Arduino.

关键词：

来源：评论

学校读者我要写书评

暂无评论

constraint-logic Object-Oriented programming with Free Arrays 28th

Constraint-Logic Object-Oriented Programming with Free Array...

引用

28th international workshop on functional and constraint logic programming, wflp 2020

作者： Winkelmann, Hendrik Dageförde, Jan C. Kuchen, Herbert ERCIS Leonardo-Campus 3 Münster48149 Germany

ISBN: (纸本)9783030753320

constraint-logic object-oriented programming provides a useful symbiosis between object-oriented programming and constraint-logic search. the ability to use logic variables, constraints, non-deterministic search, and object-oriented programming in an integrated way facilitates the combination of search-related program parts and other business logic in object-oriented applications. With this work we add array-typed logic variables ("free arrays"), thus completing the set of types that logic variables can assume in constraint-logic object-oriented programming. Free arrays exhibit interesting properties, such as indeterminate lengths and non-deterministic accesses to array elements. © 2021, Springer Nature Switzerland AG.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Practical Idiomatic Considerations for Checkable Meta-logic in Experimental functional programming 28th

Practical Idiomatic Considerations for Checkable Meta-logic ...

引用

28th international workshop on functional and constraint logic programming, wflp 2020

作者： Trancón y Widemann, Baltasar Lepper, Markus Semantics GmbH Berlin Germany

ISBN: (纸本)9783030753320

Implementing a complex concept as an executable model in a strongly typed, purely functional language hits a sweet spot between mere simulation and formal specification. For research and education it is often desirable to enrich the algorithmic code with meta-logical annotations, variously embodied as assertions, theorems or test cases. Checking frameworks use the inherent logical power of the functional paradigm to approximate theorem proving by heuristic testing. Here we propose several novel idioms to enhance the practical expressivity of checking, namely meta-language marking, nominal axiomatics, and constructive existentials. All of these are formulated in literate Haskell’98 with some common language extensions. their use and impact are illustrated by application to a realistic modeling problem. © 2021, Springer Nature Switzerland AG.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Memoized Pull-Tabbing for functional logic programming 28th

Memoized Pull-Tabbing for Functional Logic Programming

引用

28th international workshop on functional and constraint logic programming, wflp 2020

作者： Hanus, Michael Teegen, Finn Institut für Informatik CAU Kiel Kiel24098 Germany

ISBN: (纸本)9783030753320

Pull-tabbing is an evaluation technique for functional logic programs which computes all non-deterministic results in a single graph structure. Pull-tab steps are local graph transformations to move non-deterministic choices towards the root of an expression. Pull-tabbing is independent of a search strategy so that different strategies (depth-first, breadth-first, parallel) can be used to extract the results of a computation. It has been used to compile functional logic languages into imperative or purely functional target languages. Pull-tab steps might duplicate choices in case of shared subexpressions. this could result in a dramatic increase of execution time compared to a backtracking implementation. In this paper we propose a refinement which avoids this efficiency problem while keeping all the good properties of pull-tabbing. We evaluate a first implementation of this improved technique in the Julia programming language. © 2021, Springer Nature Switzerland AG.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Formally Verified Transformation of Non-binary constraints into Binary constraints 28th

Formally Verified Transformation of Non-binary Constraints i...

引用

28th international workshop on functional and constraint logic programming, wflp 2020

作者： Dubois, Catherine ENSIIE Samovar Évry-Courcouronnes France

ISBN: (纸本)9783030753320

It is well known in the constraint programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most well-known translations is the Hidden Variable Encoding. In this paper we formalize this encoding in the proof assistant Coq and prove that any solution of the binary constraint satisfaction problem makes it possible to build a solution of the original problem and vice-versa. this formal development is used to complete the formally verified constraint solver developed in Coq by Carlier, Dubois and Gotlieb in 2012, making it a tool able to solve any n-ary constraint satisfaction problem, the key of success of the connection between the translator and the Coq binary solver is the genericity of the latter. © 2021, Springer Nature Switzerland AG.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

SOS Rules for Equivalences of Reaction Systems 28th

SOS Rules for Equivalences of Reaction Systems

引用

28th international workshop on functional and constraint logic programming, wflp 2020

作者： Brodo, Linda Bruni, Roberto Falaschi, Moreno Dipartimento di Scienze Economiche e Aziendali Università di Sassari Sassari Italy Dipartimento di Informatica Università di Pisa Pisa Italy Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche Università di Siena Siena Italy

ISBN: (纸本)9783030753320

Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS combines a set of entities with a set of reactions over them. Entities can be provided by an external context, used to enable or inhibit each reaction, and also produced by reactions. RS semantics is defined in terms of an (unlabelled) rewrite system: given the current set of entities, a rewrite step consists of the application of all and only the enabled reactions. In this paper we define, for the first time, a compositional labelled transition system for RSs with recursive and nondeterministic contexts, in the structural operational semantics (SOS) style. this is achieved by distilling a signature whose operators directly correspond to the ingredients of RSs and by defining some simple SOS inference rules for any such operator. the rich information recorded in the labels allows us to define an assertion language to tailor behavioural equivalences on some specific properties or entities. the SOS approach is suited to drive additional enhancements of RSs along features such as quantitative measurements of entities and communication between RSs. the SOS rules have been also exploited to design a prototype implementation in logic programming. © 2021, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

the Regularization of Small Sub-constraint Satisfaction Problems 22nd

The Regularization of Small Sub-Constraint Satisfaction Prob...

引用

作者： Löffler, Sven Liu, Ke Hofstedt, Petra Department of Mathematics and Computer Science MINT Programming Languages and Compiler Construction Group Brandenburg University of Technology Cottbus-Senftenberg Konrad-Wachsmann-Allee 5 Cottbus03044 Germany

ISBN: (纸本)9783030467135

this paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. the purpose of this approach is to reduce the number of fails in the resolution process, to improve the inferences made during search by the constraint solver by strengthening constraint propagation, and to maintain the level of propagation while reducing the cost of propagating the constraints. Our experimental results show improvements in terms of the resolution speed compared to the original CSPs and a competitiveness to the recent tabulation approach [1, 15]. Besides, our approach can be realized in a preprocessing step, and therefore wouldn’t collide with redundancy constraints or parallel computing if implemented. © 2020, Springer Nature Switzerland AG.

关键词： constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Exploring Properties of Icosoku by constraint Satisfaction Approach 22nd

Exploring Properties of Icosoku by Constraint Satisfaction A...

引用

作者： Liu, Ke Löffler, Sven Hofstedt, Petra Department of Mathematics and Computer Science MINT Brandenburg University of Technology Cottbus-Senftenberg Konrad-Wachsmann-Allee 5 Cottbus03044 Germany

ISBN: (纸本)9783030467135

Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a constraint programming model for the proposed questions, which can provide the answers to our first two questions. the purpose of this paper is to share our preliminary result and problems to encourage researchers in both group theory and constraint communities to consider this topic further. © 2020, Springer Nature Switzerland AG.

关键词： Group theory

来源：评论

学校读者我要写书评

暂无评论

Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order logic 22nd

Facets of the PIE Environment for Proving, Interpolating and...

引用

作者： Wernhard, Christoph Berlin Germany

ISBN: (纸本)9783030467135

PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. Its main focus is on formulas, as constituents of complex formalizations that are structured through formula macros, and as outputs of reasoning tasks such as second-order quantifier elimination and Craig interpolation. It supports a workflow based on documents that intersperse macro definitions, invocations of reasoners, and-formatted natural language text. Starting from various examples, the paper discusses features and application possibilities of PIE along with current limitations and issues for future research. © 2020, Springer Nature Switzerland AG.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：