Constraint solving in non-permutative nominal abstract syntax

Nominal abstract syntax is a popular first-order technique for encoding, and reasoning about, abstract syntax involving binders. Many of its applications involve constraint solving. The most commonly used constraint solving algorithm over nominal abstract syntax is the Urban-Pitts-Gabbay nominal unification algorithm, which is well-behaved, has a well-developed theory and is applicable in many cases. However, certain problems require a constraint solver which respects the equivariance property of nominal logic, such as Cheney's equivariant unification algorithm. This is more powerful but is more complicated and computationally hard. In this paper we present a novel algorithm for solving constraints over a simple variant of nominal abstract syntax which we call non-permutative. This constraint problem has similar complexity to equivariant unification but without many of the additional complications of the equivariant unification term language. We prove our algorithm correct, paying particular attention to issues of termination, and present an explicit translation of name-name equivariant unification problems into non-permutative constraints

A simple genetic algorithm for calibration of stochastic rock discontinuity networks

Este artículo propone un método para llevar a cabo la calibración de las familias de discontinuidades en macizos rocosos. We present a novel approach for calibration of stochastic discontinuity network parameters based on genetic algorithms (GAs). To validate the approach, examples of application of the method to cases with known parameters of the original Poisson discontinuity network are presented. Parameters of the model are encoded as chromosomes using a binary representation, and such chromosomes evolve as successive generations of a randomly generated initial population, subjected to GA operations of selection, crossover and mutation. Such back-calculated parameters are employed to make assessments about the inference capabilities of the model using different objective functions with different probabilities of crossover and mutation. Results show that the predictive capabilities of GAs significantly depend on the type of objective function considered; and they also show that the calibration capabilities of the genetic algorithm can be acceptable for practical engineering applications, since in most cases they can be expected to provide parameter estimates with relatively small errors for those parameters of the network (such as intensity and mean size of discontinuities) that have the strongest influence on many engineering applications

Automatic Mapping of Discontinuity Persistence on Rock Masses Using 3D Point Clouds

Finding new ways to quantify discontinuity persistence values in rock masses in an automatic or semi-automatic manner is a considerable challenge, as an alternative to the use of traditional methods based on measuring patches or traces with tapes. Remote sensing techniques potentially provide new ways of analysing visible data from the rock mass. This work presents a methodology for the automatic mapping of discontinuity persistence on rock masses, using 3D point clouds. The method proposed herein starts by clustering points that belong to patches of a given discontinuity. Coplanar clusters are then merged into a single group of points. Persistence is measured in the directions of the dip and strike for each coplanar set of points, resulting in the extraction of the length of the maximum chord and the area of the convex hull. The proposed approach is implemented in a graphic interface with open source software. Three case studies are utilized to illustrate the methodology: (1) small-scale laboratory setup consisting of a regular distribution of cubes with similar dimensions, (2) more complex geometry consisting of a real rock mass surface in an excavated cavern and (3) slope with persistent sub-vertical discontinuities. Results presented good agreement with field measurements, validating the methodology. Complexities and difficulties related to the method (e.g. natural discontinuity waviness) are reported and discussed. An assessment on the applicability of the method to the 3D point cloud is also presented. Utilization of remote sensing data for a more objective characterization of the persistence of planar discontinuities affecting rock masses is highlighted herein

Geological discontinuity persistence: Implications and quantification

Persistence of geological discontinuities is of great importance for many rock-related applications in earth sciences, both in terms of mechanical and hydraulic properties of individual discontinuities and fractured rock masses. Although the importance of persistence has been identified by academics and practitioners over the past decades, quantification of areal persistence remains extremely difficult; in practice, trace length from finite outcrop is still often used as an approximation for persistence. This paper reviews the mechanical behaviour of individual discontinuities that are not fully persistent, and the implications of persistence on the strength and stability of rock masses. Current techniques to quantify discontinuity persistence are then examined. This review will facilitate application of the most applicable methods to measure or predict persistence in rock engineering projects, and recommended approaches for the quantification of discontinuity persistence. Furthermore, it demonstrates that further research should focus on the development of persistence quantification standards to promote our understanding of rock mass behaviours including strength, stability and permeability

Bounded model checking with QBF

Abstract. Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion problem. Methods based on the validity of Quantified Boolean Formulas (QBF) allow an exponentially more succinct representation of the checked formulas, but have not been widely used, because of the lack of an efficient decision procedure for QBF. We evaluate the usage of QBF in BMC, using general-purpose SAT and QBF solvers. We also present a special-purpose decision procedure for QBF used in BMC, and compare our technique with the methods using general-purpose SAT and QBF solvers on real-life industrial benchmarks. Our procedure performs much better for BMC than the general-purpose QBF solvers, without incurring the space overhead of propositional SAT.

Termination by abstraction

Abstract. Abstraction can be used very effectively to decompose and simplify termination arguments. If a symbolic computation is nonterminating, then there is an infinite computation with a top redex, such that all redexes are immortal, but all children of redexes are mortal. This suggests applying weakly-monotonic well-founded relations in abstractionbased termination methods, expressed here within an abstract framework for term-based proofs. Lexicographic combinations of orderings may be used to match up with multiple levels of abstraction. A small number of firms have decided to terminate their independent abstraction schemes

Balanced Paths in Colored Graphs

Abstract. We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infinite path where either (i) all colors occur with the same asymptotic frequency, or (ii) there is a constant which bounds the difference between the occurrences of any two colors for all prefixes of the path. These two notions can be viewed as refinements of the classical notion of fair path, whose simplest form checks whether all colors occur infinitely often. Our notions provide stronger criteria, particularly suitable for scheduling applications based on a coarse-grained model of the jobs involved. We show that both problems are solvable in polynomial time, by reducing them to the feasibility of a linear program.