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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

198 篇 期刊文献
95 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

265 篇 工学
- 243 篇 计算机科学与技术...
- 104 篇 软件工程
- 28 篇 电气工程
- 25 篇 控制科学与工程
- 10 篇 信息与通信工程
- 6 篇 化学工程与技术
- 4 篇 机械工程
- 3 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 环境科学与工程（可...
- 2 篇 网络空间安全
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 城乡规划学
87 篇 理学
- 82 篇 数学
- 2 篇 生物学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 地理学
37 篇 管理学
- 33 篇 管理科学与工程(可...
- 8 篇 工商管理
- 3 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
- 1 篇 理论经济学
6 篇 医学
- 4 篇 基础医学(可授医学...
3 篇 教育学
- 3 篇 教育学
1 篇 农学

主题

296 篇 constraint logic...
27 篇 mathematical pro...
17 篇 optimization
16 篇 logic programmin...
16 篇 scheduling
14 篇 program transfor...
11 篇 decision support
10 篇 program verifica...
8 篇 artificial intel...
8 篇 prolog
7 篇 clp
7 篇 constraint satis...
7 篇 symbolic executi...
6 篇 languages
6 篇 decision support...
6 篇 program analysis
6 篇 test case genera...
6 篇 abstract interpr...
6 篇 constraint solvi...
6 篇 constructive neg...

机构

8 篇 kielce univ tech...
6 篇 cnr iasi rome
6 篇 kielce univ tech...
5 篇 univ roma tor ve...
5 篇 univ craiova cra...
5 篇 new mexico state...
5 篇 univ udine dipar...
4 篇 kielce univ tech...
3 篇 univ pisa dipart...
3 篇 univ melbourne d...
3 篇 kielce univ tech...
3 篇 univ parma dipar...
3 篇 iasi cnr i-00185...
3 篇 carnegie mellon ...
3 篇 natl univ singap...
3 篇 imdea software i...
3 篇 g dannunzio univ...
3 篇 univ roma tor ve...
3 篇 univ parma dipar...
3 篇 tech univ gheorg...

作者

25 篇 sitek pawel
22 篇 wikarek jaroslaw
13 篇 proietti maurizi...
12 篇 pettorossi alber...
12 篇 fioravanti fabio
8 篇 de angelis emanu...
6 篇 badica amelia
6 篇 senni valerio
6 篇 mesnard fred
6 篇 badica costin
6 篇 rossi gianfranco
5 篇 cristia maximili...
4 篇 gavanelli marco
4 篇 stefanski tadeus...
4 篇 stuckey pj
4 篇 dovier agostino
4 篇 dovier a
4 篇 hermenegildo m
4 篇 pontelli enrico
4 篇 leon florin

语言

270 篇 英文
25 篇 其他
1 篇 德文

检索条件"主题词=Constraint Logic Programming"

共 296 条记录，以下是241-250 订阅

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

详细简洁

排序：

Railway controller synthesis based on system requirements

引用

IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)

作者： Bourdeaud'huy, Thomas Yim, Pascal Ecole Cent Lille LAGIS UMR 8021 BP 48 F-59651 Villeneuve Dascq France

ISBN: (纸本)9787302139225

In this paper, we present a conception methodology based on system requirements, whithin which we propose to integrate formalisation and verification into the same process. This method uses the constraint programming paradigm to synthesize Petri nets corresponding to a formal expression of requirements as constraints over the PN structure. Some additional techniques are provided to incrementaly refine the synthesized net until it satisfies the whole requirements. http://***/stamp/***?tp=&arnumber=4281812

关键词： Petri Nets Synthesis Supervisory Control constraint logic programming Requirements Engineering computer-aided modelisation

来源：评论

学校读者我要写书评

暂无评论

A Robust Approach to Employee Competences in Project Management 13th

A Robust Approach to Employee Competences in Project Managem...

引用

13th Asian Conference on Intelligent Information and Database Systems (ACIIDS)

作者： Wikarek, Jaroslaw Sitek, Pawel Kielce Univ Technol Kielce Poland

ISBN: (纸本)9783030732790;9783030732806

In modern knowledge-based economy most of new undertakings are accomplished in the form of projects. The critical elements in project management used to be resources and time. Due to continuous technological development of automation, robotization and IT, the access to the resources ceases to be the key issue. Nevertheless, the employees with specific competences engaged in realization of a given project have become a critical resource. It is so mainly due to the fact that not all employee competences can be replaced by a machine or software. Additionally, employees can be temporarily unavailable, change the terms of employment, etc. Prior to starting any new project, the manager has to answer a few key questions concerning this resource, e.g.: Does the team accomplishing the project possess sufficient set of competences? If not, which and how many competences are missing? The answer to these questions can determine the success or failure of a project even prior to its start. The paper presents an employee competences configuration model which makes it possible to answer the above-mentioned questions and quickly verifies the feasibility of a given project in terms of the set of the team competences. Another possible way the proposed model might be used is to evaluate the robustness of the project realization taking into account the team competences.

关键词： Project management Employee competences Decision support Mathematical programming constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

A hybrid MILP/CLP algorithm for multipurpose batch process s...

引用

14th European Symposium on Computer Aided Process Engineering (ESCAPE-14)

作者： Roe, B Papageorgiou, LG Shah, N Univ London Imperial Coll Sci Technol & Med Ctr Proc Syst Engn Dept Chem Engn London SW7 2AZ England UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

This paper presents a novel hybrid constraint logic programming (CLP) and MILP algorithm for scheduling complex multipurpose batch processes. The scheduling problem is decomposed into two sub-problems: first an aggregate planning problem is solved using an MILP model, and then a sequencing problem is solved using CLP techniques. The CLP model avoids the complexity of explicitly stating complete material balance constraints by instead using precedence constraints between batches to ensure the schedule is feasible. The efficiency of the algorithm is demonstrated with four examples and areas for future improvement are identified. (c) 2005 Published by Elsevier Ltd.

关键词： MlLP/CLP algorithm constraint logic programming process scheduling

来源：评论

学校读者我要写书评

暂无评论

An Improved logic-Based Implementation to Ontology Assessment 6

An Improved Logic-Based Implementation to Ontology Assessmen...

引用

6th Brazilian Conference on Intelligent Systems (BRACIS)

作者： de Oliveira Rodrigues, Cleyton Mario Goncalves de Freitas, Frederico Luiz de Azevedo, Ryan Ribeiro Univ Pernambuco UPE Garanhuns PE Brazil Univ Fed Pernambuco CIn POB 7851 Recife PE Brazil Univ Fed Rural Pernambuco Garanhuns PE Brazil

ISBN: (纸本)9781538624074

With the advent of the Semantic Web, ontology engineering has produced thousands of conceptual models. In this context, ontological evaluation is a crucial and imperative task, enabling reuse and the models' evolution. Several frameworks have been proposed in the literature for quality and correctness assessment as OntoClean, a very subjective methodology based on the user's knowledge to ascertain meta properties to the concepts of ontology, in order to find out disparities with respect the real domain. Unfortunately, OntoClean only applies to Ontologies whose concepts were completely labeled by the user. Due to the lack of stable OntoClean implementations and the imposed limitation, this paper presents an implementation in a general constraint logic-based language, which is still useful to partially labeled ontologies. At the end, some of scalability and efficiency tests are demonstrated.

关键词： constraint logic programming Knowledge Representation Ontology Evaluation

来源：评论

学校读者我要写书评

暂无评论

Modeling and Solving the Soft constraints for Supply Chain Problems Using the Hybrid Approach 13th

引用

13th International Conference on Distributed Computing and Artificial Intelligence (DCAI)

作者： Sitek, Pawel Kielce Univ Technol Dept Informat Syst Kielce Poland

ISBN: (纸本)9783319401621;9783319401614

Many real-life problems in Supply Chain (SC) are over-constrained. Insufficient resources and time requirements result in an inability to all constraints. In some cases, their fulfillment requires very intensive computing. One way to overcome these difficulties is to soften some of the constraints. Natural environment for the modeling and solving of problems with constraints is constraint programming (CP), which is, however, ineffective on optimization problems and constraints containing a sum of many decision variables. This is when the idea to hybridize CP and other environments originated. The article presents the concept of modeling and solving soft constraints in SC problems using the hybrid approach. The illustrative example provided in the paper illustrates effectiveness and possibilities of this approach.

关键词： Soft constrains constraint logic programming Optimization Mathematical programming Supply Chain

来源：评论

学校读者我要写书评

暂无评论

A model-based design-for-verification approach to checking for deadlock in multi-threaded applications

A model-based design-for-verification approach to checking f...

引用

18th International Conference on Software Engineering and Knowledge Engineering

作者： Sarna-Starosta, Beata Stirewalt, R. E. K. Dillon, Laura K. Michigan State Univ Dept Comp Sci & Engn Software Engn & Network Syst Labs E Lansing MI 48824 USA

ISBN: (纸本)9781627486606

This paper explores an approach to design for verification in systems built atop a middleware framework which separates synchronization concerns from the "core-functional logic" of a program. The framework is based on a language-independent compositional model of synchronization contracts, called Szumo, which integrates well with popular OO design artifacts and provides strong guarantees of non-interference for a class of strictly exclusive systems. An approach for extracting models from Szumo design artifacts and analyzing the generated models to detect deadlocks is described. A key decision was to use constraint Handling Rules to express the semantics of synchronization contracts, which allowed a transparent model of the implementation logic.

关键词： concurrency analysis constraint logic programming design for verification

来源：评论

学校读者我要写书评

暂无评论

Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem

Declarative Representation and Solution of Vehicle Routing w...

引用

International Conference on Computational Science (ICCS)

作者： Badica, Amelia Badica, Costin Leon, Florin Luncean, Lucian Univ Craiova Craiova Romania Univ Gheorghe Asachi Iasi Iasi Romania Romanian German Univ Sibiu Sibiu Romania

Recently we have proposed a multi-agent system that provides an intelligent logistics brokerage service focusing on the transport activity for the efficient allocation of transport resources (vehicles or trucks) to the transport applications. The freight broker agent has a major role to coordinate transportation arrangements of transport customers (usually shippers and consignees) with transport resource providers or carriers, following the freight broker business model. We focus on the fundamental function of this business that aims to find available trucks and to define their feasible routes for transporting requested customer loads. The main contribution of this paper is on formulating our scheduling problem as a special type of vehicle routing with pickup and delivery problem. We propose a new set partitioning model of our specific problem. Vehicle routes are defined on the graph of cities, rather than on the graph of customer orders, as typically proposed by set partitioning formulations. This approach is particularly useful when a large number of customer orders sharing a significantly lower number of pickup and delivery points must be scheduled. Our achievement is the declarative representation and solution of the model using ECLiPSe state-of-the-art constraint logic programming system. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： constraint logic programming vehicle routing pickup and delivery problem

来源：评论

学校读者我要写书评

暂无评论

A constraint-Based Framework for Scheduling Problems 10th

A Constraint-Based Framework for Scheduling Problems

引用

10th Asian Conference on Intelligent Information and Database Systems (ACIIDS)

作者： Wikarek, Jaroslaw Sitek, Pawel Stefanski, Tadeusz Kielce Univ Technol Inst Management & Control Syst Al 1000 Lecia PP 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319754178;9783319754161

Scheduling and resource allocation problems are widespread in many areas of today's technology and management. Their different forms and structures appear in production, logistics, software engineering, computer networks, etc. In practice, however, classical scheduling problems with fixed structures and only standard constraints (precedence, disjoint etc.) are rare. Practical scheduling problems include also logical and non-linear constraints and use non-standard criteria of schedule evaluations. In many cases, decision makers are interested in the feasibility and/or optimality of a given schedule for specified conditions formulated as questions, for example, Is it possible.?, What is the minimum/ maximum.?, What if ..? etc. Thus there is a need to develop a programming framework that will facilitate the modeling and solving a variety of diverse scheduling problems. This paper proposes such a constraint-based framework for modeling and solving scheduling problems. It was built with the CLP (constraint logic programming) environment and supported with MP (Mathematical programming).

关键词： Scheduling constraint logic programming Mathematical programming optimization Hybrid methods Decision support systems

来源：评论

学校读者我要写书评

暂无评论

A Hybrid programming Framework for Resource-Constrained Scheduling Problems 16th

A Hybrid Programming Framework for Resource-Constrained Sche...

引用

16th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL)

作者： Sitek, Pawel Wikarek, Jaroslaw Tech Univ Kielce Control & Management Syst Sect Al Tysiaclecia Panstwa Polskiego 7 PL-25314 Kielce Poland

ISBN: (纸本)9783319248349;9783319248332

Resource-constrained scheduling problems appear frequently at different levels of decisions in manufacturing, logistics, computer networks, software engineering etc. They are usually characterized by many types of constraints, which often make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming (MP) approaches are deficient because their representation of allocation constraints is artificial (using 0-1 variables). Unlike traditional approaches, declarative constraint logic programming (CLP) provides for a natural representation of heterogeneous constraints. In CLP we state the problem requirements by constraints;we do not need to specify how to meet these requirements. CLP approach is very effective for binary constraints (binding at most two variables). If there are more variables in the constraints and the problem requires further optimization, the efficiency decreases dramatically. This paper presents a hybrid programming framework for constrained scheduling problems where two environments (mathematical programming and constraint logic programming) were integrated. This integration, hybridization as well as a transformation of the problem helped reduce the combinatorial problem substantially. In order to compare the effectiveness of the proposed framework, also made implementation of illustrative example separately for the two environments MP and CLP.

关键词： constraint logic programming Mathematical programming Scheduling Decision support Hybrid approach

来源：评论

学校读者我要写书评

暂无评论

Generation of functional test sequences from B formal specifications - Presentation and industrial case-study 16

Generation of functional test sequences from B formal specif...

引用

16th IEEE Annual International Conference on Automated Software Engineering (ASE 2001)

作者： Legeard, B Peureux, F Univ Franche Comte Lab Informat F-25030 Besancon France

ISBN: (纸本)076951426X;0769514278

This paper presents an original method to generate test sequences. From formal specifications of the system to be tested, an equivalent system of constraints is derived, and then, the domain of each state variable of this system is partitioned into subdomains. Using this partition, limit states are computed with a specific solver that uses constraint logic programming with sets. This specific solver is then used to build test sequences by traversing the constrained reachability graph of the specifications. Finally, the formal specifications is used as an oracle by using them to determine the expected output for a given input. The results of an industrial case-study of the Smart Card GSM 11-11 standard are presented and discussed.

关键词： specification-based testing B notation constraint logic programming GSM 11-11 standard

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共30页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：