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

NEW GENERATION COMPUTING 1993年第3-4期11卷 449-469页

作者： JAFFAR, J MAHER, MJ STUCKEY, PJ YAP, RHC UNIV MELBOURNE DEPT COMP SCIPARKVILLEVIC 3052AUSTRALIA MONASH UNIV DEPT COMP SCICLAYTONVIC 3168AUSTRALIA

The presentation of constraints in a usable form is an essential aspect of constraint logic programming (CLP) systems. It is needed both in the output of constraints, as well as in the production of an internal representation of constraints for meta-level manipulation. Typically, only a small subset x of the variables in constraints is of interest, and so an informal statement of the problem at hand is: given a conjunction c(x,y) of constraints, express the projection there exists y c(x,y) of c onto x in the simplest form. In this paper, we consider the constraints of the CLP(R) system and describe the essential features of its projection module. One main part focuses on the well-known problem of projection in linear arithmetic constraints. We start with a classical algorithm and augment it with a procedure for eliminating redundant constraints generated by the algorithm. A second part discusses projection of the other object-level constraints: equations over trees and nonlinear equations. The final part deals with producing a manipulable form of the constraints, which complicates the projection problem.

关键词： constraint logic programming LINEAR ARITHMETIC PROJECTION

来源：评论

学校读者我要写书评

暂无评论

Predicting peptide interactions with model class II MHC structures

引用

INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 2005年第4期14卷 561-575页

作者： Swain, MT Brooks, AJ Kemp, GJL Univ Aberdeen Kings Coll Dept Comp Sci Aberdeen AB24 3UE Scotland

An automated method for constructing 3D models of class II MHC structures that uses constraint logic programming to select side-chain conformations is described. This method follows a comparative modeling approach in basing the model structures on experimentally determined MHC-peptide structures, but it uses constraints to ease open the peptide binding groove so that the modeled MHC structure is a less specific fit for the co-crystallized peptide in the starting structure. The resulting models are used by a "peptide threading" program that attempts to predict peptides from a protein sequence that will bind strongly to particular MHC alleles. Our results indicate that MHC models that have been constructed in this way enable the peptide threading program to make binding predictions that are comparable with those obtained when using experimentally determined MHC structures, suggesting that a combined modeling and peptide threading approach is worth pursuing for MHC molecules for which experimentally determined structures are not available.

关键词： constraint logic programming major histocompatibility complex binding predictions comparative modeling rotamer peptide threading

来源：评论

学校读者我要写书评

暂无评论

A decision support system for waste collection management and its potential improvement with Radio-Frequency Identification Technology (RFID)

引用

INTERNATIONAL JOURNAL OF ENVIRONMENTAL TECHNOLOGY AND MANAGEMENT 2012年第3-6期15卷 305-324页

作者： Nielsen, Izabela Lim, Ming K. Nielsen, Peter Aggarwal, Rebecca Aalborg Univ Dept Mech & Mfg Engn Fibigerstr 16 DK-9220 Aalborg Denmark Aston Univ Sch Engn & Appl Sci RFID Adv Res Engn Syst & Management Logist Management Birmingham B4 7ET W Midlands England Aston Univ Sch Engn & Appl Sci RFID Adv Res Engn Syst & Management Birmingham B4 7ET W Midlands England

Due to vigorous globalisation and product proliferation in recent years, more waste has been produced by the soaring manufacturing activities. This has contributed to the significant need for an efficient waste management system to ensure, with all efforts, the waste is properly treated for recycling or disposed. This paper presents a Decision Support System (DSS) framework, based on constraint logic programming (CLP), for the collection management of industrial waste (of all kinds) and discusses the potential employment of Radio-Frequency Identification Technology (RFID) to improve several critical procedures involved in managing waste collection. This paper also demonstrates a widely distributed and semi-structured network of waste producing enterprises (e.g. manufacturers) and waste processing enterprises (i.e. waste recycling/treatment stations) improving their operations planning by means of using the proposed DSS. The potential RFID applications to update and validate information in a continuous manner to bring value-added benefits to the waste collection business are also presented.

关键词： RFID radio-frequency identification technology reverse logistics waste supply chain management decision support system CLP constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

SD-Solver: Towards a `multidirectional' CLP-based simulation tool. Framework and short financial examples

引用

Computational Economics 1996年第4期9卷 299-315页

作者： Bisiere, Christophe GREMAQ Université de Toulouse 1 Toulouse Cedex France

SD-Solver is a general purpose simulation environment grounded on the constraint logic programming technology. Its main aim is to facilitate the development of Decision Support Systems based on dynamic models. Using SD-Solver, forward and backward simulations can be performed -to some extent- on the basis of a single model. This paper outlines the underlying framework and presents the most important aspects of SD-Solver using two elementary financial examples.[/p]

关键词： constraint logic programming Decision Support System Forward and backward simulations

来源：评论

学校读者我要写书评

暂无评论

Resolution of the cyclic multi-hoists scheduling problem with overlapping partitions

引用

INFOR 1997年第4期35卷 309-324页

作者： Varnier, C Bachelu, A Baptiste, P ENSMM Lab Automat Besancon CNRS URM 6596 F-25000 Besancon France

This paper deals with scheduling problem in electroplating facilities. To maximise the productivity of electroplating lines, a predictive approach can be used to find a sequence of hoist movements that can be cyclically repeated. This NP-hard problem is known as the Cyclic Hoist Scheduling Problem. An approach for the multi-hoists problem is suggested. The presented model uses constraint logic programming for finding the optimal cyclic schedule for a given hoist assignment.

关键词： Hoist Scheduling Problem hoist assignment overlapping zone constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards verification of computation orchestration

引用

FORMAL ASPECTS OF COMPUTING 2014年第4期26卷 729-759页

作者： Dong, Jin Song Liu, Yang Sun, Jun Zhang, Xian Natl Univ Singapore Sch Comp Singapore 117548 Singapore Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore Singapore

Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc programs. The practical implication is that existing tool supports for Timed Automata, e.g., Uppaal, can be used to simulate and model check Orc programs. An experimental tool has been implemented to automate this approach. Secondly, we start with encoding the operational semantics of Orc language in constraint logic programming (CLP), which allows a systematic translation from Orc to CLP. Powerful constraint solvers like CLP are then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, lower or upper bound of a time interval, etc. Counterexamples are generated when properties are not satisfied. Furthermore, the stepwise execution traces can be automatically generated as the simulation steps. The two different approaches give an insight into the verification problem of Web Service orchestration. The Timed Automata approach has its merits in visualized simulation and efficient verification supported by the well developed tools. On the other hand, the CPL approach gives better expressiveness in both modeling and verification. The two approaches com

关键词： Orc Web service orchestration Verification Timed automata Uppaal constraint logic programming CLP(R)

来源：评论

学校读者我要写书评

暂无评论

A pearl on SAT and SMT solving in Prolog

引用

THEORETICAL COMPUTER SCIENCE 2012年 435卷 43-55页

作者： Howe, Jacob M. King, Andy Univ Kent Sch Comp Canterbury CT2 7NF Kent England City Univ London Dept Comp London EC1V 0HB England

A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented as a programming pearl. Furthermore, the SAT solver can be integrated into an SMT framework which exploits the constraint solvers that are available in many Prolog systems. (C) 2012 Elsevier B.V. All rights reserved.

关键词： SAT solving SMT solving Prolog constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Test case generation for object-oriented imperative languages in CLP

引用

THEORY AND PRACTICE OF logic programming 2010年第4-6期10卷 659-674页

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid UPM DLSIIS E-28660 Madrid Spain

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that constraint logic programming (CLP) has a promising application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.

关键词： test case generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A novel approach to decision support and optimization of group job handling for multimodal processes in manufacturing and services 15

A novel approach to decision support and optimization of gro...

引用

15th IFAC Symposium on Information Control Problems in Manufacturing

作者： Sitek, Pawel Wikarek, J. Kielce Univ Technol Dept Control & Management Syst Kielce Poland

This study deals with decision support system and optimization of parallel handling of groups of jobs. All jobs in a group should be delivered at the same time after processing. The authors present a novel hybrid approach, which includes the modelling of the problem in the integrated environment, composed of MP (Mathematical programming) and CLP (constraint logic programming) In addition to the iterative algorithm for solving the hybrid model under dynamic emergence of new orders, the paper proposes the transformation and linearization of the model in CLP/MP environment. Opportunity to ask questions and receive quick answers, taking into account any constraints, conditions and dynamics, constitutes an invaluable support to the manager. The paper proposes new CLP-based functionalities and an illustrative example with the model for service providers (a restaurant). (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： group processing mathematical programming constraint logic programming optimization decision support systems optimization multimodal processes

来源：评论

学校读者我要写书评

暂无评论

Formalizing CSCL Scripts with logic and constraints 13th

Formalizing CSCL Scripts with Logic and Constraints

引用

13th European Conference on Technology Enhanced Learning (EC-TEL)

作者： Papasalouros, Andreas Univ Aegean Dept Math Karlovassi 83200 Greece

ISBN: (纸本)9783319985725;9783319985718

CSCL (Computer-Supported Collaborative Learning) scripts describe pedagogically effective practices for organizing the experiences of individuals when engaged in collaborative activities. This paper presents a new language named COSTLy for describing certain mechanisms of CSCL scripts, namely, group formation and task distribution. The expressiveness of the proposed language is demonstrated by describing jigsaw, a well-known CSCL script. The proposed descriptions are automatically transformed into constraint logic programs which can be executed so as to support group formation in actual scenario instances.

关键词： Learning activity representation Collaborative scripts constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：