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

Model based testing in incremental system development

JOURNAL OF SYSTEMS AND SOFTWARE 2004年第3期70卷 315-329页

作者： Pretschner, A Lötzbeyer, H Philipps, J Tech Univ Munich Inst Informat D-85748 Garching Germany

The spiraling nature of evolutionary software development processes produces executable parts of the system at the end of each loop. It is argued that these parts should consist not only of programming language code, but of executable graphical system models. As a main benefit of the use of more abstract, yet formal, modeling languages, a method for model based test sequence generation for reactive systems on the grounds of constraint logic programming as well as its implementation in the CASE tool AUTOFOCUS is presented. (C) 2003 Elsevier Inc. All rights reserved.

关键词： cleanroom SW engineering constraint logic programming extreme programming incremental development rapid prototyping reactive systems test case generation

来源：评论

学校读者我要写书评

暂无评论

Linear relaxations and reduced-cost based propagation of continuous variable subscripts

引用

ANNALS OF OPERATIONS RESEARCH 2002年第1-4期115卷 15-29页

作者： Thorsteinsson, ES Ottosson, G Carnegie Mellon Univ Grad Sch Ind Adm Pittsburgh PA 15213 USA Uppsala Univ Dept Comp Sci S-75105 Uppsala Sweden

In hybrid solvers for combinatorial optimisation, combining constraint (logic) programming (CLP) and Mixed Integer programming (MIP), it is important to have tight connections between the two domains. We extend and generalise previous work on automatic linearisations and propagation of symbolic CLP constraints that cross the boundary between CLP and MIP. We also present how reduced costs from the linear programming relaxation can be used for domain reduction on the CLP side. Computational results comparing our hybrid approach with pure CLP and MIP on a configuration problem show significant speed-ups.

关键词： Mixed Integer programming constraint logic programming integration dynamic linear relaxations reduced costs inference propagation variable subscripts mixed global constraints

来源：评论

学校读者我要写书评

暂无评论

Autonomous Generation of Conflict-Free Examination Timetable Using constraint Satisfaction Modelling

Autonomous Generation of Conflict-Free Examination Timetable...

引用

2017 International Artificial Intelligence and Data Processing Symposium (IDAP)

作者： Elsaka, Tarek Univ Sharjah Sharjah U Arab Emirates CLAES Cairo Egypt

ISBN: (纸本)9781538618806

Examination timetable (ETT) is a complex administrative task at educational institutions that must fulfill various constraints to generate the ETT to schedule exam sessions within a precise period. The ETT problem could be modeled as constraint Satisfaction Problems (CSPs). In addition, it could be particularly investigated by constraint logic programming (CLP) approach. This paper uses a real examination dataset from the Community College (CC), University of Sharjah (UoS). This dataset has very rich data such as the large number of student enrolments related to many departments, an accumulative number of combined courses, low number of exam halls, very limited timeslots, low number of invigilators and distant campuses. This dataset has many practical constraints to be satisfied such as a course taught at many campuses must has the same exam date and an invigilator can invigilate at any campus. This paper applies the CSP definitions as well as the Optimization programming Language (OPL) to model the ETT dataset and automatically generate a conflict-free ETT solution using a CLP Solver. Finally, it uses the results to satisfy the proposed constraints in the model.

关键词： Index Examination Timetable Scheduling Planning constraint Satisfaction constraint logic programming Optimization programming Language

来源：评论

学校读者我要写书评

暂无评论

Constructive Negation of Arithmetic constraints Using Dataflow Graphs

引用

constraints 1997年第2期2卷 131-162页

作者： Cleary, John G. Department of Computer Science University of Waikato Hamilton New Zealand

A system which extracts a dataflow graph from sets of arithmetic constraints is described. This information is used to simplify constraints and to extract positive information from negations of constraints. The context for this work is a Prolog implementation where intervals are used to represent the underlying arithmetic variables. The system uses simple information about the existence of solutions of primitive constraints to derive the dataflow graph. This makes the system easily extensible to new primitives and domains. A practical implementation over both real and integer arithmetic is described and an extended example of its application given.

关键词： constraint logic programming Contructive negation Interval arithmetic logic programming

来源：评论

学校读者我要写书评

暂无评论

A constraint-Based Mathematical Modeling Library in Prolog with Answer constraint Semantics 17th

A Constraint-Based Mathematical Modeling Library in Prolog w...

引用

17th International Symposium on Functional and logic programming (FLOPS)

作者： Fages, Francois Inria Saclay Palaiseau France

ISBN: (纸本)9789819722990;9789819723003

constraint logic programming emerged in the late 80's as a highly declarative class of programming languages based on first-order logic and theories with decidable constraint languages, thereby subsuming Prolog restricted to equality constraints over the Herbrand's term domain. This approach has proven extremely successful in solving combinatorial problems in the industry which quickly led to the development of a variety of constraint solving libraries in standard programming languages. Later came the design of a purely declarative front-end constraint-based modeling language, MiniZinc, independent of the constraint solvers, in order to compare their performances and create model benchmarks. Beyond that purpose, the use of a high-level modeling language such as MiniZinc to develop complete applications, or to teach constraint programming, is limited by the impossibility to program search strategies, or new constraint solvers, in a modeling language, as well as by the absence of an integrated development environment for both levels of constraint-based modeling and constraint solving. In this paper, we propose to solve those issues by taking Prolog with its constraint solving libraries, as a unified relation-based modeling and programming language. We present a Prolog library for high-level constraint-based mathematical modeling, inspired by MiniZinc, using subscripted variables (arrays) in addition to lists and terms, quantifiers and iterators in addition to recursion, together with a patch of constraint libraries in order to allow array functional notations in constraints. We show that this approach does not come with a significant computation time overhead, and presents several advantages in terms of the possibility of focussing on mathematical modeling, getting answer constraints in addition to ground solutions, programming search or constraint solvers if needed, and debugging models within a unique modeling and programming environment.

关键词： constraint logic programming algebraic modeling languages answer constraints MiniZinc meta-predicates constraint solving constraint simplification attributed variables ISO-Prolog

来源：评论

学校读者我要写书评

暂无评论

Extension of Model Functionalities for Multi-echelon Distribution Systems Through the Introduction of logical constraints

引用

International Conference Challenges in Automation, Robotics and Measurement Techniques (Automation)

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

ISBN: (纸本)9783319293578;9783319293561

Multi-echelon distribution systems are quite common in supply-chain and city logistic systems. The paper presents a concept of extending functionality of the multi-distribution models by introduction logical constraints. This is possible by using a hybrid approach to modeling and optimization the multi-echelon problems. In the hybrid approach, two environments of mathematical programming (MP) and constraint logic programming (CLP) were integrated. logical constraints are associated with the transformation of the problem made by the CLP. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) has been proposed as an illustrative example. The logical constraints on routes, cities etc. were introduced to the standard 2E-CVRP model. The presented approach will be compared with classical mathematical programming on the same data sets (known benchmarks).

关键词： Multi-echelon distribution systems constraint logic programming Mathematical programming logical constraints

来源：评论

学校读者我要写书评

暂无评论

Optimization of Freight Transportation Brokerage Using Agents and constraints 18th

引用

18th International Conference on Engineering Applications of Neural Networks (EANN)

作者： Badica, Amelia Badica, Costin Leon, Florin Danciulescu, Daniela Univ Craiova Craiova Romania Tech Univ Gheorghe Asachi Iasi Iasi Romania

ISBN: (纸本)9783319651729;9783319651712

In this paper we address the problem of declarative modeling of freight transportation brokering using agents and constraints. Our model can be used for the optimization of vehicle assignments to customer orders that request the transportation of freight from source to destination points. The advantage is that a single vehicle can serve multiple customer orders on its multi-hop route that is part of a solution schedule. Our model is mapped to the ECLiPSe constraint logic programming system such that optimal schedules can be automatically computed using the available constraint solvers. We propose a method and protocol for integrating this constraint-based scheduler into a multi-agent system.

关键词： Combinatorial optimization Pickup and delivery problem constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Semantics-based generation of verification conditions by program specialization 15

Semantics-based generation of verification conditions by pro...

引用

17th International Symposium on Principles and Practice of Declarative programming (PPDP)

作者： De Angelis, E. Fioravanti, F. Pettorossi, A. Proietti, M. Univ G dAnnunzio DEC Chieti Italy Univ Roma Tor Vergata DICII Rome Italy CNR IASI Rome Italy

ISBN: (纸本)9781450335164

We present a method for automatically generating verification conditions for a class of imperative programs and safety properties. Our method is parametric with respect to the semantics of the imperative programming language, as it specializes, by using unfold/fold transformation rules, a Horn clause interpreter that encodes that semantics. We define a multi-step operational semantics for a fragment of the C language and compare the verification conditions obtained by using this semantics with those obtained by using a more traditional small-step semantics. The flexibility of the approach is further demonstrated by showing that it is possible to easily take into account alternative operational semantics definitions for modeling new language features. Finally, we provide an experimental evaluation of the method by generating verification conditions using the multi-step and the small-step semantics for a few hundreds of programs taken from various publicly available benchmarks, and by checking the satisfiability of these verification conditions by using state-of-the-art Horn clause solvers. These experiments show that automated verification of programs from a formal definition of the operational semantics is indeed feasible in practice.

关键词： Software model checking program verification program specialization semantics of programming languages verification conditions constraint logic programming Horn clauses

来源：评论

学校读者我要写书评

暂无评论

Competency Management Model for a Team of Trainers 1

引用

14th International Conference on Computational Collective Intelligence (ICCCI)

作者： Wikarek, Jaroslaw Sitele, Pawel Kielce Univ Technol Dept Control & Management Syst Kielce Poland

ISBN: (数字)9783031160141

ISBN: (纸本)9783031160141;9783031160134

The paper proposes a model of management and configuration of competences of a team conducting advanced training in the field of IT, electronics, robotics and other advanced technologies. The model enables decision support in managing the training team and finding answers to numerous questions in this area. The most important questions include: Does the team have the appropriate composition and competences to conduct a training cycle in accordance with a given schedule? What competences are missing in the team to conduct the training cycle? What composition of the team of trainers ensures that the trainings can be conducted as scheduled in the absence of any trainer? etc. The model was formulated as a set of questions and a set of constraints. An approach that integrates mathematical programming and constraint logic programming was used to implement the model. The data has been saved in the form of facts, which enables their storage in both SQL and NoSQL databases and easy integration with decision support systems.

关键词： Competency management Personnel assignment problem (PAP) Decision support Mathematical programming constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

An Integrated Declarative Approach to Decision Support for Scheduling Groups of Jobs 36th

An Integrated Declarative Approach to Decision Support for S...

引用

36th International Conference on Information Systems Architecture and Technology (ISAT)

作者： Wikarek, Jaroslaw Kielce Univ Technol Dept Control & Management Syst Kielce Poland

ISBN: (纸本)9783319285559;9783319285535

This study deals with scheduling groups of jobs, their arrival and delivery, and individual processing of each of them. All jobs in a group should be delivered at the same time after processing. The author presents a novel way of modeling and decision support-an integrated declarative approach. This approach includes the modeling and solving of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming). In addition, the paper proposes the transformation and linearization of the model in CLP/MP environment and implementation framework. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager.

关键词： Mathematical programming constraint logic programming Optimization Decision support systems Scheduling Group work Soft constraints

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：