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

Combination of local search and CLP in the vehicle-fleet scheduling problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1997年第3期98卷 512-521页

作者： Psarras, J Stefanitsis, E Christodoulou, N Management Systems Unit Department of Electrical and Computer Engineering National Technical University of Athens 42 Patission St. GR 10682 Athens Greece

Vehicle-fleet scheduling is one of the most commonly occurring problems of transport management. In this paper a new approach facing the problem is introduced. It draws upon the combination of the advantages of constraint logic programming (CLP) with the benefits of local search in order to obtain satisfactory results with respect to execution time. CLP is used for generating an initial feasible solution and then for checking every intermediate solution obtained from local search so that it is in accordance with the constraints of the problem. Local search is implemented for the minimisation of the cost of the initial solution. Several local search methods were tested on various cases of the problem and the results obtained are discussed and compared with respect to the cost of the solution and the execution time. (C) 1997 Elsevier Science B.V.

关键词： constraint logic programming local search vehicle-fleet scheduling

来源：评论

学校读者我要写书评

暂无评论

Proactive and reactive approach to employee competence configuration problem in planning and scheduling processes

引用

APPLIED INTELLIGENCE 2022年第3期52卷 3445-3464页

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

At the time of commonplace automation, robotization and the rapid development of IT, high qualifications of employees have become the critical element of every industry system. This follows from their limited availability, frequently high costs of procurement and possible employee absenteeism. Moreover, the concept of Industry 4.0 will transform current industry employees into knowledge employees. This is due to the fact that hard and routine tasks will be executed by robots and computers. This constitutes change in the required employee competences. Unfortunately, the aspect of management and configuration of employee competences is often overlooked in industrial practice. In response to the existing problem, the article puts forward the original model of employee competence configuration which is a basis for responses to numerous questions of managers of production processes, both general ones, e.g., Do we have a sufficient set of competences to execute a production schedule? as well as detailed ones, e.g., Which and how many competences are missing? etc. An important novelty of the presented model is the possibility of its application with both proactive and reactive questions. Due to the discrete and combinatorial nature of the problem under consideration, the use of mathematical programming methods was limited only to small data instances. Therefore, a proprietary dedicated genetic algorithm was proposed to solve this problem, which turned out to be extremely effective. The use of this genetic algorithm has enabled finding a solution depending on the instance data up to 70 times faster than by use of the mathematical programming.

关键词： Proactive and reactive approach Scheduling Resource allocation Genetic algorithms constraint logic programming Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

logic-based decision support for strategic environmental assessment

引用

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

作者： Gavanelli, Marco Riguzzi, Fabrizio Milano, Michela Cagnoli, Paolo Univ Ferrara ENDIF I-44100 Ferrara Italy Univ Bologna DEIS I-40126 Bologna Italy ARPA Emilia Romagna Romagna Italy

Strategic Environmental Assessment is a procedure aimed at introducing systematic assessment of the environmental effects of plans and programs. This procedure is based on the so-called coaxial matrices that define dependencies between plan activities (infrastructures, plants, resource extractions, buildings, etc.) and positive and negative environmental impacts, and dependencies between these impacts and environmental receptors. Up to now, this procedure is manually implemented by environmental experts for checking the environmental effects of a given plan or program, but it is never applied during the plan/program construction. A decision support system, based on a clear logic semantics, would be an invaluable tool not only in assessing a single, already defined plan, but also during the planning process in order to produce an optimized, environmentally assessed plan and to study possible alternative scenarios. We propose two logic-based approaches to the problem, one based on constraint logic programming and one on Probabilistic logic programming that could be, in the future, conveniently merged to exploit the advantages of both. We test the proposed approaches on a real energy plan and we discuss their limitations and advantages.

关键词： strategic environmental assessment regional planning constraint logic programming probabilistic logic programming causality

来源：评论

学校读者我要写书评

暂无评论

Using parametric set constraints for locating errors in CLP programs

引用

THEORY AND PRACTICE OF logic programming 2002年第4-5期2卷 549-610页

作者： Drabent, W Maluszynski, J Pietrzak, P Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden Polish Acad Sci Inst Comp Sci PL-01237 Warsaw Poland

This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs, and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving the correctness of logic programs to the case of parametric specifications. Set constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved, and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.

关键词： constraint logic programming parametric types descriptive types program correctness debugging set constraints term grammars

来源：评论

学校读者我要写书评

暂无评论

Modeling issues and implementation of language for disjunctive programming

引用

COMPUTERS & CHEMICAL ENGINEERING 2000年第9-10期24卷 2143-2155页

作者： Vecchietti, A Grossmann, IE Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA UTN Fac Reg Santa Fe INGAR Inst Desarrollo & Diseno Santa Fe NM USA

This paper describes a number of key modeling issues for the development of tools for solving nonlinear discrete/continuous problems where logic/disjunctive constraints are included in the formulation. A generalized hybrid representation of these problems is presented. A comparison between constraint logic programming (CLP) and generalized disjunctive programming (GDP) is established together with several constraint transformations from CLP to GDP. The components and expressions of a modeling language for setting up disjunctions and logic constraints are proposed. The language allows the specification of problems with complex logic formulations. A parser is developed for the analysis and translation of the logic sentences into files ready to be used by the solvers. An overview of the solution algorithms is also given together with several aspects about the implementation as a superset of GAMS mathematical programming language. Examples illustrating the capabilities of the proposed system are described. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： generalized disjunctive programming mixed-integer nonlinear programming constraint logic programming modeling language

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of CHR constraint solvers

引用

THEORY AND PRACTICE OF logic programming 2005年第4-5期5卷 403-418页

作者： Abdennadher, S Rigotti, C German Univ Cairo Dept Comp Sci Cairo Egypt INSA Lyon LIRIS Lab Lyon France

In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work (Apt and Monfroy 1999;Ringeissen and Monfroy 2000;Abdennadher and Rigotti 2000;Abdennadher and Rigotti 2001a), where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.

关键词： rule-based constraint solver automatic solver generation tabled resolution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Analysis and Transformation of Constrained Horn Clauses for Program Verification

引用

THEORY AND PRACTICE OF logic programming 2022年第6期22卷 974-1042页

作者： De Angelis, Emanuele Fioravanti, Fabio Gallagher, John P. Hermenegildo, Manuel, V Pettorossi, Alberto Proietti, Maurizio IASI CNR Rome Italy Univ G DAnnunzio DEC Chieti Italy Roskilde Univ Roskilde Denmark IMDEA Software Inst Madrid Spain Univ Politecn Madrid UPM Madrid Spain Univ RomeTor Vergata DICII Rome Italy

This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs. Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants. We also give an overview of some transformation techniques based on specialization and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. Finally, we discuss future developments in applying these techniques.

关键词： Program verification program analysis program transformation constrained Horn clauses constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Goal-oriented test data generation for pointer programs

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2007年第9-10期49卷 1030-1044页

作者： Gotlieb, Arnaud Denmat, Tristan Botella, Bernard INRIA IRISA F-35042 Rennes France THALES AEROSPACE F-78851 Elancourt France

Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs. goal-oriented methods). In both cases, several approaches based oil constraint solving exist, but in the presence of pointer variables only path-oriented methods have been proposed. Pointers are responsible for the existence of conditional aliasing problems that usually provoke the failure of the goal-oriented test data generation process. In this paper, we propose an overall constraint-based method that exploits the results of an intraprocedural points-to analysis and provides two specific constraint combinators for automatically generating goal-oriented test data. This approach correctly handles multi-levels stack-directed pointers that are mainly used in C programs. The method has been fully implemented in the test data generation tool INKA and first experiences in applying it to a variety of existing programs are presented. (c) 2006 Elsevier B.V. All rights reserved.

关键词： goal-oriented test data generation constraint logic programming static single assignment form pointer variables

来源：评论

学校读者我要写书评

暂无评论

Hybrid rules with well-founded semantics

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2010年第1期25卷 137-168页

作者： Drabent, Wlodzimierz Maluszynski, Jan Polish Acad Sci Inst Comp Sci PL-01237 Warsaw Poland Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

A general framework is proposed for integration of rules and external first-order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of constraint logic programming (CLP) and constructive negation for logic programs. Hybrid rules are normal clauses extended with constraints in the bodies;constraints are certain formulae in the language of the external theory. A hybrid program consists of a set of hybrid rules and an external theory. Instances of the framework are obtained by specifying the class of external theories and the class of constraints. An example instance is integration of (non-disjunctive) Datalog with ontologies formalized in description logics. The paper defines a declarative semantics of hybrid programs and a goal-driven formal operational semantics. The latter can be seen as a generalization of SLS-resolution. It provides a basis for hybrid implementations combining Prolog with constraint solvers (such as ontology reasoners). Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics and for completeness of the operational semantics are given.

关键词： Integration of rules and ontologies Semantic web reasoning Knowledge representation Well-founded semantics Constructive negation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example

引用

ARCHIVES OF CONTROL SCIENCES 2015年第3期25卷 367-375页

作者： Mazur, Michal Niederlinski, Antoni Gen Motors Mfg Poland Gliwice Poland Univ Econ Katowice Poland

A constraint logic programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car a... 详细信息

关键词： car sequencing car assembly scheduling workstation capacity constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：