Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2023
Optimal dynamic partial order reduction with context-sensitive independence and observers
Journal of Systems and Software (JSSO), Volume 202, Issue CAug 2023https://doi.org/10.1016/j.jss.2023.111730AbstractDynamic Partial Order Reduction (DPOR) algorithms are used in stateless model checking of concurrent programs to avoid the exploration of equivalent execution sequences. In order to detect equivalence, DPOR relies on the notion of independence ...
Highlights- Extension of Context-sensitive DPOR to work over Optimal DPOR with wakeup trees.
- A new DPOR algorithm that integrates context-sensitive dependency and observers.
- Implementation and evaluation of these algorithms within the Nidhugg ...
- ArticleSeptember 2020
Core-Guided Model Reformulation
Principles and Practice of Constraint ProgrammingSep 2020, Pages 445–461https://doi.org/10.1007/978-3-030-58475-7_26AbstractConstraint propagation and SAT solvers often underperform when dealing with optimisation problems that have an additive (or separable) objective function. The core-guided search introduced by MaxSAT solvers can overcome this weakness by detecting ...
- research-articleJuly 2019
Optimal context-sensitive dynamic partial order reduction with observers
ISSTA 2019: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and AnalysisJuly 2019, Pages 352–362https://doi.org/10.1145/3293882.3330565Dynamic Partial Order Reduction (DPOR) algorithms are used in stateless model checking to avoid the exploration of equivalent execution sequences. DPOR relies on the notion of independence between execution steps to detect equivalence. Recent progress ...
- research-articleJanuary 2017
What do Constraint Programming Users Want to See? Exploring the Role of Visualisation in Profiling of Models and Search
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 23, Issue 1January 2017, Pages 281–290https://doi.org/10.1109/TVCG.2016.2598545Constraint programming allows difficult combinatorial problems to be modelled declaratively and solved automatically. Advances in solver technologies over recent years have allowed the successful use of constraint programming in many application areas. ...
- ArticleJuly 2015
Towards automatic dominance breaking for constraint optimization problems
IJCAI'15: Proceedings of the 24th International Conference on Artificial IntelligenceJuly 2015, Pages 360–366The exploitation of dominance relations in constraint optimization problems can lead to dramatic reductions in search space. We propose an automatic method to detect some of the dominance relations manually identified by Chu and Stuckey for optimization ...
-
- articleNovember 2014
On representing protein folding patterns using non-linear parametric curves
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), Volume 11, Issue 6Pages 1218–1228https://doi.org/10.1109/TCBB.2014.2338319Proteins fold into complex three-dimensional shapes. Simplified representations of their shapes are central to rationalise, compare, classify, and interpret protein structures. Traditional methods to abstract protein folding patterns rely on ...
- ArticleSeptember 2013
Globalizing constraint models
CP'13: Proceedings of the 19th International Conference on Principles and Practice of Constraint ProgrammingSeptember 2013, Pages 432–447We present a method that, given a constraint model, suggests global constraints to replace parts of it. This helps non-expert users to write higher-level models that are easier to reason about and may result in better solving performance. Our method ...
- articleJanuary 2012
Introduction to the special issue on prolog systems
Theory and Practice of Logic Programming (TPLP), Volume 12, Issue 1-2January 2012, Pages 1–4https://doi.org/10.1017/S1471068411000524It has now been 40 years since the birth of the Prolog language and of its first implementation by A. Colmerauer and P. Roussel. Since then, a large number of Prolog systems have been implemented. While the core of the Prolog language has not changed ...
- ArticleJuly 2011
Symmetries and lazy clause generation
IJCAI'11: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume OneJuly 2011, Pages 516–521Lazy clause generation is a powerful approach to reducing search in constraint programming. This is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators. Symmetry breaking approaches are also ...
- articleMarch 2011
Introduction to the 24th international conference on logic programming special issue
Theory and Practice of Logic Programming (TPLP), Volume 11, Issue 2-3March 2011, Pages 131–133https://doi.org/10.1017/S1471068411000020The ICLP series of conferences provides a technical forum for presenting and disseminating innovative research in the field of logic programming. The 24th International Conference on Logic Programming took place from December 9???13, 2008 in the city of ...
- ArticleJune 2010
Automatically exploiting subproblem equivalence in constraint programming
CPAIOR'10: Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization ProblemsJune 2010, Pages 71–86https://doi.org/10.1007/978-3-642-13520-0_10Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when two different search paths lead to identical remaining subproblems, that is ...
- ArticleSeptember 2009
Using relaxations in maximum density still life
CP'09: Proceedings of the 15th international conference on Principles and practice of constraint programmingSeptember 2009, Pages 258–273The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway's Game of Life. We reformulate the problem into one of minimising "wastage" rather than ...
- ArticleMay 2008
A novel approach for detecting symmetries in CSP models
CPAIOR'08: Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problemsMay 2008, Pages 158–172While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetries in CSP models are limited to the kind of symmetries that can be inferred from ...
- articleOctober 2007
Dynamic Programming to Minimize the Maximum Number of Open Stacks
INFORMS Journal on Computing (INFORMS-IJOC), Volume 19, Issue 4Fall 2007, Pages 607–617https://doi.org/10.1287/ijoc.1060.0205We give a dynamic-programming solution to the problem of minimizing the maximum number of open stacks. Starting from a call-based dynamic program, we show a number of ways to improve the dynamic-programming search, preprocess the problem to simplify it, ...
- ArticleJanuary 2007
From zinc to design model
PADL'07: Proceedings of the 9th international conference on Practical Aspects of Declarative LanguagesJanuary 2007, Pages 215–229https://doi.org/10.1007/978-3-540-69611-7_14We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically mapped into different design models, thus allowing modellers to easily “...
- articleNovember 2006
Improving PARMA trailing
Theory and Practice of Logic Programming (TPLP), Volume 6, Issue 6November 2006, Pages 609–644https://doi.org/10.1017/S1471068405002620Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation. Both the HAL and dProlog languages make use of the PARMA ...
- ArticleSeptember 2006
The modelling language zinc
CP'06: Proceedings of the 12th international conference on Principles and Practice of Constraint ProgrammingSeptember 2006, Pages 700–705https://doi.org/10.1007/11889205_54We describe the Zinc modelling language. Zinc provides set constraints, user defined types, constrained types, and polymorphic predicates and functions. The last allows Zinc to be readily extended to different application domains by user-defined ...
- ArticleJanuary 2006
Adding constraint solving to mercury
PADL'06: Proceedings of the 8th international conference on Practical Aspects of Declarative LanguagesJanuary 2006, Pages 118–133https://doi.org/10.1007/11603023_9The logic programming language Mercury is designed to support programming in the large. Programmer declarations in conjunction with powerful compile-time analysis and optimization allow Mercury programs to be very efficient. The original design of ...
- articleNovember 2005
Checking modes of HAL programs
Theory and Practice of Logic Programming (TPLP), Volume 5, Issue 6November 2005, Pages 623–667https://doi.org/10.1017/S1471068404002327Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-...
- ArticleOctober 2005
The g12 project: mapping solver independent models to efficient solutions
- Peter J. Stuckey,
- Maria Garcia de la Banda,
- Michael Maher,
- Kim Marriott,
- John Slaney,
- Zoltan Somogyi,
- Mark Wallace,
- Toby Walsh
ICLP'05: Proceedings of the 21st international conference on Logic ProgrammingOctober 2005, Pages 9–13https://doi.org/10.1007/11562931_3The G12 project recently started by National ICT Australia (NICTA)is an ambitious project to develop a software platform for solving large scale industrial combinatorial optimisation problems. The core design involves three languages: Zinc, Cadmium and ...