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

constraint-based model for the cyclic multi-hoists scheduling problem

PRODUCTION PLANNING & CONTROL 2000年第3期11卷 244-257页

作者： Manier, MA Varnier, C Baptiste, P Univ Technol Belfort Montbelliard Equipe Prod Espace Bartholdi Belfort Technopole F-90016 Belfort France ENSMM Inst Prod Lab Automat Besancon CNRSUMR 6596 F-25000 Besancon France

This article presents a method for the resolution of a material handling scheduling problem. The case studied is a real industrial problem. It consists of finding a cyclic schedule for hoist movements in a treatment surface shop. In this kind of facility, several hoists are used for all the handling operations and they have to share common zones. Then it is necessary to control that there is no collision. The mathematical formulation of the problem is based on a combination of disjunctive constraints. The constraints describe either movement schedule or collision avoidance. The resolution procedure presented identifies all the collision configurations and then uses a branch and bound-like algorithm to find the optimal solution of a given problem. The language chosen for our implementation is the constraint logic programming language: Prolog IV, which is able to solve constraints with rational variables. It actively uses the constraint propagation mechanism that can be found in several languages.

关键词： cyclic scheduling constraint logic programming electroplating facilities hoists

来源：评论

学校读者我要写书评

暂无评论

Magic conditions

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 1996年第1期21卷 107-155页

作者： Mumick, IS Finkelstein, SJ Pirahesh, H Ramakrishnan, R MATISSE ADBREDWOOD SHORESCA 94065 IBM CORP ALMADEN RES CTRSAN JOSECA 95120 UNIV WISCONSIN DEPT COMP SCIMADISONWI 53706

Much recent work has focused on the bottom-up evaluation of Datalog programs [Bancilhon and Ramakrishnan 1988]. One approach, called magic-sets, is based on rewriting a logic program so that bottom-up fixpoint evaluation of the program avoids generation of irrelevant facts [Bancilhon et al. 1986;Beeri and Ramakrishnan 1987;Ramakrishnan 1991]. It was widely believed for some time that the principal application of the magic-sets technique is to restrict computation in recursive queries using equijoin predicates. We extend the magic-sets transformation to use predicates other than equality (X > 10, for example) in restricting computation. The resulting ground magic-sets transformation is an important step in developing an extended magic-sets transformation that has practical utility in ''real'' relational databases, not only for recursive queries, but for nonrecursive queries as well [Mumick et al. 1990b;Mumick 1991].

关键词： algorithms measurement theory verification bottom-up evaluation constraint logic programming constraints deductive databases magic sets query optimization relational databases Starburst

来源：评论

学校读者我要写书评

暂无评论

On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity

引用

constraintS 2016年第2期21卷 251-276页

作者： Nabli, Faten Martinez, Thierry Fages, Francois Soliman, Sylvain Inria Paris Rocquencourt EPI Lifeware Rocquencourt France

Petri nets are a simple formalism for modeling concurrent computation. They are also an interesting tool for modeling and analysing biochemical reaction systems, bridging the gap between purely qualitative and quantitative models. Biological networks can indeed be complex, large, and with many unknown kinetic parameters, which makes the development of quantitative models difficult. In this paper, we focus on the Petri net representation of biochemical reactions and on two structural properties of Petri nets, siphons and traps, that bring us information about the persistence of some molecular species, independently of the kinetics. We first study the theoretical time complexity of minimal siphon decision problems in general Petri nets, and present three new complexity results: first, we show that the existence of a siphon of a given cardinality is NP-complete;second, we prove that deciding the Siphon-Trap property is co-NP-complete;third, we prove that deciding the existence of a minimal siphon containing a given set of places, deciding the existence of a siphon of a given cardinality and deciding the Siphon-Trap property can be done in linear time in Petri nets of bounded tree-width. Then, we present a Boolean model of siphons and traps, and two method for enumerating all minimal siphons and traps of a Petri net, by using a SAT solver and a constraint logic Program (CLP) respectively. On a benchmark of 345 Petri nets of hundreds of places and transitions, extracted from biological models from the BioModels repository, as well as on a benchmark composed of 80 Petri nets from the Petriweb database of industrial processes, we show that both the SAT and CLP methods are overall faster by one or two orders of magnitude compared to the state-of-the-art algorithm from the Petri net community, and are in fact able to solve all the enumeration problems of our practical benchmarks. We investigate why these programs perform so well in practice, and provide some elements of expl

关键词： Petri nets Siphons Systems biology SAT constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Maxx: Test pattern optimisation with local search over an extended logic

引用

constraintS 2007年第4期12卷 507-538页

作者： Azevedo, Francisco Univ Nova Lisboa FCT CENTRIA Dept Informat P-2829516 Caparica Portugal

In the electronic computer-aided design area, the test generation problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have some unspecified Primary Inputs (i.e. bits are assigned neither 0 nor 1). In fact, for many purposes, minimally specified tests (or patterns) are preferred. Hence, we have the test pattern optimisation (TPO) problem where the goal is to obtain a test with the maximum number of unspecified bits. In this paper we discuss different modelling approaches and present a TPO tool (Maxx) that substantially outperforms others by combining Branch-and-Bound and local search over distinct models. We apply the usual branch-and-bound search on CLP(FD) over a simple, yet incomplete, logic. A complementary Local Search is performed over an extended model, trying to improve an already computed solution by exploring an extended solution space thanks to the use of an extended logic (too complex for constraint solving). Such extended logic considers sets of dependencies on specified input values, keeping track of sources of unspecified values and their inversion parities. This allows modelling a number of alternative test vectors by unspecification of each possible input bit, thus being able to obtain an improved test vector in linear time. This paper shows, for TPO, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone, obtaining significantly better results than those obtained with a highly efficient tool based on an integer linear programming formulation on a propositional satisfiability model.

关键词： CLP constraint logic programming PI primary input TG test generation

来源：评论

学校读者我要写书评

暂无评论

Extracting buildings from aerial images using hierarchical aggregation in 2D and 3D

引用

COMPUTER VISION AND IMAGE UNDERSTANDING 1998年第2期72卷 185-203页

作者： Fischer, A Kolbe, TH Lang, F Cremers, AB Forstner, W Plumer, L Steinhage, V Univ Bonn Comp Sci Dept 1 D-53117 Bonn Germany Univ Vechta Inst Environm Sci D-49364 Vechta Germany Univ Bonn Inst Photogrammetry D-53115 Bonn Germany Univ Bonn Comp Sci Dept 3 D-53117 Bonn Germany

We propose a model-based approach to automated 3D extraction of buildings from aerial images. We focus on a reconstruction strategy that is not restricted to a small class of buildings. Therefore, we employ a generic modeling approach which relies on the well-defined combination of building part models, Building parts are classified by their roof type. Starting from low-level image features we combine data-driven and model-driven processes within a multilevel aggregation hierarchy, thereby using a tight coupling of 2D image and 3D object modeling and processing, ending up in complex 3D building estimations of shape and location, Due to the explicit representation of well-defined processing states in terms of model-based 2D and 3D descriptions at all levels of modeling and data aggregation, our approach reveals a great potential for reliable building extraction. (C) 1998 Academic Press.

关键词： explicit 2D modeling coupling of 2D and 3D modeling multilayer aggregation building modeling multiimage correspondence analysis midlevel feature aggregates aspect hierarchies constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Lightweight string reasoning in model finding

引用

SOFTWARE AND SYSTEMS MODELING 2015年第1期14卷 413-427页

作者： Buettner, Fabian Cabot, Jordi Ecole Mines Nantes INRIA AtlanMod Nantes France

Models play a key role in assuring software quality in the model-driven approach. Precise models usually require the definition of well-formedness rules to specify constraints that cannot be expressed graphically. The Object constraint Language (OCL) is a de-facto standard to define such rules. Techniques that check the satisfiability of such models and find corresponding instances of them are important in various activities, such as model-based testing and validation. Several tools for these activities have been developed, but to our knowledge, none of them supports OCL string operations on scale that is sufficient for, e.g., model-based testing. As, in contrast, many industrial models do contain such operations, there is evidently a gap. We present a lightweight solver that is specifically tailored to generate large solutions for tractable string constraints in model finding, and that is suited to directly express the main operations of the OCL datatype String. It is based on constraint logic programming (CLP) and constraint handling rules, and can be seamlessly combined with other constraint solvers in CLP. We have integrated our solver into the EMFtoCSP model finder, and we show that our implementation efficiently solves several common string constraints on large instances.

关键词： Model instantiation OCL String constraints constraint logic programming constraint handling rules

来源：评论

学校读者我要写书评

暂无评论

Anticipatory Pruning Networks and forward checking in CLP over continuous domains

引用

DECISION SUPPORT SYSTEMS 1996年第3-4期18卷 327-340页

作者： Jo, GS McAloon, K CUNY BROOKLYN COLL GRAD CTRDEPT COMP & INFORMAT SCIBROOKLYNNY 11210

In this paper, the notion of the Anticipatory Pruning Network (APN) is introduced and developed for the propositional part of the 2LP system;2LP (Linear programming and logic programming) is a constraint logic programming system which has been developed and implemented at the logic Based System Lab at Brooklyn College/CUNY. Using the compilation of rules in the style of the Rete algorithm, the APN maps program clauses into a network, The APN prunes a search space by consistency checking and inconsistency propagation through the network and resets itself upon backtracking. The APN extends forward checking to continuous constraint domains, Overall, the benchmarks show the APN to be an effective forward checking mechanism for both discrete and continuous problem domains for Simplex based constraint solvers. In particular, the APN is an effective pruning method for constrained mixed integer, linear optimization problems.

关键词： constraint logic programming forward checking over continuous domains linear programming

来源：评论

学校读者我要写书评

暂无评论

A Folding Rule for Eliminating Existential Variables from constraint logic Programs

引用

FUNDAMENTA INFORMATICAE 2009年第3期96卷 373-393页

作者： Senni, Valerio Pettorossi, Alberto Proietti, Maurizio Univ Roma Tor Vergata DISP I-00133 Rome Italy IASI CNR I-00185 Rome Italy

The existential variables of a clause in a constraint logic program are the variables which occur in the body of the clause and not in its head. The elimination of these variables is a transformation technique which is often used for improving program efficiency and verifying program properties. We consider a folding transformation rule which ensures the elimination of existential variables and we propose an algorithm for applying this rule in the case where the constraints are linear inequations over rational or real numbers. The algorithm combines techniques for matching terms modulo equational theories and techniques for solving systems of linear inequations. Through some examples we show that an implementation of our folding algorithm has a good performance in practice.

关键词： Program transformation folding rule variable elimination constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Declarative and Mathematical programming approaches to Decision Support Systems for food recycling

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2020年 95卷 103861-103861页

作者： Chesani, Federico Cota, Giuseppe Gavanelli, Marco Lamma, Evelina Mello, Paola Riguzzi, Fabrizio Univ Bologna Dipartimento Informat Sci & Ingn Viale Risorgimento 2 I-40136 Bologna Italy Univ Parma Dipartimento Sci Matemat Fis & Informat Parco Area Sci 53-A I-43124 Parma Italy Univ Ferrara Dipartimento Matemat & Informat Via Saragat 1 I-44122 Ferrara Italy Univ Ferrara Dipartimento Ingn Via Saragat 1 I-44122 Ferrara Italy

Every year about one third of the food production intended for humans gets lost or wasted. This wastefulness of resources leads to the emission of unnecessary greenhouse gas, contributing to global warming and climate change. The solution proposed by the SORT project is to "recycle'' the surplus of food by reconditioning it into animal feed or fuel for biogas/biomass power plants. In order to maximize the earnings and minimize the costs, several choices must be made during the reconditioning process. Given the extremely complex nature of the process, Decision Support Systems (DSSs) could be helpful to reduce the human effort in decision making. In this paper, we present a DSS for food recycling developed using two approaches for finding the optimal solution: one based on Binary Linear programming (BLP) and the other based on Answer Set programming (ASP), which outperform our previous approach based on constraint logic programming (CLP) on Finite Domains (CLP(FD)). In particular, the BLP and the CLP(FD) approaches are developed in (ECLPSe)-P-i, a Prolog system that interfaces with various state-of-the-art Mathematical and constraint programming solvers. The ASP approach, instead, is developed in clingo. The three approaches are compared on several synthetic datasets that simulate the operative conditions of the DSS.

关键词： Food recycling Decision Support System constraint logic programming Answer Set programming Binary Linear programming

来源：评论

学校读者我要写书评

暂无评论

CHR grammars

引用

THEORY AND PRACTICE OF logic programming 2005年第4-5期5卷 467-501页

作者： Christiansen, H Roskilde Univ Dept Comp Sci DK-4000 Roskilde Denmark

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

关键词： constraint logic programming constraint handling rules logic grammars

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：