ACP Success Stories | Association for Constraint Programming. Constraint Applications Blog by Helmut Simonis. Building Industrial Applications with Constraint Programming. Twenty-Five Years of Successful Application of Constraint Technologies at Siemens. New trends in constraint satisfaction, planning, and scheduling: a survey. Crossref Citations This article has been cited by the following publications. This list is generated based on data provided by CrossRef. Heinz, Stefan and Beck, J. Christopher 2012. Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. Vol. 7298, Issue. , p. 211. González-Ferrer, Arturo ten Teije, Annette Fdez-Olivares, Juan and Milian, Krystyna 2013. Lu, Hui Wang, Xiaoteng and Liu, Jing 2014.
Kaldeli, Eirini Lazovik, Alexander and Aiello, Marco 2016. Escamilla, Joan Salido, Miguel A. Ku, Wen-Yang and Beck, J. Cappart, Quentin and Schaus, Pierre 2017. Palacios, Juan José González-Rodríguez, Inés Vela, Camino R. and Puente, Jorge 2018. Kannimoola, Jinesh M. Teppan, Erich C. and Friedrich, Gerhard 2018. Radiano, O. Teppan, Erich C. 2018. Kumar, Rajnish Sen, Goutam Kar, Samarjit and Tiwari, Manoj Kumar 2018. Del Ser, Javier Osaba, Eneko Molina, Daniel Yang, Xin-She Salcedo-Sanz, Sancho Camacho, David Das, Swagatam Suganthan, Ponnuthurai N. Constraints in bioinformatics. Edited by Rolf Backofen, Alessandro Dal Palu', Agostino Dovier, and Sebastian Will The technology of Constraint and Constraint Logic Programming has shown to be effective for a multitude of computational problems of modern bio-sciences, which are typically complex and often NP-hard.
Constraint-based methods contribute essentially to the tool set of Bioinformatics, due to their ability to simplify problem modeling and face computationally challenging problems. These techniques emerged in bioinformatics more than 10 years ago, introduced at the workshops Constraints and Bioinformatics/Biocomputing associated to CP97 and CP98. Since 2005, the Workshops on Constraint based methods for Bioinformatics (WCB series) haven taken place annually. Topics of particular interest comprise (but are not limited to) sequence analysis, biological systems simulations, protein structure prediction and docking, structure alignment, pedigree analysis, and haplotype inference.
COSYTEC Case Studies. ECLiPSe Applications. Disclaimer The material on this page may be copyrighted or may be the property of the respective authors. Books A Gentle Guide to Constraint Logic Programming via ECLiPSe by Antoni Niederliński, Third edition, 2014, 570 pages, ISBN 978-83-62652-08-2. Constraint Logic Programming using ECLiPSe by Krzysztof Apt and Mark Wallace, Cambridge University Press, 2006, 329 pages. Programming with Constraints: an Introduction by Kim Mariott and Peter Stuckey, MIT Press, 1998. Videos Introduction to Constraint Logic Programming with ECLiPSe by Sergii Dymchenko.
ECLiPSe E-Learning Course by Helmut Simonis, a self-study course on constraint programming using the ECLiPSe language. Introductory Material ECLiPSe E-Learning Course ECLiPSe by Example by J Schimpf and K Shen, Tutorial given at CP 2007, Providence, USA, Powerpoint Slides/ PDF Slides ECLiPSe: A Tutorial Introduction by A M Cheadle, W Harvey, A J Sadler, J Schimpf, K Shen and M G Wallace. Developing Applications with ECLiPSe by H Simonis. Manuals by W. Minion Case Studies. Andreas Distler and Tom Kelsey applied Minion to the problem of finding the number of monoids of orders eight, nine, and ten. They demonstrated the scalability of Minion on very large problems which were previously unsolved.
This application also shows the effectivity of the black-box approach to using Minion; i.e. solving a problem without having to tweak lots of parameters. Their work has been published in Annals of Mathematics and Artificial Intelligence. Amba Kulkarni, Sheetal Pokar and Devanand Shukl of the University of Hyderabad are using Minion to develop a constraint based parser for Sanskrit. Their efforts are described in this publication. Minion is used in the Phoronix Test Suite to benchmark Linux. Victor Bovdi, Eric Jespers and Alexander Konovalov investigated units of finite orders in integral group rings, and used Minion to find possible partial augmentations (that is, sums of coefficients of group ring elements over conjugacy classes of group elements) for such units.
MiniZinc Applications. SAP uses Gecode, an award-winning constraint solver, in S/4HANA for advanced variant configuration. In 2015, the SAP Variant Configuration development team started to develop the new state-of-the art configuration engine. This engine was first made available in SAP S/4HANA in summer 2017 within SAP S/4HANA for advanced variant configuration. At the core of the configuration engine, SAP has chosen to leverage the open source library Gecode (www.gecode.org). Gecode is a highly-efficient constraint solver, which is being developed under the lead of Prof. Christian Schulte.
Prof. Christian Schulte is a professor of computer science at the KTH Royal Institute of Technology in Stockholm. Since its founding in 1827, KTH Royal Institute of Technology in Stockholm has grown to become one of Europe’s leading technical and engineering universities, as well as a key center of intellectual talent and innovation. KTH is Sweden’s largest technical research and learning institution and home to students, researchers and faculty from around the world, dedicated to advancing knowledge. says Dr. Dr. Prof.