60 research outputs found

    Solving Set Constraint Satisfaction Problems using ROBDDs

    Full text link
    In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems

    SAT Solving for Argument Filterings

    Full text link
    This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (1) the combined search for a lexicographic path order together with an \emph{argument filtering} to orient a set of inequalities; and (2) how the choice of the argument filtering influences the set of inequalities that have to be oriented. We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power

    Torreyana Centennial Tribute

    Get PDF
    I was only eleven years old, but the impression made was lasting. I've never tired of the beauty, vistas and the freedom offered here. We celebrate 100 years of preserving this precious resource, and our main goal is to provide everyone with a cherished memory that will bring you back again and again. The 100-year anniversary of Torrey Pines State Reserve will be celebrated as a free aliday event on Saturday, October 9. Shuttle service from both beach parking lots to the Lodge will be provided. The Californi

    Detecting Determinacy in Prolog Programs: 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings

    Get PDF
    In program development it is useful to know that a call to a Prolog program will not inadvertently leave a choice-point on the stack. Determinacy inference has been proposed for solving this problem yet the analysis was found to be wanting in that it could not infer determinacy conditions for programs that contained cuts or applied certain tests to select a clause. This paper shows how to remedy these serious deficiencies. It also addresses the problem of identifying those predicates which can be rewritten in a more deterministic fashion. To this end, a radically new form of determinacy inference is introduced, which is founded on ideas in ccp, that is capable of reasoning about the way bindings imposed by a rightmost goal can make a leftmost goal deterministic

    Combining norms to prove termination

    Get PDF
    Automatic termination analyzers typically measure the size of terms applying norms which are mappings from terms to the natural numbers. This paper illustrates how to enable the use of size functions defined as tuples of these simpler norm functions. This approach enables us to simplify the problem of deriving automatically a candidate norm with which to prove termination. Instead of deriving a single, complex norm function, it is sufficient to determine a collection of simpler norms, some combination of which, leads to a proof of termination. We propose that a collection of simple norms, one for each of the recursive data-types in the program, is often a suitable choice. We first demonstrate the power of combining norm functions and then the adequacy of combining norms based on regular-types

    Inference of Well-Typings for Logic Programs with Application to Termination Analysis

    Get PDF
    This paper develops a method to infer a polymorphic well-typing for a logic program. One of the main motivations is to contribute to a better automation of termination analysis in logic programs, by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared by the user, or automatically generated monomorphic types describing the success set of predicates. Declared types are typically more precise and result in stronger termination conditions than those obtained with inferred types. Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation. Experiments show that our automatically inferred well-typings are close to the declared types and thus result in termination conditions that are as good as those obtained with declared types for all our experiments to date. We describe the method, its implementation and experiments with termination analysis based on the inferred types

    Environmental interactions of tidal lagoons: A comparison of industry perspectives

    Get PDF
    Tidal lagoons are an attractive renewable energy option that could aid the UK in meeting its ambitious renewable energy targets. One of the main barriers to tidal range development in the UK to date has been regulatory environmental concern. In order for the nascent lagoon industry to move forward into development, the views of the developers and other influential stakeholders such as government bodies, regulators, conservationists and practitioners (herein referred to as 'influencing stakeholders' or 'influencers') need to be aligned. This study is the first of its kind using online questionnaires and semi-structured interviews to present and compare the views of both developers and influencing stakeholders on the environmental interactions of tidal lagoons. We find that, whilst both influencers and developers are working towards the common goal of a good environmental outcome for tidal lagoons, there are mismatches in their views in terms of the priorities given to the key environmental impacts, benefits and potential solution options. The work provides insight into what is at the forefront of developers' and influencers' minds, highlighting the key themes within their views and transforming this information into policy recommendations that will help the industry's development move forward

    Kinetic energy extraction of a tidal stream turbine and its sensitivity to structural stiffness attenuation

    Get PDF
    © 2015 The Authors. The hydrodynamic forces imparted on a tidal turbine rotor, whilst causing it to rotate and hence generate power, will also cause the blades to deform. This deformation will affect the turbine's performance if not included in the early design phase and could lead to a decrease in power output and a reduction in operational life. Conversely, designing blades to allow them to deform slightly may reduce localised stress and therefore prolong the life of the blades and allow the blades to deform in to their optimum operational state. The aim of this paper is to better understand the kinetic energy extraction by varying the material modulus of a turbine blade. Shaft torque/power, blade tip displacement, and axial thrust results are presented for 2, 3 and 4 bladed rotor configurations at peak power extraction. For the rotor design studied the FSI model data show that there is a low sensitivity to blade deformation for the 2, 3 and 4 bladed rotors. However, the results reveal that the 3 bladed rotor displayed maximum hydrodynamic performance as a rigid structure which then decreased as the blade deformed. The 2 and 4 bladed rotor configurations elucidated a slight increase in hydrodynamic performance with deflection
    • …
    corecore