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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

158 篇 会议
14 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

123 篇 工学
- 119 篇 计算机科学与技术...
- 79 篇 软件工程
- 20 篇 电气工程
- 4 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 农业工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 环境科学与工程（可...
42 篇 理学
- 37 篇 数学
- 9 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
13 篇 管理学
- 8 篇 管理科学与工程(可...
- 6 篇 工商管理
- 5 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

26 篇 logic programmin...
9 篇 mathematical log...
9 篇 programming lang...
9 篇 artificial intel...
8 篇 logics and meani...
8 篇 constraint theor...
7 篇 programming tech...
5 篇 constraint satis...
5 篇 semantics
4 篇 constraint logic...
4 篇 computer program...
4 篇 functional progr...
3 篇 object oriented ...
3 篇 prolog (programm...
3 篇 software enginee...
3 篇 computer system ...
2 篇 computer science
2 篇 computer circuit...
2 篇 theory of comput...
2 篇 formal logic

机构

3 篇 ercis leonardo-c...
3 篇 univ complutense...
2 篇 institut für inf...
2 篇 fraunhofer first
2 篇 institut für wir...
2 篇 fraunhofer first...
2 篇 institut für inf...
2 篇 department of in...
2 篇 department of co...
2 篇 cau kiel inst in...
2 篇 michigan state u...
2 篇 htwk leipzig fak...
1 篇 arm inc architec...
1 篇 inria
1 篇 kielce univ tech...
1 篇 facoltà di scien...
1 篇 penn state univ ...
1 篇 singapore manage...
1 篇 univ politecn ca...
1 篇 lomonosov moscow...

作者

8 篇 hanus michael
4 篇 michael hanus
3 篇 hofstedt petra
3 篇 dageförde jan c.
3 篇 kuchen herbert
3 篇 antoy sergio
2 篇 waldmann johanne...
2 篇 sarna-starosta b...
2 篇 teegen finn
2 篇 winkelmann hendr...
2 篇 liu ke
2 篇 caballero rafael
2 篇 lepper markus
2 篇 dillon laura k.
2 篇 ricardo rocha
2 篇 seipel dietmar
2 篇 mossakowski till
2 篇 dasseville ingma...
2 篇 leuschel michael
2 篇 löffler sven

语言

175 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=18th International Workshop on Functional and Constraint Logic Programming"

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Correcting Large Knowledge Bases Using Guided Inductive logic Learning Rules 18th

Correcting Large Knowledge Bases Using Guided Inductive Logi...

引用

18th Pacific Rim international Conference on Artificial Intelligence, PRICAI 2021

作者： Wu, Yan Zhang, Zili Wang, Guodong College of Computer and Information Science Southwest University Chongqing400715 China

ISBN: (纸本)9783030891879

Domain-oriented knowledge bases (KBs) such as DBpedia and YAGO are largely constructed by applying a set of predefined extraction rules to the semi-structured contents of Wikipedia articles. Although both of these large-scale KBs achieve very high average precision values (above 95% for DBpedia (the estimated precision of those statements is 95% in the Data Set 3.9 of DBpedia) and YAGO), subtle mistakes in a few of the underlying extraction rules may still impose a substantial amount of mistakes derived from specific relations. By applying the same regular expressions to detect mistakes of range constraint of relation, some special features of negative statements are erased while mining the rules. For traditional rule-learning approaches based on Inductive logic programming (ILP), it is very difficult to correct these extraction mistakes from the Wikipedia, since they usually occur only in a relatively small subdomain of the relations’ arguments. In this paper, we thus propose a GILLearn, a Guided Inductive logic Learning model, which iteratively asks for small amounts of feedback automatically over a given KB to learn a set of knowledge correction rules. the GILLearn introduces the guided information to rule augmentation and provides the respective metrics for the validation of corrected triples. Our experimental evaluation demonstrates that the proposed framework achieves the significant performance on the large knowledge bases. © 2021, Springer Nature Switzerland AG.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

the Regularization of Small Sub-constraint Satisfaction Problems 22nd

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

引用

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Declarative programming for Microcontrollers - Datalog on Arduino 22nd

Declarative Programming for Microcontrollers - Datalog on Ar...

引用

作者： Wenzel, Mario Brass, Stefan 06099 Germany

ISBN: (纸本)9783030467135

In this paper we describe a novel approach to programming microcontrollers based on the Arduino platform using Datalog as a clear and concise description language for system behaviors. the application areas of cheap and easily programmable microcontroller platforms, like robotics, home automation, and IoT devices hold mainstream appeal and are often used as motivation in natural science and technology teaching. the choice of programming languages for microcontrollers is severely limited, especially with regard to rule-based declarative languages. We use an approach that is based on the Dedalus language augmented with operations that allow for side-effects and we also take the limited resources of a microcontroller into account. Our compiler and runtime environment allow to run Datalog programs on Arduino-based systems. © 2020, Springer Nature Switzerland AG.

关键词： Microcontrollers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Application of linier fuzzy multi-objective programming model in travelling salesman problem 10

Application of linier fuzzy multi-objective programming mode...

引用

10th international Conference and workshop on High Dimensional Data Analysis, ICW-HDDA 2020

作者： Hertini, E. Nahar, J. Supriatna, A.K. Department of Mathematics Universitas Padjadjaran Jl. Raya Bandung Sumedang km 21 Jatinangor Sumedang45363 Indonesia

Traveling salesman problem is a problem where a salesman must visit a number of cities, each of which is visited exactly once only, and has to start from and return to the origin city. the objective of this traveling salesman is to determine an optimal travel route by minimizing travel cost or travel distance. If a decision maker wants to determine an optimal route by minimizing travel cost and distance simultaneously, they need more than one destination function, and therefore traveling salesman problem can be formulated as a multi-objective problem. In a traveling salesman problem, salesman make decisions by choosing an optimal route based on an expected measurement. In fact, a number of real problems cannot be expressed as a constraint function and resources in a definite form, so it is necessary to use fuzzy logic which allows us for making decisions based on bias or incorrect data. this paper will discuss a solution to the traveling salesman problem by using a fuzzy multi-objective model, which aims to determine an optimal route of the salesman. Results obtained from data processing of five places to visit by using a Maple 18 software included minimum cost, distance, and time with satisfaction level α = 0.89. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：