this paper presents a new application of logic programming to a real-life problem in hydraulic engineering. the work is developed as a collaboration of computer scientists and hydraulic engineers, and applies Constrai...
详细信息
this paper presents a new application of logic programming to a real-life problem in hydraulic engineering. the work is developed as a collaboration of computer scientists and hydraulic engineers, and applies constraint Logic programming to solve a hard combinatorial problem. this application deals with one aspect of the design of a water distribution network, i.e., the valve isolation system design. We take the formulation of the problem by Giustolisi and Savic (2008 Optimal design of isolation valve system for water distribution networks. In Proceedings of the 10th Annual Water Distribution Systems Analysis conference WDSA2008, J. Van Zyl, A. Ilemobade, and H. Jacobs, Eds.) and show how, thanks to constraint propagation, we can get better solutions than the best solution known in the literature for the Apulian distribution network. We believe that the area of the so-called hydroinformatics can benefit from the techniques developed in constraint Logic programming and possibly from other areas of logic programming, such as Answer Set programming.
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Aus...
详细信息
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Australia from the 28th of August to the 1st of September, 2017. ICLP 2017 was colocated withthe 23rd internationalconference on principles and practice of constraintprogramming (CP 2017) and the 20thinternationalconference on theory and Applications of Satisfiability Testing (SAT 2017). Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
constraintprogramming can definitely be seen as a model-driven paradigm. the users write programs for modeling problems. these programs are mapped to executable models to calculate the solutions. this paper focuses o...
详细信息
In Online Problem Solving, partial solutions must be generated and executed before the complete problem is known. Many potential applications of constraintprogramming turn out to be online problems – for e...
ISBN:
(纸本)3540232419
In Online Problem Solving, partial solutions must be generated and executed before the complete problem is known. Many potential applications of constraintprogramming turn out to be online problems – for example, dynamic scheduling. How should we decide which values to assign to variables before all the variables and constraints are known? If we have some knowledge of the possible future developments of the problem, can we use that knowledge to make our initial assignments?
In this paper, we propose a general extension of constraint propagation for constraint optimization based on cooperative computation. It is similar both in principle and operations to constraint propagation. In princi...
详细信息
ISBN:
(纸本)3540232419
In this paper, we propose a general extension of constraint propagation for constraint optimization based on cooperative computation. It is similar both in principle and operations to constraint propagation. In principle, it eliminates variable values by checking the feasibility that they can be in any global optimum. In operations, it is based on parallel, local iterative computations. the proposed algorithm returns both a solution and a global lower bound at each iteration. As an approximation algorithm for optimization, it significantly outperform classical optimization methods, such as simulated annealing and local search with multi-restarts in practice.
We introduce a constraint for one-dimensional bin packing. this constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constr...
详细信息
ISBN:
(纸本)3540232419
We introduce a constraint for one-dimensional bin packing. this constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constraint can significantly reduce search on bin packing problems. We also demonstrate that when coupled with a standard bin packing search strategy, our constraint can be a competitive alternative to established operations research bin packing algorithms.
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe ...
ISBN:
(纸本)9781605581170
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe memory management and its proof of correctness;programming with proofs and explicit contexts;towards execution time estimation in abstract machine-based languages;similarity-based reasoning in qualified logic programming;classifying integrity checking methods with regard to inconsistency tolerance;comprehending finite maps for algorithmic debugging of higher-order functional programs;parallel execution of multi-set constraint rewrite rules;a rewriting framework for the composition of access control policies;global difference constraint propagation for finite domain solvers;and dynamic variable elimination during propagation solving.
constraint handling rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algori...
详细信息
constraint handling rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by lambda-tree syntax, in which binding is explicit, and a new del generic quantifier is introduced, which is used to create new fresh constants.
One of the most appealing features of constraintprogramming is its rich constraint language for expressing combinatorial optimization problems. this paper demonstrates that traditional combinators from constraint pro...
详细信息
ISBN:
(纸本)3540232419
One of the most appealing features of constraintprogramming is its rich constraint language for expressing combinatorial optimization problems. this paper demonstrates that traditional combinators from constraintprogramming have natural counterparts for local search, although their underlying computational model is radically different. In particular, the paper shows that constraint combinators, such as logical and cardinality operators, reification, and first-class expressions can all be viewed as differentiable objects. these combinators naturally support elegant and efficient modelings, generic search procedures, and partial constraint satisfaction techniques for local search. Experimental results on a variety of applications demonstrate the expressiveness and the practicability of the combinators.
the contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR search space displays independencies ...
详细信息
ISBN:
(纸本)3540232419
the contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR search space displays independencies present in the graphical model explicitly and may sometimes reduce the search space exponentially. Empirical evaluation focusing on counting demonstrates the spectrum of search and inference within the AND/OR search spaces.
暂无评论