Filters








52 Hits in 2.9 sec

An automated approach to generating efficient constraint solvers

Dharini Balasubramaniam, Christopher Jefferson, Lars Kotthoff, Ian Miguel, Peter Nightingale
2012 2012 34th International Conference on Software Engineering (ICSE)  
Constraint solving aims to find solutions to such problems efficiently and automatically. Current constraint solvers are monolithic in design, accepting a broad range of problems.  ...  The cost of this convenience is a complex architecture, inhibiting efficiency, extensibility and scalability.  ...  ACKNOWLEDGMENT This work is supported by the EPSRC grant 'A Constraint Solver Synthesiser' (EP/H004092/1) and SICSA studentships.  ... 
doi:10.1109/icse.2012.6227151 dblp:conf/icse/BalasubramaniamJKMN12 fatcat:oo6uvb4xyff3lpdhodwc7gsiqy

Performance analysis of constraint solvers for coverage directed test generation

M. P. Jomu George, O. Ait Mohamed
2011 ICM 2011 Proceeding  
In this report, a comparative study is conducted to measure the effectiveness of VCS2009.06 against other commercially available constraint solvers.  ...  One of the important components of CDTG technique is the constraint solver. The efficiency of CDTG depends on the constraint solver used.  ...  MINION Minion is constraint solver based on interleave splitting (also called branching) and propagation. Propagation is the basic operation of search, and splitting simplifies the CSP instance.  ... 
doi:10.1109/icm.2011.6177404 fatcat:e2c64fqyy5dn3og3uvogewdk5i

Qualitative Modelling via Constraint Programming: Past, Present and Future [article]

Thomas W. Kelsey, Lars Kotthoff, Christoffer A. Jefferson, Stephen A. Linton, Ian Miguel, Peter Nightingale, Ian P. Gent
2012 arXiv   pre-print
Traditional applications are the study of the dynamics of physical and biological systems at a higher level of abstraction than that obtained by estimation of numerical parameter values for a fixed quantitative  ...  Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences.  ...  LK is supported by a SICSA studentship and an EPSRC fellowship.  ... 
arXiv:1209.3916v1 fatcat:s7w36cffofesdiga4zaxfwqt4y

Parallel-in-Time Multi-Level Integration of the Shallow-Water Equations on the Rotating Sphere [article]

Francois P. Hamon, Martin Schreiber, Michael L. Minion
2019 arXiv   pre-print
The temporal integration of the underlying PDEs requires a very large number of time steps, even when the terms accounting for the propagation of fast atmospheric waves are treated implicitly.  ...  We present a multi-level parallel-in-time integration method combining the Parallel Full Approximation Scheme in Space and Time (PFASST) with a spatial discretization based on Spherical Harmonics (SH).  ...  Hence, the IMEX approach greatly reduces the computational cost per step compared to a fully implicit method by circumventing the need for a global nonlinear solver.  ... 
arXiv:1904.05988v3 fatcat:jrlw26zypbgnlgojg6oshzitxu

Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints

Xizhe Zhang, Jian Gao, Yizhi Lv, Weixiong Zhang
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Here we present a novel theorem for identifying the edges in a value graph of alldifferent constraint whose removal can significantly reduce useless constraint propagation.  ...  Furthermore, the new algorithm is scalable well and runs increasingly faster than the existing methods on larger problems.  ...  The benchmark problems for valuation were from the CSP Lib (http://www.csplib.org/) and Minion constraint solver (https://constraintmodelling.org/minion/), which include several typical alldifferent constraint  ... 
doi:10.24963/ijcai.2020/157 dblp:conf/ijcai/ZhangGLZ20 fatcat:2vau5u2kyfcqtjt3gak367e5dy

Enumeration of AG-Groupoids [chapter]

Andreas Distler, Muhammad Shah, Volker Sorge
2011 Lecture Notes in Computer Science  
The results are obtained with the help of the computer algebra system GAP and the constraint solver Minion by making use of both algebraic techniques as well as search pruning via symmetry breaking.  ...  In this paper we present the enumeration and partial classification of AG-groupoids -groupoids in which the identity (ab)c = (cb)a holds -of up to order 6.  ...  For our purposes we rely on Minion [9] as solver which offers fast, scalable constraint solving. A major feature of modern SAT solvers is their optimised use of modern computer architecture.  ... 
doi:10.1007/978-3-642-22673-1_1 fatcat:jvhml3qgevcd3du2ipgitqskq4

Multi-Level Spectral Deferred Corrections Scheme for the Shallow Water Equations on the Rotating Sphere [article]

Francois Hamon and Martin Schreiber and Michael Minion
2018 arXiv   pre-print
The iterative temporal integration is based on a sequence of corrections distributed on coupled space-time levels to perform a significant portion of the calculations on a coarse representation of the  ...  In this work, we propose a high-order, implicit-explicit numerical scheme that combines Multi-Level Spectral Deferred Corrections (MLSDC) and the Spherical Harmonics (SH) transform to solve the wave-propagation  ...  global linear solver.  ... 
arXiv:1805.07923v2 fatcat:z6xrro3yzfa6ppaiw67jy7vdsu

Toward sustainable development in constraint programming

Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson, Helmut Simonis
2013 Constraints  
We present a few challenges that we consider important to tackle for the future of constraint programming. The focus is put on simplifying the design and implementation of propagators in solvers.  ...  We have heard SAT and SMT users say that if their model is not fast enough then they just wait for a year in order to benefit, without effort of their own, from a solver twice as fast.  ...  -Promote open-source solvers, such as Choco, ECLiPSe, Gecode, JaCoP, and Minion. -Promote algorithms that can be implemented in more than one solver.  ... 
doi:10.1007/s10601-013-9152-4 fatcat:uknghojtkjehfctt5g36whp224

Leveraging a Constraint Solver for Minimizing Test Suites

Jose Campos, Rui Abreu
2013 2013 13th International Conference on Quality Software  
matrix into a set of constraints; and computes a collection of optimal minimal sets (maintaining the same coverage as the original suite) by leveraging a fast constraint solver.  ...  We propose an approach, RZOLTAR, addressing this issue: it encodes the relation between a test case and its testing requirements (code statements in this paper) in a so-called coverage matrix; maps this  ...  Our approach to minimize test suites, dubbed RZOLTAR, leverages the efficient and scalable off-the-shelf MINION constraint solver [10] .  ... 
doi:10.1109/qsic.2013.17 dblp:conf/qsic/CamposA13 fatcat:l56hu2ev3rgb3bnw3l4vfean2e

The Exact Closest String Problem as a Constraint Satisfaction Problem [article]

Tom Kelsey, Lars Kotthoff
2010 arXiv   pre-print
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems.  ...  We also report (to our knowledge) the first analysis and evaluation -- using any technique -- of the computational difficulties involved in the identification of all closest strings for a given input set  ...  Lars Kotthoff is supported by a Scottish Informatics and Computer Science Alliance (SICSA) studentship.  ... 
arXiv:1005.0089v1 fatcat:aanus3otczfmnhlmssocx5eirm

Exact Closest String as a Constraint Satisfaction Problem

Tom Kelsey, Lars Kotthoff
2011 Procedia Computer Science  
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems.  ...  We also report the first analysis and evaluation -using any technique -of the computational difficulties involved in the identification of all closest strings for a given input set.  ...  Minion is used for this investigation as it offers both fast and scalable constraint solving, which are important factors when solving closest string problems.  ... 
doi:10.1016/j.procs.2011.04.113 fatcat:x3oytlfpqzgwfnljzgt4u4pglq

Generating Special-Purpose Stateless Propagators for Arbitrary Constraints [chapter]

Ian P. Gent, Chris Jefferson, Ian Miguel, Peter Nightingale
2010 Lecture Notes in Computer Science  
The technique can also be many times faster than a decomposition into primitive constraints in the Minion solver.  ...  Propagation is so fast that, for constraints available in our solver, the generated propagator compares well with a human-optimised propagator for the same constraint.  ...  In all the case studies below, we use the solver Minion [11] 0.10.  ... 
doi:10.1007/978-3-642-15396-9_19 fatcat:pzv6uhazsfb7vhh5eyk7xf5s4i

An SDN-Enabled Resource Orchestration for Industrial IoT in Collaborative Edge-Cloud Networks

Jude Okwuibe, Juuso Haavisto, Ivana Kovacevic, Erkki Harjula, Ijaz Ahmad, Johirul Islam, Mika Ylianttila
2021 IEEE Access  
TABLE 3 : 3 Time and node parameters for Minion solver solution with different network instances Network instance Number of nodes Minion solver nodes Minion solver total time (s) Seville row  ...  We used the SAT constraint programming paradigm and minion solvers for resource allocation. Here we defined resource allocation as a combinatorial problem.  ...  Y Combinator, a startup incubator in Silicon Valley invited him in 2018 to on-site interviews (acceptance rate 4%) over Periferia, a project about developer tools for reducing 5G network end-to-end latency  ... 
doi:10.1109/access.2021.3105944 fatcat:fvysjtp54rdr7mzffmutqkxpcq

S-crucial and bicrucial permutations with respect to squares [article]

Ian Gent, Sergey Kitaev, Alexander Konovalov, Steve Linton, Peter Nightingale
2014 arXiv   pre-print
In this paper, we provide an encoding of orderings which allows us, using the constraint solver Minion, to show that bicrucial permutations of even length exist, and the smallest such permutations are  ...  A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to the left by any element gives a permutation that is not square-free.  ...  Miguel: Minion: A fast scalable constraint solver. In: Brewka, G., Corade- schi, S., Perini, A., Traverso, P. (eds.) ECAI.  ... 
arXiv:1402.3582v1 fatcat:meybzjs6kbce3dn5zaen5eajwa

New decision rules for exact search in N-Queens

Pablo San Segundo
2011 Journal of Global Optimization  
This research is part of a bigger project which aims at deriving new decision rules 20 for CSP domains by evaluating, at each step, a constraint value graph G c .  ...  10 This paper presents a set of new decision rules for exact search in N-Queens.  ...  Raphael Finkel for his help with experiments using the answer set problem solver clasp.  ... 
doi:10.1007/s10898-011-9653-x fatcat:rxw647ecgfd2ldtkv6meqoqtbi
« Previous Showing results 1 — 15 out of 52 results