88 research outputs found
Composable Constraint Models for Permutation Enumeration
Constraint programming (CP) is a powerful tool for modeling mathematical
concepts and objects and finding both solutions or counter examples. One of the
major strengths of CP is that problems can easily be combined or expanded. In
this paper, we illustrate that this versatility makes CP an ideal tool for
exploring problems in permutation patterns.
We declaratively define permutation properties, permutation pattern avoidance
and containment constraints using CP and show how this allows us to solve a
wide range of problems. We show how this approach enables the arbitrary
composition of these conditions, and also allows the easy addition of extra
conditions. We demonstrate the effectiveness of our techniques by modelling the
containment and avoidance of six permutation patterns, eight permutation
properties and measuring five statistics on the resulting permutations. In
addition to calculating properties and statistics for the generated
permutations, we show that arbitrary additional constraints can also be easily
and efficiently added.
This approach enables mathematicians to investigate permutation pattern
problems in a quick and efficient manner. We demonstrate the utility of
constraint programming for permutation patterns by showing how we can easily
and efficiently extend the known permutation counts for a conjecture involving
the class of 1324 avoiding permutations. For this problem, we expand the
enumeration of 1324-avoiding permutations with a fixed number of inversions to
permutations of length 16 and show for the first time that in the enumeration
there is a pattern occurring which follows a unique sequence on the Online
Encyclopedia of Integer Sequences
Efficient incremental modelling and solving
Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Trust Early Career Fellow (ECF-2020-168).In various scenarios, a single phase of modelling and solving is either not sufficient or not feasible to solve the problem at hand. A standard approach to solving AI planning problems, for example, is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. Indeed, any optimization problem can be solved as a sequence of decision problems in which the objective value is incrementally updated. Another example is constraint dominance programming (CDP), in which search is organized into a sequence of levels. The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row to support efficient incremental modelling and solving. This allows adding new decision variables, posting new constraints and removing existing constraints (via assumptions) between incremental steps. Two additional benefits of the native coupling of modelling and solving are the ability to retain learned information between SAT solver calls and to enable SAT assumptions, further improving flexibility and efficiency. Experiments on one optimisation problem and five pattern mining tasks demonstrate that the native interaction between the modelling system and SAT solver consistently improves performance significantly.Publisher PD
Towards portfolios of streamlined constraint models : a case study with the balanced academic curriculum problem
Funding: This work is supported by EPSRC grant EP/P015638/1 and used the Cirrus UK National Tier-2 HPC Service at EPCC (http://www.cirrus.ac.uk) funded by the University of Edinburgh and EPSRC (EP/P020267/1). Nguyen Dang is a Leverhulme Early Career Fellow.Augmenting a base constraint model with additional constraints can strengthen the inferences made by a solver and therefore reduce search effort. We focus on the automatic addition of streamliner constraints, derived from the types present in an abstract Essence specification of a problem class of interest, which trade completeness for potentially very significant reduction in search. The refinement of streamlined Essence specifications into constraint models suitable for input to constraint solvers gives rise to a large number of modelling choices in addition to those required for the base Essence specification. Previous automated streamlining approaches have been limited in evaluating only a single default model for each streamlined specification. In this paper we explore the effect of model selection in the context of streamlined specifications. We propose a new best-first search method that generates a portfolio of Pareto Optimal streamliner-model combinations by evaluating for each streamliner a portfolio of models to search and explore the variability in performance and find the optimal model. Various forms of racing are utilised to constrain the computational cost of training.Publisher PD
Towards improving solution dominance with incomparability conditions : a case-study using Generator Itemset Mining
Funding: EPSRC (EP/P015638/1).Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well-known approach to this, and one for which constraint programming has been shown to be a well-suited and generic framework. Dominance programming has been proposed as an extension that can capture an even wider class of constraint-based mining problems, by allowing to compare relations between patterns. In this paper, in addition to specifying a dominance relation, we introduce the ability to specify an incomparability condition. Using these two concepts we devise a generic framework that can do a batch-wise search that avoids checking incomparable solutions. We extend the ESSENCE language and underlying modelling pipeline to support this. We use generator itemset mining problem as a test case and give a declarative specification for that. We also present preliminary experimental results on this specific problem class with a CP solver backend to show that using the incomparability condition during search can improve the efficiency of dominance programming and reduces the need for post-processing to filter dominated solutions.Publisher PD
Effective Encodings of Constraint Programming Models to SMT
Satisfiability Modulo Theories (SMT) is a well-established methodology that generalises propositional satisfiability (SAT) by adding support for a variety of theories such as integer arithmetic and bit-vector operations. SMT solvers have made rapid progress in recent years. In part, the efficiency of modern SMT solvers derives from the use of specialised decision procedures for each theory. In this paper we explore how the Essence Prime constraint modelling language can be translated to the standard SMT-LIB language. We target four theories: bit-vectors (QF_BV), linear integer arithmetic (QF_LIA), non-linear integer arithmetic (QF_NIA), and integer difference logic (QF_IDL). The encodings are implemented in the constraint modelling tool Savile Row. In an extensive set of experiments, we compare our encodings for the four theories, showing some notable differences and complementary strengths. We also compare our new encodings to the existing work targeting SMT and SAT, and to a well-established learning CP solver. Our two proposed encodings targeting the theory of bit-vectors (QF_BV) both substantially outperform earlier work on encoding to QF_BV on a large and diverse set of problem classes
Modelling Langford's Problem : a viewpoint for search
Funding: EPSRC (EP/P015638/1).The performance of enumerating all solutions to an instance of Langford's Problem is sensitive to the model and the search strategy. In this paper we compare the performance of a large variety of models, all derived from two base viewpoints. We empirically show that a channelled model with a static branching order on one of the viewpoints offers the best performance out of all the options we consider. Surprisingly, one of the base models proves very effective for propagation, while the other provides an effective means of stating a static search order.Postprin
Stoma Prolapse
The incidence of prolapse which is a late complication of stoma ranges between 0–25%. In this study the records of the patients who had been treated and followed up with the diagnosis of stoma prolapse between 1995 -2005 in the General Surgery Department of Dicle University Hospital were examined, retrospectively. There were 12 patients (5 men, 7 women) with a mean age of 51,6±15.01 years. The causes of stoma construction were malign diseases in 9 patients and benign diseases in 3 of them. The average time between construction of stoma and formation of prolapse was 10,9±6.84 month. The type of stoma was loop in 7 patient, end stoma in 4 patient and double bowel enterostomy in 1 patient. Of nine patients with stoma prolapse had been subjected chemotherapy. The overall rate of stomal prolapsus was 3,1% in this series. It was 10,8% in patients who had received chemoradiotherapy. Since stomal prolasus is a serious complication and its reconstruction needs general anesthesia great care should be shown when creatig a stoma
Memory consistency models using constraints
Memory consistency models (MCMs) are at the heart of concurrent programming. They represent the behaviour of concurrent programs at the chip level. To test these models small program snippets called litmus test are generated, which show allowed or forbidden behaviour of different MCMs. This paper is showcasing the use of constraint programming to automate the generation and testing of litmus tests for memory consistency models. We produce a few exemplary case studies for two MCMs, namely Sequential Consistency and Total Store Order. These studies demonstrate the flexibility of constrains programming in this context and lay foundation to the direct verification of MCMs against the software facing cache coherence protocols.Postprin
- …