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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是11-20 订阅

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

详细简洁

排序：

Structured Traversal of Search Trees in constraint-logic Object-Oriented programming 22nd

Structured Traversal of Search Trees in Constraint-Logic Obj...

引用

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

作者： Dageförde, Jan C. Teegen, Finn ERCIS Leonardo-Campus 3 Münster48149 Germany Institut für Informatik CAU Kiel Kiel24098 Germany

ISBN: (纸本)9783030467135

In this paper, we propose an explicit, non-strict representation of search trees in constraint-logic object-oriented programming. Our search tree representation includes both the non-deterministic and deterministic behaviours of executing an application. Introducing such a representation facilitates the use of various search strategies. In order to demonstrate the applicability of our approach, we incorporate explicit search trees into the virtual machine of the constraint-logic object-oriented programming language Muli. We then exemplarily implement three search algorithms that traverse the search tree on-demand: depth-first search, breadth-first search, and iterative deepening depth-first search. In particular, the last two strategies allow for a complete search, which is novel in constraint-logic object-oriented programming and highlights our main contribution. Finally, we compare the implemented strategies using several benchmarks. © 2020, Springer Nature Switzerland AG.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Towards constraint logic programming over Strings for Test Data Generation 22nd

Towards Constraint Logic Programming over Strings for Test D...

引用

作者： Krings, Sebastian Schmidt, Joshua Skowronek, Patrick Dunkelau, Jannik Ehmke, Dierk Niederrhein University of Applied Sciences Mönchengladbach Germany Institut für Informatik Heinrich-Heine-Universität Düsseldorf Germany periplus instruments GmbH & Co. KG Darmstadt Germany

ISBN: (纸本)9783030467135

In order to properly test software, test data of a certain quality is needed. However, useful test data is often unavailable because existing or hand-crafted data might not be diverse enough to enable desired test cases. Furthermore, using production data might be prohibited due to security or privacy concerns or other regulations. At the same time, existing tools for test data generation are often limited. In this paper, we evaluate to what extent constraint logic programming can be used to generate test data, focusing on strings in particular. To do so, we introduce a prototypical CLP solver over string constraints. As case studies, we use it to generate valid IBAN numbers, calendar dates and specific data in JSON. © 2020, Springer Nature Switzerland AG.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Parallelism for ASP-Solving 22nd

GPU-Based Parallelism for ASP-Solving

引用

作者： Dovier, Agostino Formisano, Andrea Vella, Flavio Dipartimento di Scienze Matematiche Informatiche e Fisiche Università di Udine Udine Italy Dipartimento di Matematica e Informatica Università di Perugia Perugia Italy Facoltà di Scienze e Tecnologie Informatiche Libera Università di Bolzano Bolzano Italy

ISBN: (纸本)9783030467135

Answer Set programming (ASP) has become the paradigm of choice in the field of logic programming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide range of application domains. Recently, with the advent of GPU Computing, which allowed the use of modern parallel Graphical Processing Units (GPUs) for general-purpose computing, new opportunities for accelerating ASP computation has arisen. In this paper, we describe a new approach for solving ASP that exploits the parallelism provided by GPUs. the design of a GPU-based solver poses various challenges due to the peculiarities of GPU in terms of both programmability and architecture capabilities with respect to the intrinsic nature of the satisfiability problems, which exposes poor parallelism. © 2020, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Declarative multi-paradigm programming 28

Declarative multi-paradigm programming

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Hanus, Michael Institut für Informatik CAU Kiel KielD-24098 Germany

this tutorial provides an overview and introduction to declarative programming exploiting multiple paradigms, in particular, functional, logic, and constraint programming. To demonstrate the possibility to support these paradigms within a single programming model, we survey the features of the declarative multi-paradigm language Curry.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Automated exercises for constraint programming 28

Automated exercises for constraint programming

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Waldmann, Johannes HTWK Leipzig Fakultät IMN Leipzig04277 Germany

We describe the design, implementation, and empirical evaluation of some automated exercises that we are using in a lecture on constraint programming. Topics are propositional satisfiability, resolution, the DPLL algorithm, with extension to DPLL(T), and FD solving with arc consistency. the automation consists of a program for grading student answers, and in most cases also a program for generating random problem instances. the exercises are part of the autotool Eassessment framework. the implementation language is Haskell. You can try them at https://***/cgi-bin/Trial. cgi?lecture=199.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

Exploring non-determinism in graph algorithms 28

Exploring non-determinism in graph algorithms

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Danilenko, Nikita Institut für Informatik Christian-Albrechts-Universität Kiel Olshausenstraße 40 KielD-24098 Germany

Graph algorithms that are based on the computation of one or more paths are often written in an implicitly non-deterministic way, which suggests that the result of the algorithm does not depend on a particular path, but any path that satisfies a given property. Such algorithms provide an additional challenge in typical implementations, because one needs to replace the non-determinism with an actual implementation. In this paper we explore the effects of using non-determinism explicitly in the functional logic programming language Curry. To that end we consider three algorithms and implement them in a prototypically non-deterministic fashion.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Describing and measuring the complexity of SAT encodings for constraint programs 28

Describing and measuring the complexity of SAT encodings for...

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Bau, Alexander Waldmann, Johannes HTWK Leipzig Fakultät IMN Leipzig04277 Germany

the CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositional logic that is handed to an external SAT solver. We investigate the problem of predicting the size of formulas produced by the CO4 compiler. the goal is to help the programmer in understanding the resource consumption of CO4 on his *** present a basic cost model, with some experimental data, and discuss ongoing work towards static analysis. It turns out that analysis steps will use constraint systems as well.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

CEUR workshop Proceedings

CEUR Workshop Proceedings

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

the proceedings contain 12 papers. the topics discussed include: embedding defeasible logic programs into generalized logic programs;describing and measuring the complexity of SAT encodings for constraint programs;PPI - a portable prolog interface for Java;declarative evaluation of ontologies with rules;automated exercises for constraint programming;complex certainty factors for rule based systems - detecting inconsistent argumentations;declarative multi-paradigm programming;interpreting XPath by iterative pattern matching with paisley;exploring non-determinism in graph algorithms;curry without success;a partial evaluator for curry;and automatic testing of operation invariance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Embedding defeasible logic programs into generalized logic programs 28

Embedding defeasible logic programs into generalized logic p...

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Baláž, Martin Frtús, Jozef Homola, Martin Šefránek, Ján Flouris, Giorgos Comenius Unversity in Bratislava Slovakia FORTH-ICS Greece

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of "classical" logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strategy (CRS), in order to achieve an extended flexibility and generality. Our argumentation semantics is defined in the frame of assumption-based framework (ABF), which enables a unified view on different non-monotonic formalisms. We present an embedding of DeLP into an instance of ABF. Consequently, argumentation semantics defined for ABF are applicable to DeLP. Finally, DeLP with CRS is embedded into GLP. this transformation enables to commute argumentation semantics of a DeLP via semantics of the corresponding GLP.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PPI - A portable prolog interface for java 28

PPI - A portable prolog interface for java

引用

28th workshop on (constraint) logic programming, WLP 2014 and 23rd international workshop on functional and (constraint) logic programming, wflp 2014

作者： Ostermayer, Ludwig Flederer, Frank Seipel, Dietmar University of Würzburg Department of Computer Science Am Hubland WürzburgD - 97074 Germany

As a first step to combine the two programming paradigms - objectoriented programming and logic programming - we have introduced a generic default mapping for JAVA objects and PROLOG terms. this mapping can be used without any modification to the JAVA classes that stand behind the objects. We also can generate automatically JAVA classes from predicates in PROLOG that map to each other. Apart from the default mapping it is further possible to customise the mapping by JAVA annotations. this allows for different Prolog-Views on a given class in JAVA. the data exchange format between JAVA and PROLOG is a simple textual representation of the JAVA objects and of the terms in PROLOG. Because this textual representation already conforms PROLOG's syntax, it can be directly used within PROLOG. In a second step we have to develop the link between JAVA and PROLOG that executes the mapping and communication. We already have presented a connector architecture for PROLOG and JAVA and an example interface that successfully uses our object term mapping with high performance. However, this interface depends heavily on a single PROLOG implementation: SWI-PROLOG. But as we have a generic mapping between JAVA objects and PROLOG terms, we also strive for an interface that also is generic and can be used independently of the PROLOG implementation. In this paper, we present the Portable Prolog Interface (PPI) for JAVA that uses the standard streams stdin, stdout and stderr to communicate with a PROLOG instance. Because these standard streams are available for all popular operating systems and are used by most of the PROLOG implementations for the user interaction, the PPI works for a broad range of PROLOG implementations. We evaluate our new generic interface PPI with different PROLOG engines and without changing the underlying JAVA or PROLOG source code of our tests.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：