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

11th IEEE/ACM International Workshop in Automation of Software Test (AST)

作者： Mnad, Mouna Tka Deleuze, Christophe Parissis, Ioannis Launay, Jackie Gning, Jean Baptiste Univ Grenoble Alpes LCIS F-26000 Valence France InnoVista Sensors F-26902 Valence France

ISBN: (纸本)9781450341516

This paper addresses the problem of automating the production of test sequences for a particular class of Programmable logic Controllers (em4) produced by InnoVista Sensors (1). The latter are synchronous systems and are programmed by means of an ad hoc integrated development environment (IDE). People using and programming such controllers are not necessarily experienced programmers, so the development of software applications must be simple and intuitive. This should also be the case for testing. Until now, the design of test input sequences is informal and testing is interactively performed by programmers using a simulator included in the IDE. Based on previous investigations on testing of synchronous programs, we propose a method to automatically generate test inputs sequences for synchronous controllers. In a previous paper we presented a new test specification language, called SPTL (Synchronous Programs Testing Language) that makes possible to simply express test scenarios. In this paper, we present a prototype tool that we designed and developed, named "Testium", that translates a SPTL program into a set of constraints exploited by a Prolog solver to randomly choose test inputs.

关键词： Software testing synchronous approach automatic test data generation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

DELTASTAR - A GENERAL ALGORITHM FOR INCREMENTAL SATISFACTION OF constraint HIERARCHIES 11

DELTASTAR - A GENERAL ALGORITHM FOR INCREMENTAL SATISFACTION...

引用

11TH ANNUAL INTERNATIONAL PHOENIX CONF ON COMPUTERS AND COMMUNICATIONS ( IPCCC-92 )

作者： FREEMANBENSON, B WILSON, M BORNING, A University of Victoria Computer Science P.O. Box 3055 Victoria V8W3P6 BC Canada University of Washington Department of Computer Science and Engineering FR-35 Seattle 98195 WA United States

ISBN: (纸本)0780306058

The efficient satisfaction of constraints is crucial for the implementation of constraint programming languages and systems, such as ThingLab 11, CLP(R), CHIP, Prolog-111, and Kaleidoscope. Previously, we defined the notion of constraint hierarchies, which allow both required and preferential constraints. We have successfully used constraint hierarchies in a number of languages and systems. For our second generation implementation of these systems, we designed the DELTASTARin cremental constraint hierarchy solver. DELTASTARis a framework for incremental solvers built above an existing flat solver that provides the actual constraint solving techniques. By plugging different flat solvers into DELTASTARdi,f ferent hierarchical solvers can quickly be produced and experimented with. We discuss two implementations of DELTASTARa,s well as previous algorithms that can be viewed as instances of DELTASTAR. © 1992 IEEE.

关键词： NONTRADITIONAL LANGUAGES constraintS constraint HIERARCHIES constraint logic programming GRAPHICS AND OBJECT-ORIENTED programming

来源：评论

学校读者我要写书评

暂无评论

Modeling Block Structured Project Scheduling with Resource constraints 12th

Modeling Block Structured Project Scheduling with Resource C...

引用

12th International Conference on Large-Scale Scientific Computations (LSSC)

作者： Badica, Amelia Badica, Costin Logofatu, Doina Buligiu, Ion Ciora, Liviu Univ Craiova Craiova Romania Univ Appl Sci Frankfurt Germany

ISBN: (纸本)9783030410322;9783030410315

We propose a formal model of block-structured project scheduling with resource constraints, with the goal of designing optimization algorithms. We combine block structured modeling of business processes with results from project scheduling literature. Differently from standard approaches, here we focus on block structured scheduling processes. Our main achievement is the formulation of an abstract mathematical model of block-structured resource-constrained scheduling processes. We tested the correctness and feasibility of our approach using an initial experimental prototype based on constraint logic programming.

关键词： Project scheduling Process algebra Ordering and resource constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Intensional sets in CLP

引用

19th International Conference on logic programming

作者： Dovier, A Pontelli, E Rossi, G Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Parma Dipartimento Matemat I-43100 Parma Italy

ISBN: (纸本)3540206426

We propose a parametric introduction of intensionally defined sets into any CLP(D) language. The result is a language CLP({D}), where constraints over sets of elements of D and over sets of sets of elements, and so on, can be expressed. The semantics of CLP({D}) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in CLP({D}) and propose algorithms for constraints simplification.

关键词： constraint logic programming sets aggregates

来源：评论

学校读者我要写书评

暂无评论

Solving functional constraints by variable substitution

引用

THEORY AND PRACTICE OF logic programming 2011年第2-3期11卷 297-322页

作者： Zhang, Yuanlin Yap, Roland H. C. Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Univ Singapore Sch Comp Singapore 117417 Singapore

Functional constraints and bi-functional constraints are an important constraint class in constraint programming (CP) systems, in particular for constraint logic programming (CLP) systems. CP systems with finite domain constraints usually employ constraint Satisfaction Problem(s)-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other nonfunctional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

关键词： constraint logic programming constraint satisfaction problem Functional constraints Variable substitution Arc consistency

来源：评论

学校读者我要写书评

暂无评论

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

引用

COMPUTERS & CHEMICAL ENGINEERING 2005年第6期29卷 1277-1291页

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：