ORCID Profile
0000-0003-2186-0459
Current Organisation
Monash University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Artificial Intelligence and Image Processing | Computer Software | Artificial Intelligence and Image Processing not elsewhere classified | Programming Languages | Pattern Recognition and Data Mining | Computational Logic and Formal Languages | Programming Languages | Operations Research | Adaptive Agents and Intelligent Robotics | Other Artificial Intelligence | Applied Mathematics | Information Systems | Neural, Evolutionary and Fuzzy Computation | Computer System Security | Interfaces And Presentation (Excl. Computer-Human Interaction) | Text Processing | Software Engineering | Optimisation | Logistics and Supply Chain Management | Stochastic Analysis and Modelling | Decision Support And Group Support Systems | Intelligent Robotics | Multimedia Programming | Pattern Recognition
ANZSRC Socio-Economic Objective (SEO)
Computer Software and Services not elsewhere classified | Computer software and services not elsewhere classified | Application Tools and System Utilities | Mining and Extraction of Iron Ores | Expanding Knowledge in the Information and Computing Sciences | Application packages | Technological and Organisational Innovation | Energy Services and Utilities | Environmentally Sustainable Mineral Resource Activities not elsewhere classified | Urban and Industrial Water Management | Industrial Energy Conservation and Efficiency | Application Software Packages (excl. Computer Games) | Information Processing Services (incl. Data Entry and Capture) | Coal Mining and Extraction | Expanding Knowledge in the Biological Sciences | Expanding Knowledge in the Mathematical Sciences | Computer hardware and electronic equipment not elsewhere classified | Instrumentation not elsewhere classified |
Related Links
Publications
Symmetries, almost symmetries, and lazy clause generation
Publisher: Springer Science and Business Media LLC
Date: 16-03-2014
A CLP heap solver for test case generation
Publisher: Cambridge University Press (CUP)
Date: 07-2013
DOI: 10.1017/S1471068413000458
Abstract: One of the main challenges to software testing today is to efficiently handle heap-manipulating programs. These programs often build complex, dynamically allocated data structures during execution and, to ensure reliability, the testing process needs to consider all possible shapes these data structures can take. This creates scalability issues since high (often exponential) numbers of shapes may be built due to the aliasing of references. This paper presents a novel CLP heap solver for the test case generation of heap-manipulating programs that is more scalable than previous proposals, thanks to the treatment of reference aliasing by means of disjunction , and to the use of advanced back-propagation of heap related constraints. In addition, the heap solver supports the use of heap assumptions to avoid aliasing of data that, though legal, should not be provided as input.
Stable model semantics for founded bounds
Publisher: Cambridge University Press (CUP)
Date: 07-2013
DOI: 10.1017/S147106841300032X
Abstract: Answer Set Programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics , which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effectively. In this paper, we generalize the notion of stable models to bound founded variables with arbitrary domains, where bounds on such variables need to be justified by some rule in the program in order for the model to be stable. We show how to handle significantly more general rule forms where bound founded variables can act as head or body variables, and where head and body variables can be related via complex constraints subject to certain monotonicity requirements. We describe a new unfounded set detection algorithm which allows us to enforce this generalization of the stable model semantics. We also show how these unfounded sets can be explained in order to allow effective conflict-directed clause learning. The new solver merges the best features of CP, SAT and ASP solvers and allows new types of problems to be solved very efficiently.
Solver-Independent Large Neighbourhood Search
Publisher: Springer International Publishing
Date: 2018
Loop Untangling
Publisher: Springer International Publishing
Date: 2014
Large Neighborhood Search for Temperature Control with Demand Response
Publisher: Springer International Publishing
Date: 2020
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Publisher: Springer Science and Business Media LLC
Date: 19-11-2009
Explaining circuit propagation
Publisher: Springer Science and Business Media LLC
Date: 22-08-2013
Abstract interpretation over non-lattice abstract domains
Publisher: Springer Berlin Heidelberg
Date: 2013
Incremental Satisfiability and Implication for UTVPI Constraints
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-2010
Abstract: Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints that are polynomial time solvable (unless P = NP). There is considerable interest in their use for constraint solving, abstract interpretation, spatial database algorithms, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction and implication checking that require ℴ(m + n log n + p) time and ℴ(n + m + p) space to incrementally check satisfiability of m UTVPI constraints on n variables, and we check the implication of p UTVPI constraints. The algorithms can be straightforwardly extended to create nonincremental implication checking and generation of all (nonredundant) implied constraints, as well as generate minimal unsatisfiable subsets and minimal implicants.
Those Who Cannot Remember the Past Are Condemned to Repeat It
Publisher: Springer Berlin Heidelberg
Date: 2013
A General Implementation Framework for Tabled CLP
Publisher: Springer Berlin Heidelberg
Date: 2012
Statistical Inference of Protein LEGO Bricks
Publisher: IEEE
Date: 12-2013
DOI: 10.1109/ICDM.2013.73
Disjunctive Interval Analysis
Publisher: Springer International Publishing
Date: 2021
Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search
Publisher: Springer International Publishing
Date: 2019
Piecewise linear approximation of protein structures using the principle of minimum message length
Publisher: Oxford University Press (OUP)
Date: 14-06-2011
DOI: 10.1093/BIOINFORMATICS/BTR240
Abstract: Simple and concise representations of protein-folding patterns provide powerful abstractions for visualizations, comparisons, classifications, searching and aligning structural data. Structures are often abstracted by replacing standard secondary structural features—that is, helices and strands of sheet—by vectors or linear segments. Relying solely on standard secondary structure may result in a significant loss of structural information. Further, traditional methods of simplification crucially depend on the consistency and accuracy of external methods to assign secondary structures to protein coordinate data. Although many methods exist automatically to identify secondary structure, the impreciseness of definitions, along with errors and inconsistencies in experimental structure data, drastically limit their applicability to generate reliable simplified representations, especially for structural comparison. This article introduces a mathematically rigorous algorithm to delineate protein structure using the elegant statistical and inductive inference framework of minimum message length (MML). Our method generates consistent and statistically robust piecewise linear explanations of protein coordinate data, resulting in a powerful and concise representation of the structure. The delineation is completely independent of the approaches of using hydrogen-bonding patterns or inspecting local substructural geometry that the current methods use. Indeed, as is common with applications of the MML criterion, this method is free of parameters and thresholds, in striking contrast to the existing programs which are often beset by them. The analysis of results over a large number of proteins suggests that the method produces consistent delineation of structures that encompasses, among others, the segments corresponding to standard secondary structure. Availability: www.csse.monash.edu.au/~karun mml. Contact: arun.konagurthu@monash.edu lloyd.allison@monesh.edu
Encoding Linear Constraints into SAT
Publisher: Springer International Publishing
Date: 2014
Lock-free parallel dynamic programming
Publisher: Elsevier BV
Date: 08-2010
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers
Publisher: Springer International Publishing
Date: 2014
Smooth Linear Approximation of Non-overlap Constraints
Publisher: Springer Berlin Heidelberg
Date: 2008
Modelling with Option Types in MiniZinc
Publisher: Springer International Publishing
Date: 2014
Exact Approaches to the Multi-agent Collective Construction Problem
Publisher: Springer International Publishing
Date: 2020
Nested Constraint Programs
Publisher: Springer International Publishing
Date: 2014
Local search for a cargo assembly planning problem
Publisher: Springer International Publishing
Date: 2014
Flexible, Rule-Based Constraint Model Linearisation
Publisher: Springer Berlin Heidelberg
Date: 2008
Breaking Symmetries with Lex Implications
Publisher: Springer International Publishing
Date: 2018
Half Reification and Flattening
Publisher: Springer Berlin Heidelberg
Date: 2011
Branch-and-cut-and-price for multi-agent path finding
Publisher: Elsevier BV
Date: 08-2022
Information-Theoretic Inference of an Optimal Dictionary of Protein Supersecondary Structures
Publisher: Springer New York
Date: 2019
Ballot-Polling Audits of Instant-Runoff Voting Elections with a Dirichlet-Tree Model
Publisher: Springer International Publishing
Date: 2023
Solving talent scheduling with dynamic programming
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 02-2011
Abstract: We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution by preprocessing and restricting the search. We show how by considering a bounded version of the problem, and determining lower and upper bounds, we can improve the search. We then show how ordering the scenes from both ends can drastically reduce the search space. The final dynamic programming solution is orders of magnitude faster than competing approaches and finds optimal solutions to larger problems than were considered previously.
Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation
Publisher: Springer Science and Business Media LLC
Date: 08-11-2018
The future of optimization technology
Publisher: Springer Science and Business Media LLC
Date: 07-09-2013
An iterative approach to precondition inference using constrained Horn clauses
Publisher: Cambridge University Press (CUP)
Date: 07-2018
DOI: 10.1017/S1471068418000091
Abstract: We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained Horn clauses (CHCs) are used to model the program and assertions in a uniform way, and we use standard abstract interpretations to derive an over-approximation of the set of unsafe initial states. The precondition then is the constraint corresponding to the complement of that set, under-approximating the set of safe initial states. This idea of complementation is not new, but previous attempts to exploit it have suffered from the loss of precision. Here we develop an iterative specialisation algorithm to give more precise, and in some cases optimal safety conditions. The algorithm combines existing transformations, namely constraint specialisation, partial evaluation and a trace elimination transformation. The last two of these transformations perform polyvariant specialisation, leading to disjunctive constraints which improve precision. The algorithm is implemented and tested on a benchmark suite of programs from the literature in precondition inference and software verification competitions.
Synthesizing Optimal Switching Lattices
Publisher: Association for Computing Machinery (ACM)
Date: 18-11-2014
DOI: 10.1145/2661632
Abstract: The use of nanoscale technologies to create electronic devices has revived interest in the use of regular structures for defining complex logic functions. One such structure is the switching lattice, a two-dimensional lattice of four-terminal switches. We show how to directly construct switching lattices of polynomial size from arbitrary logic functions we also show how to synthesize minimal-sized lattices by translating the problem to the satisfiability problem for a restricted class of quantified Boolean formulas. The synthesis method is an anytime algorithm that uses modern SAT solving technology and dichotomic search. It improves considerably on an earlier proposal for creating switching lattices for arbitrary logic functions.
Fast and accurate protein substructure searching with simulated annealing and GPUs
Publisher: Springer Science and Business Media LLC
Date: 03-09-2010
Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss
Publisher: Association for Computing Machinery (ACM)
Date: 20-01-2015
DOI: 10.1145/2651360
Abstract: The most commonly used integer types have fixed bit-width, making it possible for computations to “wrap around,” and many programs depend on this behaviour. Yet much work to date on program analysis and verification of integer computations treats integers as having infinite precision, and most analyses that do respect fixed width lose precision when overflow is possible. We present a novel integer interval abstract domain that correctly handles wrap-around. The analysis is signedness agnostic. By treating integers as strings of bits, only considering signedness for operations that treat them differently, we produce precise, correct results at a modest cost in execution time.
Statistical Compression of Protein Folding Patterns for Inference of Recurrent Substructural Themes
Publisher: IEEE
Date: 04-2017
DOI: 10.1109/DCC.2017.46
A First Approach to Risk-Limiting Audits for Single Transferable Vote Elections
Publisher: Springer International Publishing
Date: 2023
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
Publisher: Springer International Publishing
Date: 2020
Scheduling Optional Tasks with Explanation
Publisher: Springer Berlin Heidelberg
Date: 2013
Range-Consistent Forbidden Regions of Allen’s Relations
Publisher: Springer International Publishing
Date: 2017
Optimal context-sensitive dynamic partial order reduction with observers
Publisher: ACM
Date: 10-07-2019
Optimal Carpet Cutting
Publisher: Springer Berlin Heidelberg
Date: 2011
Stochastic MiniZinc
Publisher: Springer International Publishing
Date: 2014
A complete solution to the Maximum Density Still Life Problem
Publisher: Elsevier BV
Date: 06-2012
Solving difference constraints over modular arithmetic
Publisher: Springer Berlin Heidelberg
Date: 2013
Short-term planning for open pit mines: a review
Publisher: Informa UK Limited
Date: 26-03-2018
A Model for Inter-module Analysis and Optimizing Compilation
Publisher: Springer Berlin Heidelberg
Date: 2001
Optimal k-Level Planarization and Crossing Minimization
Publisher: Springer Berlin Heidelberg
Date: 2011
Maximising the Net Present Value for Resource-Constrained Project Scheduling
Publisher: Springer Berlin Heidelberg
Date: 2012
Explaining the cumulative propagator
Publisher: Springer Science and Business Media LLC
Date: 27-08-2010
Piloting a Shared Source Water Treatment Intervention among Elementary Schools in Bangladesh
Publisher: American Society of Tropical Medicine and Hygiene
Date: 06-11-2019
Analyzing Array Manipulating Programs by Program Transformation
Publisher: Springer International Publishing
Date: 2015
Search Combinators
Publisher: Springer Berlin Heidelberg
Date: 2011
A Tool for Intersecting Context-Free Grammars and Its Applications
Publisher: Springer International Publishing
Date: 2015
Logistics optimization for a coal supply chain
Publisher: Springer Science and Business Media LLC
Date: 14-01-2020
Combining string abstract domains for javascript analysis: An evaluation
Publisher: Springer Berlin Heidelberg
Date: 2017
A Fresh Look at Zones and Octagons
Publisher: Association for Computing Machinery (ACM)
Date: 03-09-2021
DOI: 10.1145/3457885
Abstract: Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numerical relations that hold between pairs of program variables. Both domains are well understood mathematically but the detailed implementation of static analyses based on these domains poses many interesting algorithmic challenges. In this article, we study the two abstract domains, their implementation and use. Utilizing improved data structures and algorithms for the manipulation of graphs that represent difference-bound constraints, we present fast implementations of both abstract domains, built around a common infrastructure. We compare the performance of these implementations against alternative approaches offering the same precision. We quantify the differences in performance by measuring their speed and precision on standard benchmarks. We also assess, in the context of software verification, the extent to which the improved precision translates to better verification outcomes. Experiments demonstrate that our new implementations improve the state of the art for both Zones and Octagons significantly.
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2021
Dissecting widening: Separating termination from information
Publisher: Springer International Publishing
Date: 2019
Explaining Flow-Based Propagation
Publisher: Springer Berlin Heidelberg
Date: 2012
Explaining Propagators for s-DNNF Circuits
Publisher: Springer Berlin Heidelberg
Date: 2012
Discovery and analysis of consistent active sub-networks in cancers
Publisher: Springer Science and Business Media LLC
Date: 2013
A Novel Approach to String Constraint Solving
Publisher: Springer International Publishing
Date: 2017
Propagating systems of dense linear integer constraints
Publisher: Springer Science and Business Media LLC
Date: 10-05-2008
Optimal automatic table layout
Publisher: ACM
Date: 19-09-2011
Enumerated Types and Type Extensions for MiniZinc
Publisher: Springer International Publishing
Date: 2022
Exploration of Networks using overview+detail with Constraint-based cooperative layout
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2008
Optimizing Compilation of CHR with Rule Priorities
Publisher: Springer Berlin Heidelberg
Date: 2008
Tableau-based protein substructure search using quadratic programming
Publisher: Springer Science and Business Media LLC
Date: 19-05-2009
Optimal Bounds for Floating-Point Addition in Constant Time
Publisher: IEEE
Date: 06-2019
A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-2014
Abstract: We consider the short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine is transported by rail to a set of ports and blended into signature products for shipping. Consistency in the grade and quality of production over time is critical for customer satisfaction, whereas the maximal production of blended products is required to maximise profit. In practice, short-term schedules are formed independently at each mine, tasked with achieving the grade and quality targets outlined in a medium-term plan. However, because of uncertainty in the data available to a medium-term planner and the dynamics of the mining environment, such targets may not be feasible in the short term. We present a decomposition-based heuristic for this short-term scheduling problem in which the grade and quality goals assigned to each mine are collaboratively adapted—ensuring the satisfaction of blending constraints at each port and exploiting opportunities to maximise production in the network that would otherwise be missed.
Compiling Conditional Constraints
Publisher: Springer International Publishing
Date: 2019
MUSTANG-MR Structural Sieving Server: Applications in Protein Structural Analysis and Crystallography
Publisher: Public Library of Science (PLoS)
Date: 06-04-2010
Seeing Around Corners: Fast Orthogonal Connector Routing
Publisher: Springer Berlin Heidelberg
Date: 2014
Structural search and retrieval using a tableau representation of protein folding patterns
Publisher: Oxford University Press (OUP)
Date: 05-01-2008
DOI: 10.1093/BIOINFORMATICS/BTM641
Abstract: Comparison and classification of folding patterns from a database of protein structures is crucial to understand the principles of protein architecture, evolution and function. Current search methods for proteins with similar folding patterns are slow and computationally intensive. The sharp growth in the number of known protein structures poses severe challenges for methods of structural comparison. There is a need for methods that can search the database of structures accurately and rapidly. We provide several methods to search for similar folding patterns using a concise tableau representation of proteins that encodes the relative geometry of secondary structural elements. Our first approach allows the extraction of identical and very closely-related protein folding patterns in constant-time (per hit). Next, we address the hard computational problem of extraction of maximally-similar subtableaux, when comparing two tableaux. We solve the problem using Quadratic and Linear integer programming formulations and demonstrate their power to identify subtle structural similarities, especially when protein structures significantly erge. Finally, we describe a rapid and accurate method for comparing a query structure against a database of protein domains, TableauSearch. TableauSearch is rapid enough to search the entire structural database in seconds on a standard desktop computer. Our analysis of TableauSearch on many queries shows that the method is very accurate in identifying similarities of folding patterns, even between distantly related proteins. Availability: A web server implementing the TableauSearch is available from hollywood.bx.psu.edu/TabSearch Contact: arun@bx.psu.edu, aml25@psu.edu Supplementary information: Supplementary Data are available at Bioinformatics online.
Failure tabled constraint logic programming by interpolation
Publisher: Cambridge University Press (CUP)
Date: 07-2013
DOI: 10.1017/S1471068413000379
Abstract: We present a new execution strategy for constraint logic programs called Failure Tabled CLP . Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations . This allows us to compute interpolants rather than constraint projection for generation of reuse conditions . As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.
Modelling Destructive Assignments
Publisher: Springer Berlin Heidelberg
Date: 2013
Explaining Propagators for Edge-Valued Decision Diagrams
Publisher: Springer Berlin Heidelberg
Date: 2013
Short-term scheduling of an open-pit mine with multiple objectives
Publisher: Informa UK Limited
Date: 23-08-2016
The Design of the Zinc Modelling Language
Publisher: Springer Science and Business Media LLC
Date: 14-05-2008
Memoizing a Monadic Mixin DSL
Publisher: Springer Berlin Heidelberg
Date: 2011
Regarding Jump Point Search and Subgoal Graphs
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2019
Abstract: In this paper, we define Jump Point Graphs (JP), a preprocessing-based path-planning technique similar to Subgoal Graphs (SG). JP allows for the first time the combination of Jump Point Search style pruning in the context of abstraction-based speedup techniques, such as Contraction Hierarchies. We compare JP with SG and its variants and report new state-of-the-art results for grid-based pathfinding.
Optimal dynamic partial order reduction with context-sensitive independence and observers
Publisher: Elsevier BV
Date: 08-2023
CP and IP approaches to cancer radiotherapy delivery optimization
Publisher: Springer Science and Business Media LLC
Date: 24-11-2011
Assertion-Based Approaches to Auditing Complex Elections, with Application to Party-List Proportional Elections
Publisher: Springer International Publishing
Date: 2021
Forward-Looking Traffic-Aware High-Level Decision Control (HLDC) Algorithm for Hybrid Electric-Connected and Automated Vehicles (HE-CAVs)
Publisher: SAE International
Date: 14-10-2020
Random Errors Are Not Necessarily Politically Neutral
Publisher: Springer International Publishing
Date: 2020
MiniZinc with Strings
Publisher: Springer International Publishing
Date: 2017
Coupling Different Integer Encodings for SAT
Publisher: Springer International Publishing
Date: 2022
Automatic Minimal-Height Table Layout
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 08-2015
Abstract: Automatic layout of tables is useful in word processing applications and is required in online applications because of the need to tailor the layout to viewport width, choice of font, and dynamic content. However, if the table contains text, minimizing the height of the table for a given maximum width is a difficult combinatorial optimization problem because of the need to find the right choice of height/width configuration for each cell in the table. We investigate the modelling decisions involved in formulating this problem for use with standard combinatorial optimization techniques that are guaranteed to find the minimal-height table. To the best of our knowledge, we are the first to do so. We provide a detailed empirical evaluation of the resulting models using mixed integer programming and constraint programming with lazy clause generation.
Dominance Driven Search
Publisher: Springer Berlin Heidelberg
Date: 2013
Solving Satisfaction Problems Using Large-Neighbourhood Search
Publisher: Springer International Publishing
Date: 2020
Dashed Strings and the Replace(-all) Constraint
Publisher: Springer International Publishing
Date: 2020
Exploring Declarative Local-Search Neighbourhoods with Constraint Programming
Publisher: Springer International Publishing
Date: 2019
Horn clauses as an intermediate representation for program analysis and transformation
Publisher: Cambridge University Press (CUP)
Date: 07-2015
DOI: 10.1017/S1471068415000204
Abstract: Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine language or other low-level language, while maintaining the simple semantics that makes it suitable as a language for program analysis and transformation. We present a simple LP language that enforces determinism and single-modedness, and show that it makes a convenient program representation for analysis and transformation.
Boolean Constraints for Binding-Time Analysis
Publisher: Springer Berlin Heidelberg
Date: 2001
Exploiting subproblem dominance in constraint programming
Publisher: Springer Science and Business Media LLC
Date: 16-11-2012
The G12 Project: Mapping Solver Independent Models to Efficient Solutions
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11564751_4
A Framework for Analysis of Typed Logic Programs
Publisher: Springer Berlin Heidelberg
Date: 2001
A Decomposition-Based Algorithm for the Scheduling of Open-Pit Networks Over Multiple Time Periods
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 09-2016
Abstract: We consider the multiple-time-period, short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine, in each period, is transported by rail to a set of ports and blended into products for shipping. Each port forms these blends to a specification, as stipulated in contracts with downstream customers. This problem belongs to a class of multiple producer/consumer scheduling problems in which producers are able to generate a range of products, a combination of which are required by consumers to meet specified demands. In practice, short-term schedules are formed independently at each mine, tasked with achieving a grade and quality target outlined in a medium-term plan. Because of uncertainty in the data available to a medium-term planner and the dynamics of the mining environment, such targets may not be feasible in the short term. In this paper, we present an algorithm in which the grade and quality targets assigned to each mine are iteratively adapted, ensuring the satisfaction of blending constraints at each port while generating schedules for each mine that maximise resource utilisation. This paper was accepted by Yinyu Ye, optimization.
Frontmatter, Table of Contents, Preface, Conference Organization
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2011
Compiling CP subproblems to MDDs and d-DNNFs
Publisher: Springer Science and Business Media LLC
Date: 09-11-2019
MIRAGAA--a methodology for finding coordinated effects of microRNA expression changes and genome aberrations in cancer.
Publisher: Oxford University Press (OUP)
Date: 23-11-2010
DOI: 10.1093/BIOINFORMATICS/BTP654
Abstract: Motivation: Cancer evolves through microevolution where random lesions that provide the biggest advantage to cancer stand out in their frequent occurrence in multiple s les. At the same time, a gene function can be changed by aberration of the corresponding gene or modification of microRNA (miRNA) expression, which attenuates the gene. In a large number of cancer s les, these two mechanisms might be distributed in a coordinated and almost mutually exclusive manner. Understanding this coordination may assist in identifying changes which significantly produce the same functional impact on cancer phenotype, and further identify genes that are universally required for cancer. Present methodologies for finding aberrations usually analyze single datasets, which cannot identify such pairs of coordinating genes and miRNAs. Results: We have developed MIRAGAA, a statistical approach, to assess the coordinated changes of genome copy numbers and miRNA expression. We have evaluated MIRAGAA on The Cancer Genome Atlas (TCGA) Glioblastoma Multiforme datasets. In these datasets, a number of genome regions coordinating with different miRNAs are identified. Although well known for their biological significance, these genes and miRNAs would be left undetected for being less significant if the two datasets were analyzed in idually. Availability and Implementation: The source code, implemented in R and java, is available from our project web site at www.csse.unimelb.edu.au/∼rgaire/MIRAGAA/index.html Contact: rgaire@csse.unimelb.edu.au Supplementary information: Supplementary data are available at Bioinformatics online.
Searching with Consistent Prioritization for Multi-Agent Path Finding
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Date: 17-07-2019
DOI: 10.1609/AAAI.V33I01.33017643
Abstract: We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed total priority ordering of all agents a priori. We instead explore the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework. In a variety of empirical comparisons, we demonstrate state-of-the-art solution qualities and success rates, often with similar runtimes to existing algorithms. We also develop new theoretical results that explore the limitations of prioritized planning, in terms of completeness and optimality, for the first time.
HM(X) type inference is CLP(X) solving
Publisher: Cambridge University Press (CUP)
Date: 13-09-2007
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2019
Abstract: We study the predict+optimise problem, where machine learning and combinatorial optimisation must interact to achieve a common goal. These problems are important when optimisation needs to be performed on input parameters that are not fully observed but must instead be estimated using machine learning. Our contributions are two-fold: 1) we provide theoretical insight into the properties and computational complexity of predict+optimise problems in general, and 2) develop a novel framework that, in contrast to related work, guarantees to compute the optimal parameters for a linear learning function given any ranking optimisation problem. We illustrate the applicability of our framework for the particular case of the unit-weighted knapsack predict+optimise problem and evaluate on benchmarks from the literature.
Toward Computing the Margin of Victory in Single Transferable Vote Elections
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 10-2019
Abstract: The single transferable vote (STV) is a system of preferential voting for multiseat elections. Each ballot cast by a voter is a (potentially partial) ranking over a set of candidates. No techniques currently exist for computing the margin of victory (MOV) in STV elections. The MOV is the smallest number of ballot manipulations (changes, additions, and deletions) required to bring about a change in the set of elected candidates. Knowing the MOV gives insight into how much time and money should be spent on auditing the election, and whether uncovered mistakes (such as ballot box losses) throw the election result into doubt—requiring a costly repeat election—or can be safely ignored. We present algorithms for computing lower and upper bounds on the MOV in STV elections. In small instances, these algorithms are able to compute exact margins.
A Stochastic Non-CNF SAT Solver
Publisher: Springer Berlin Heidelberg
Date: 2006
From High-Level Model to Branch-and-Price Solution in G12
Publisher: Springer Berlin Heidelberg
Date: 2008
Auditing Hamiltonian Elections
Publisher: Springer Berlin Heidelberg
Date: 2021
MDD propagators with explanation
Publisher: Springer Science and Business Media LLC
Date: 02-08-2011
A complete refinement procedure for regular separability of context-free languages
Publisher: Elsevier BV
Date: 04-2016
How precise are reported protein coordinate data?
Publisher: International Union of Crystallography (IUCr)
Date: 27-02-2014
DOI: 10.1107/S1399004713031787
Abstract: Atomic coordinates in the Worldwide Protein Data Bank (wwPDB) are generally reported to greater precision than the experimental structure determinations have actually achieved. By using information theory and data compression to study the compressibility of protein atomic coordinates, it is possible to quantify the amount of randomness in the coordinate data and thereby to determine the realistic precision of the reported coordinates. On average, the value of each C α coordinate in a set of selected protein structures solved at a variety of resolutions is good to about 0.1 Å.
New integer linear programming approaches for course timetabling
Publisher: Elsevier BV
Date: 07-2008
Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
Publisher: Springer Berlin Heidelberg
Date: 2011
Philosophy of the MiniZinc challenge
Publisher: Springer Science and Business Media LLC
Date: 09-05-2010
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Date: 17-07-2019
DOI: 10.1609/AAAI.V33I01.33016087
Abstract: We describe a new way of reasoning about symmetric collisions for Multi-Agent Path Finding (MAPF) on 4-neighbor grids. We also introduce a symmetry-breaking constraint to resolve these conflicts. This specialized technique allows us to identify and eliminate, in a single step, all permutations of two currently assigned but incompatible paths. Each such permutation has exactly the same cost as a current path, and each one results in a new collision between the same two agents. We show that the addition of symmetry-breaking techniques can lead to an exponential reduction in the size of the search space of CBS, a popular framework for MAPF, and report significant improvements in both runtime and success rate versus CBSH and EPEA* – two recent and state-of-the-art MAPF algorithms.
Context-Sensitive Dynamic Partial Order Reduction
Publisher: Springer International Publishing
Date: 2017
Aggregation and Garbage Collection for Online Optimization
Publisher: Springer International Publishing
Date: 2020
Statistical inference of protein structural alignments using information and compression
Publisher: Oxford University Press (OUP)
Date: 04-01-2017
DOI: 10.1093/BIOINFORMATICS/BTW757
Abstract: Structural molecular biology depends crucially on computational techniques that compare protein three-dimensional structures and generate structural alignments (the assignment of one-to-one correspondences between subsets of amino acids based on atomic coordinates). Despite its importance, the structural alignment problem has not been formulated, much less solved, in a consistent and reliable way. To overcome these difficulties, we present here a statistical framework for the precise inference of structural alignments, built on the Bayesian and information-theoretic principle of Minimum Message Length (MML). The quality of any alignment is measured by its explanatory power—the amount of lossless compression achieved to explain the protein coordinates using that alignment. We have implemented this approach in MMLigner, the first program able to infer statistically significant structural alignments. We also demonstrate the reliability of MMLigner’s alignment results when compared with the state of the art. Importantly, MMLigner can also discover different structural alignments of comparable quality, a challenging problem for oligomers and protein complexes. Source code, binaries and an interactive web version are available at lcb.infotech.monash.edu.au/mmligner. Supplementary data are available at Bioinformatics online.
To Encode or to Propagate? The Best Choice for Each Constraint in SAT
Publisher: Springer Berlin Heidelberg
Date: 2013
Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE
Publisher: Springer Nature Switzerland
Date: 2023
The Argmax Constraint
Publisher: Springer International Publishing
Date: 2020
Multi-objective short-term production scheduling for open-pit mines: a hierarchical decomposition-based algorithm
Publisher: Informa UK Limited
Date: 12-02-2018
Minimizing landscape resistance for habitat conservation
Publisher: Springer International Publishing
Date: 2017
Orthogonal Hyperedge Routing
Publisher: Springer Berlin Heidelberg
Date: 2012
Constraint Logic Programming
Publisher: Elsevier
Date: 2006
Fast optimal and bounded suboptimal Euclidean pathfinding
Publisher: Elsevier BV
Date: 2022
Dominance breaking constraints
Publisher: Springer Science and Business Media LLC
Date: 02-10-2014
Constraints in Non-Boolean Contexts
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2011
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
Publisher: AI Access Foundation
Date: 06-03-2013
DOI: 10.1613/JAIR.3809
Abstract: We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied to simplify the CNF encoding of the constraints. A key factor is that considering only a small fragment of a constraint model at one time enables us to apply stronger, and even complete, reasoning to detect equivalent literals in that fragment. Once detected, equivalences apply to simplify the entire constraint model and facilitate further reasoning on other fragments. Equi-propagation in combination with partial evaluation and constraint simplification provide the foundation for a powerful approach to SAT-based finite domain constraint solving. We introduce a tool called BEE (Ben-Gurion Equi-propagation Encoder) based on these ideas and demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.
Election Manipulation with Partial Information
Publisher: Springer International Publishing
Date: 2019
The G12 Project: Mapping Solver Independent Models to Efficient Solutions
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11562931_3
Constraints for symmetry breaking in graph representation
Publisher: Springer Science and Business Media LLC
Date: 25-08-2018
Revising the diagnosis of personality disorder: Can it be single, clinical and factorial?
Publisher: SAGE Publications
Date: 16-11-2017
Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
Publisher: Elsevier BV
Date: 04-2018
Automatic generation of protein structure cartoons with Pro-origami
Publisher: Oxford University Press (OUP)
Date: 12-2011
DOI: 10.1093/BIOINFORMATICS/BTR575
Abstract: Summary: Protein topology diagrams are 2D representations of protein structure that are particularly useful in understanding and analysing complex protein folds. Generating such diagrams presents a major problem in graph drawing, with automatic approaches often resulting in errors or uninterpretable results. Here we apply a breakthrough in diagram layout to protein topology cartoons, providing clear, accurate, interactive and editable diagrams, which are also an interface to a structural search method. Availability: Pro-origami is available via a web server at munk.csse.unimelb.edu.au ro-origami Contact: a.stivala@pgrad.unimelb.edu.au pjs@csse.unimelb.edu.au
Lightweight Nontermination Inference with CHCs
Publisher: Springer International Publishing
Date: 2021
Related Organisations
Related Funding Activities
Discovery Projects - Grant ID: DP200100025
Start Date: 2020
End Date: 12-2024
Amount: $390,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP110100115
Start Date: 09-2011
End Date: 12-2016
Amount: $600,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP170103174
Start Date: 2017
End Date: 06-2020
Amount: $498,500.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP150100894
Start Date: 02-2015
End Date: 09-2019
Amount: $301,800.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0342703
Start Date: 2003
End Date: 12-2007
Amount: $360,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP140100437
Start Date: 05-2015
End Date: 12-2019
Amount: $405,591.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP110102579
Start Date: 2011
End Date: 12-2015
Amount: $479,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0987168
Start Date: 01-2009
End Date: 12-2013
Amount: $515,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP0449546
Start Date: 05-2004
End Date: 12-2009
Amount: $1,450,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP110200524
Start Date: 06-2012
End Date: 01-2016
Amount: $560,000.00
Funder: Australian Research Council
View Funded ActivityIndustrial Transformation Training Centres - Grant ID: IC200100009
Start Date: 09-2021
End Date: 09-2027
Amount: $4,861,236.00
Funder: Australian Research Council
View Funded ActivityARC Centres Of Excellence - Grant ID: CE0348177
Start Date: 2003
End Date: 12-2007
Amount: $5,625,165.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP140102194
Start Date: 07-2014
End Date: 07-2018
Amount: $385,000.00
Funder: Australian Research Council
View Funded Activity