On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry

We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove that we can compute in polynomial time a unique representative of an equivalence class in a matrix model with row and column symmetry if the number of rows (or of columns) is bounded and in a number of other special cases. On the negative side, we show that whilst DOUBLELEX and SNAKELEX are often effective in practice, they can leave a large number of symmetric solutions in the worst case. In addition, we prove that propagating DOUBLELEX completely is NP-hard. Finally we consider how to break row, column and value symmetry, correcting a result in the literature about the safeness of combining different symmetry breaking constraints. We end with the first experimental study on how much symmetry is left by DOUBLELEX and SNAKELEX on some benchmark problems.Comment: To appear in the Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP 2010

Magic angles and cross-hatching instability in hydrogel fracture

The full 2D analysis of roughness profiles of fracture surfaces resulting from quasi-static crack propagation in gelatin gels reveals an original behavior characterized by (i) strong anisotropy with maximum roughness at $V$-independent symmetry-preserving angles, (ii) a sub-critical instability leading, below a critical velocity, to a cross-hatched regime due to straight macrosteps drifting at the same magic angles and nucleated on crack-pinning network inhomogeneities. Step height values are determined by the width of the strain-hardened zone, governed by the elastic crack blunting characteristic of soft solids with breaking stresses much larger that low strain moduli

Fracture of a biopolymer gel as a viscoplastic disentanglement process

We present an extensive experimental study of mode-I, steady, slow crack dynamics in gelatin gels. Taking advantage of the sensitivity of the elastic stiffness to gel composition and history we confirm and extend the model for fracture of physical hydrogels which we proposed in a previous paper (Nature Materials, doi:10.1038/nmat1666 (2006)), which attributes decohesion to the viscoplastic pull-out of the network-constituting chains. So, we propose that, in contrast with chemically cross-linked ones, reversible gels fracture without chain scission

Random Costs in Combinatorial Optimization

The random cost problem is the problem of finding the minimum in an exponentially long list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization problem, number partitioning, is essentially equivalent to the random cost problem. This explains the bad performance of heuristic approaches to the number partitioning problem and allows us to calculate the probability distributions of the optimum and sub-optimum costs.Comment: 4 pages, Revtex, 2 figures (eps), submitted to PR

Metamorphic testing of constraint solvers

Constraint solvers are complex pieces of software and are notoriously difficult to debug. In large part this is due to the difficulty of pinpointing the source of an error in the vast searches these solvers perform, since the effect of an error may only come to light long after the error is made. In addition, an error does not necessarily lead to the wrong result, further complicating the debugging process. A major source of errors in a constraint solver is the complex constraint propagation algorithms that provide the inference that controls and directs the search. In this paper we show that metamorphic testing is a principled way to test constraint solvers by comparing two different implementations of the same constraint. Specifically, specialised propagators for the constraint are tested against the general purpose table constraint propagator. We report on metamorphic testing of the constraint solver Minion. We demonstrate that the metamorphic testing method is very effective for finding artificial bugs introduced by random code mutation

The DLV System for Knowledge Representation and Reasoning

This paper presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to $\Delta^P_3$-complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof. Furthermore, we illustrate the general architecture of the DLV system which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.Comment: 56 pages, 9 figures, 6 table

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random Satisfiability problem, and its application to stop-and-restart resolutions

A large deviation analysis of the solving complexity of random 3-Satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. This exponentially small probability of easy resolutions is analytically calculated, and the corresponding exponent shown to be smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some theoretical basis to heuristic stop-and-restart solving procedures, and suggests a natural cut-off (the size of the instance) for the restart.Comment: Revtex file, 4 figure

New Observations and Analysis of the Bright Semi-Detached Eclipsing Binary mu1 Sco

Using new and published photometric observations of mu1 Sco (HR 6247), spanning 70 years, a period of 1.4462700(5) days was determined. It was found that the epoch of primary minimum suggested by Shobbrook at HJD 2449534.178 requires an adjustment to HJD 2449534.17700(9) to align all the available photometric datasets. Using the resulting combined-data light-curve, radial velocities derived from IUE data and the modelling software PHOEBE, a new system solution for this binary was obtained. It appears that the secondary is close to, or just filling, its Roche-lobe.Comment: 4 figures, 6 tables, 9 pages, uses mn2e.sty, to be published in MNRA