Peter J. Stuckey

Proceedings of the Principles and Practice of Constraint Programming, 2020

Aggregation and Garbage Collection for Online Optimization.

[BibT_eX]

[DOI]

Alexander Ek

Proceedings of the Principles and Practice of Constraint Programming, 2020

Solving Satisfaction Problems Using Large-Neighbourhood Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Dashed Strings and the Replace(-all) Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

Abstract Interpretation, Symbolic Execution and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Recent Developments in the Design and Implementation of Programming Languages, 2020

Risk-Aware Conditional Replanning for Globally Constrained Multi-Agent Sequential Decision Making.

[BibT_eX]

[DOI]

Frits de Nijs

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Bounded Suboptimal Path Planning with Compressed Path Databases.

[BibT_eX]

[DOI]

Shizhe Zhao

Mattia Chiari

Adi Botea

Alfonso Emilio Gerevini

Daniel Harabor

Alessandro Saetti

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Online Computation of Euclidean Shortest Paths in Two Dimensions.

[BibT_eX]

[DOI]

Muhammad Aamir Cheema

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Explaining Propagators for String Edit Distance Constraints.

[BibT_eX]

[DOI]

Felix Winter

Nysret Musliu

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Modelling Diversity of Solutions.

[BibT_eX]

[DOI]

Linnea Ingmar

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Modelling and Solving Online Optimisation Problems.

[BibT_eX]

[DOI]

Alexander Ek

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Dynamic Programming for Predict+Optimise.

[BibT_eX]

[DOI]

Jeffrey Chan

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Teaching Constraint Programming Using Fable-Based Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Did That Lost Ballot Box Cost Me a Seat? Computing Manipulations of STV Elections.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation.

[BibT_eX]

[DOI]

Wenxi Wang

J. Autom. Reason., 2019

Toward Computing the Margin of Victory in Single Transferable Vote Elections.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2019

Risk-Limiting Audits for IRV Elections.

[BibT_eX]

[DOI]

Vanessa Teague

CoRR, 2019

Compiling CP subproblems to MDDs and d-DNNFs.

[BibT_eX]

[DOI]

Constraints An Int. J., 2019

Constraints for symmetry breaking in graph representation.

[BibT_eX]

[DOI]

Constraints An Int. J., 2019

Election Manipulation with Partial Information.

[BibT_eX]

[DOI]

Proceedings of the Electronic Voting - 4th International Joint Conference, 2019

Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Optimal context-sensitive dynamic partial order reduction with observers.

[BibT_eX]

[DOI]

Elvira Albert

Miguel Gómez-Zamalloa

Miguel Isabel

Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2019

Branch-and-Cut-and-Price for Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Regarding Jump Point Search and Subgoal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions.

[BibT_eX]

[DOI]

Tias Guns

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Path Planning with CPD Heuristics.

[BibT_eX]

[DOI]

Massimo Bono

Alfonso Emilio Gerevini

Daniel Damir Harabor

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Election Manipulation 100.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2019

Time Table Edge Finding with Energy Variables.

[BibT_eX]

[DOI]

Moli Yang

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

An Investigation into Prediction + Optimisation for the Knapsack Problem.

[BibT_eX]

[DOI]

Tias Guns

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Local Rapid Learning for Integer Programs.

[BibT_eX]

[DOI]

Timo Berthold

Jakob Witzig

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Core-Boosted Linear Search for Incomplete MaxSAT.

[BibT_eX]

[DOI]

Jeremias Berg

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Constraint Programming for Dynamic Symbolic Execution of JavaScript.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Compiling Conditional Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Exploring Declarative Local-Search Neighbourhoods with Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Peak-Hour Rail Demand Shifting with Discrete Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Optimal Bounds for Floating-Point Addition in Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

Dissecting Widening: Separating Termination from Information.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation.

[BibT_eX]

[DOI]

Daniel Harabor

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols.

[BibT_eX]

[DOI]

Mattia Chiari

Shizhe Zhao

Adi Botea

Alfonso Emilio Gerevini

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Searching with Consistent Prioritization for Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

An iterative approach to precondition inference using constrained Horn clauses.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2018

Reference Abstract Domains and Applications to String Analysis.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Solution Dominance over Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Tias Guns

CoRR, 2018

Precondition Inference via Partitioning of Initial States.

[BibT_eX]

[DOI]

CoRR, 2018

Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018).

[BibT_eX]

[DOI]

Fred Mesnard

CoRR, 2018

Ballot-Polling Risk Limiting Audits for IRV Elections.

[BibT_eX]

[DOI]

Proceedings of the Electronic Voting - Third International Joint Conference, 2018

Computing the Margin of Victory in Preferential Parliamentary Elections.

[BibT_eX]

[DOI]

Proceedings of the Electronic Voting - Third International Joint Conference, 2018

Forward Search in Contraction Hierarchies.

[BibT_eX]

[DOI]

Daniel Damir Harabor

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Image Constrained Blockmodelling: A Constraint Programming Approach.

[BibT_eX]

[DOI]

Ian Davidson

Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Data instance generator and optimization models for evacuation planning in the event of wildfire.

[BibT_eX]

[DOI]

Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, 2018

Semi-supervised Blockmodelling with Pairwise Guidance.

[BibT_eX]

[DOI]

Laurence A. F. Park

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Machine Learning and Constraint Programming for Relational-To-Ontology Schema Mapping.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Declarative Local-Search Neighbourhoods in MiniZinc.

[BibT_eX]

[DOI]

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Breaking Symmetries with Lex Implications.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

Solver Independent Rotating Workforce Scheduling.

[BibT_eX]

[DOI]

Nysret Musliu

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Constraint Programming for High School Timetabling: A Scheduling-Based Model with Hot Starts.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Propagating lex, find and replace with Dashed Strings.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Sequential Precede Chain for Value Symmetry Elimination.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

Solver-Independent Large Neighbourhood Search.

[BibT_eX]

[DOI]

Jip J. Dekker

Proceedings of the Principles and Practice of Constraint Programming, 2018

Propagating Regular Membership with Dashed Strings.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2018

Optimal Sankey Diagrams Via Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the IEEE Pacific Visualization Symposium, 2018

Lagrangian Constrained Community Detection.

[BibT_eX]

[DOI]

Mohadeseh Ganji

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Sweep-Based Propagation for String Constraint Solving.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Towards Computing Victory Margins in STV Elections.

[BibT_eX]

[DOI]

CoRR, 2017

Using constraint programming for solving RCPSP/max-cal.

[BibT_eX]

[DOI]

Stefan Kreter

Constraints An Int. J., 2017

Statistical inference of protein structural alignments using information and compression.

[BibT_eX]

[DOI]

Bioinform., 2017

Combining String Abstract Domains for JavaScript Analysis: An Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Statistical Compression of Protein Folding Patterns for Inference of Recurrent Substructural Themes.

[BibT_eX]

[DOI]

Ramanan Subramanian

Lloyd Allison

David Abramson

Arthur M. Lesk

Proceedings of the 2017 Data Compression Conference, 2017

Minimizing Landscape Resistance for Habitat Conservation.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

Range-Consistent Forbidden Regions of Allen's Relations.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

A Declarative Approach to Constrained Community Detection.

[BibT_eX]

[DOI]

Mohadeseh Ganji

Proceedings of the Principles and Practice of Constraint Programming, 2017

A Novel Approach to String Constraint Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

Context-Sensitive Dynamic Partial Order Reduction.

[BibT_eX]

[DOI]

Elvira Albert

Puri Arenas

Miguel Gómez-Zamalloa

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Fixing the State Budget: Approximation of Regular Languages with Small DFAs.

[BibT_eX]

[DOI]

Pierre Ganty

Proceedings of the Automated Technology for Verification and Analysis, 2017

Automatic Logic-Based Benders Decomposition with MiniZinc.

[BibT_eX]

[DOI]

Toby O. Davies

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

A complete refinement procedure for regular separability of context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A Decomposition-Based Algorithm for the Scheduling of Open-Pit Networks Over Multiple Time Periods.

[BibT_eX]

[DOI]

Adrian R. Pearce

Manag. Sci., 2016

An Abstract Domain of Uninterpreted Functions.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Lagrangian Constrained Clustering.

[BibT_eX]

[DOI]

Mohadeseh Ganji

Proceedings of the 2016 SIAM International Conference on Data Mining, 2016

Exploiting Sparsity in Difference-Bound Matrices.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 23rd International Symposium, 2016

MiniZinc with Strings.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

Sequencing Operator Counts.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Constraint Propagation and Explanation over Novel Types by Abstract Compilation.

[BibT_eX]

[DOI]

Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming, 2016

Efficient Computation of Exact IRV Margins.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Bit-Vector Solver with Word-Level Propagation.

[BibT_eX]

[DOI]

Wenxi Wang

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Weighted Spanning Tree Constraint with Explanations.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Rail Capacity Modelling with Constraint Programming.

[BibT_eX]

[DOI]

Daniel Harabor

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Parallelizing Constraint Programming with Learning.

[BibT_eX]

[DOI]

Thorsten Ehlers

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Lagrangian Decomposition via Sub-problem Search.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

On CNF Encodings of Decision Diagrams.

[BibT_eX]

[DOI]

Valentin Mayer-Eichberger

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

A Bounded Path Propagator on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Explaining Producer/Consumer Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Interval Constraints with Learning: Application to Air Traffic Control.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Breaking Symmetries in Graphs: The Nauty Way.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Improved Linearization of Constraint Programming Models.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Discrete Optimization for Agents.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Symmetry declarations for MiniZinc.

[BibT_eX]

[DOI]

Nathaniel Baxter

Proceedings of the Australasian Computer Science Week Multiconference, 2016

Steiner Tree Problems with Side Constraints Using Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Horn clauses as an intermediate representation for program analysis and transformation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2015

Two type extensions for the constraint modeling language MiniZinc.

[BibT_eX]

[DOI]

Rafael Caballero

Antonio Tenorio-Fornes

Sci. Comput. Program., 2015

Lazy Model Expansion: Interleaving Grounding with Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Automatic Minimal-Height Table Layout.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2015

Unsatisfiable Cores and Lower Bounding for Constraint Programming.

[BibT_eX]

[DOI]

CoRR, 2015

Projected Model Counting.

[BibT_eX]

[DOI]

CoRR, 2015

Dominance breaking constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2015

#∃SAT: Projected Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Generalized Modularity for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

A Tool for Intersecting Context-Free Grammars and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Learning Value Heuristics for Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

Scheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: A Mine Planning Case Study.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

MiniSearch: A Solver-Independent Meta-Search Language for MiniZinc.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2015

Modeling and Solving Project Scheduling with Calendars.

[BibT_eX]

[DOI]

Stefan Kreter

Proceedings of the Principles and Practice of Constraint Programming, 2015

Encoding Linear Constraints with Implication Chains to CNF.

[BibT_eX]

[DOI]

Valentin Mayer-Eichberger

Proceedings of the Principles and Practice of Constraint Programming, 2015

Optimisation and Relaxation for Multiagent Planning in the Situation Calculus.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Stable Model Counting and Its Application in Probabilistic Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2014

Synthesizing Optimal Switching Lattices.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2014

A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

A Partial-Order Approach to Array Content Analysis.

[BibT_eX]

[DOI]

CoRR, 2014

Grounding Bound Founded Answer Set Programs.

[BibT_eX]

[DOI]

Rehan Abdul Aziz

Peter James Stuckey

CoRR, 2014

Explaining circuit propagation.

[BibT_eX]

[DOI]

Kathryn Glenn Francis

Constraints An Int. J., 2014

Symmetries, almost symmetries, and lazy clause generation.

[BibT_eX]

[DOI]

Christopher Mears

Constraints An Int. J., 2014

The future of optimization technology.

[BibT_eX]

[DOI]

Pascal Van Hentenryck

Mark Wallace

Constraints An Int. J., 2014

The MiniZinc Challenge 2008-2013.

[BibT_eX]

[DOI]

AI Mag., 2014

Analyzing Array Manipulating Programs by Program Transformation.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Seeing Around Corners: Fast Orthogonal Connector Routing.

[BibT_eX]

[DOI]

Proceedings of the Diagrammatic Representation and Inference, 2014

Modelling with Option Types in MiniZinc.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Local Search for a Cargo Assembly Planning Problem.

[BibT_eX]

[DOI]

Gleb Belov

Natashia Boland

Martin W. P. Savelsbergh

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Stochastic MiniZinc.

[BibT_eX]

[DOI]

Andrea Rendl

Proceedings of the Principles and Practice of Constraint Programming, 2014

Loop Untangling.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Nested Constraint Programs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Encoding Linear Constraints into SAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Planning for Mining Operations with Time and Resource Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Fragment-Based Planning Using Column Generation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013

Failure tabled constraint logic programming by interpolation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2013

Stable model semantics for founded bounds.

[BibT_eX]

[DOI]

Rehan Abdul Aziz

Theory Pract. Log. Program., 2013

A CLP heap solver for test case generation.

[BibT_eX]

[DOI]

Elvira Albert

Miguel Gómez-Zamalloa

José Miguel Rojas

Theory Pract. Log. Program., 2013

Solving RCPSP/max by lazy clause generation.

[BibT_eX]

[DOI]

J. Sched., 2013

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems.

[BibT_eX]

[DOI]

Amit Metodi

J. Artif. Intell. Res., 2013

Unsatisfiable Cores for Constraint Programming

[BibT_eX]

[DOI]

CoRR, 2013

Structure Based Extended Resolution for Constraint Programming.

[BibT_eX]

[DOI]

CoRR, 2013

Search combinators.

[BibT_eX]

[DOI]

Constraints An Int. J., 2013

Discovery and analysis of consistent active sub-networks in cancers.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

Unbounded Model-Checking with Interpolation for Regular Language Constraints.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

There Are No CNF Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Abstract Interpretation over Non-lattice Abstract Domains.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 20th International Symposium, 2013

Finite type extensions in constraint programming.

[BibT_eX]

[DOI]

Rafael Caballero

Antonio Tenorio-Fornes

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Breaking Symmetries in Graph Representation.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Statistical Inference of Protein "LEGO Bricks".

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

MiniZinc with Functions.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects.

[BibT_eX]

[DOI]

Hanyu Gu

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Those Who Cannot Remember the Past Are Condemned to Repeat It.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

Scheduling Optional Tasks with Explanation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

Explaining Propagators for Edge-Valued Decision Diagrams.

[BibT_eX]

[DOI]

Pascal Van Hentenryck

Proceedings of the Principles and Practice of Constraint Programming, 2013

Modelling Destructive Assignments.

[BibT_eX]

[DOI]

Jorge A. Navas

Proceedings of the Principles and Practice of Constraint Programming, 2013

Dominance Driven Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

To Encode or to Propagate? The Best Choice for Each Constraint in SAT.

[BibT_eX]

[DOI]

Enric Rodríguez-Carbonell

Robert Nieuwenhuis

Albert Oliveras

Proceedings of the Principles and Practice of Constraint Programming, 2013

Solving Difference Constraints over Modular Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

Automated Design of Search with Composability.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Exploiting subproblem dominance in constraint programming.

[BibT_eX]

[DOI]

Constraints An Int. J., 2012

AI@NICTA.

[BibT_eX]

[DOI]

Nick Barnes

Peter Baumgartner

Tibério S. Caetano

Hugh F. Durrant-Whyte

Pascal Van Hentenryck

Toby Walsh

AI Mag., 2012

A complete solution to the Maximum Density Still Life Problem.

[BibT_eX]

[DOI]

Artif. Intell., 2012

An Introduction to Search Combinators.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

Lazy Model Expansion by Incremental Grounding.

[BibT_eX]

[DOI]

Broes De Cat

Marc Denecker

Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

A General Implementation Framework for Tabled CLP.

[BibT_eX]

[DOI]

Pablo Chico de Guzmán

Manuel Carro

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

Optimal guillotine layout.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Document Engineering, 2012

Orthogonal Hyperedge Routing.

[BibT_eX]

[DOI]

Proceedings of the Diagrammatic Representation and Inference, 2012

Maximising the Net Present Value for Resource-Constrained Project Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Explaining Propagators for s-DNNF Circuits.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Explaining Flow-Based Propagation.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Maximising the Net Present Value of Large Resource-Constrained Projects.

[BibT_eX]

[DOI]

Hanyu Gu

Mark G. Wallace

Proceedings of the Principles and Practice of Constraint Programming, 2012

Optimisation Modelling for Software Developers.

[BibT_eX]

[DOI]

Sebastian Brand

Proceedings of the Principles and Practice of Constraint Programming, 2012

Inter-instance Nogood Learning in Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

A Generic Method for Identifying and Exploiting Dominance Relations.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Conflict Directed Lazy Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

Explaining alldifferent.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth Australasian Computer Science Conference, 2012

2011

Solving Talent Scheduling with Dynamic Programming.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

Explaining the cumulative propagator.

[BibT_eX]

[DOI]

Constraints An Int. J., 2011

Dantzig-Wolfe decomposition and branch-and-price solving in G12.

[BibT_eX]

[DOI]

Constraints An Int. J., 2011

MDD propagators with explanation.

[BibT_eX]

[DOI]

Radoslaw Szymanek

Constraints An Int. J., 2011

CP and IP approaches to cancer radiotherapy delivery optimization.

[BibT_eX]

[DOI]

Constraints An Int. J., 2011

Automatic generation of protein structure cartoons with Pro-origami.

[BibT_eX]

[DOI]

Bioinform., 2011

Piecewise linear approximation of protein structures using the principle of minimum message length.

[BibT_eX]

[DOI]

Lloyd Allison

Arthur M. Lesk

Bioinform., 2011

Memoizing a Monadic Mixin DSL.

[BibT_eX]

[DOI]

Proceedings of the Functional and Constraint Logic Programming, 2011

Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Symmetries and Lazy Clause Generation.

[BibT_eX]

[DOI]

Christopher Mears

Proceedings of the IJCAI 2011, 2011

Constraints in Non-Boolean Contexts.

[BibT_eX]

[DOI]

Sebastian Brand

Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

Optimal automatic table layout.

[BibT_eX]

[DOI]

Proceedings of the 2011 ACM Symposium on Document Engineering, 2011

Optimal Carpet Cutting.

[BibT_eX]

[DOI]

Andrew R. Verden

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Boolean Equi-propagation for Optimized SAT Encoding.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Half Reification and Flattening.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Lock-free parallel dynamic programming.

[BibT_eX]

[DOI]

Alex D. Stivala

J. Parallel Distributed Comput., 2010

Fast Set Bounds Propagation Using a BDD-SAT Hybrid.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2010

Incremental Satisfiability and Implication for UTVPI Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation

[BibT_eX]

[DOI]

CoRR, 2010

Philosophy of the MiniZinc challenge.

[BibT_eX]

[DOI]

Ralph Becket

Julien Fischer

Constraints An Int. J., 2010

Introduction to the special issue on the Fourteenth International Conference on Principles and Practice of Constraint Programming (CP 2008).

[BibT_eX]

[DOI]

Constraints An Int. J., 2010

Fast and accurate protein substructure searching with simulated annealing and GPUs.

[BibT_eX]

[DOI]

Alex D. Stivala

BMC Bioinform., 2010

MIRAGAA - a methodology for finding coordinated effects of microRNA expression changes and genome aberrations in cancer.

[BibT_eX]

[DOI]

Bioinform., 2010

Optimal k-Level Planarization and Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Automatically Exploiting Subproblem Equivalence in Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Rapid Learning for Binary Programs.

[BibT_eX]

[DOI]

Timo Berthold

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Improved consensus clustering via linear programming.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2010, 2010

2009

Erratum to "Efficient constraint propagation engines".

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2009

Cache Conscious Data Structures for Boolean Satisfiability Solvers.

[BibT_eX]

[DOI]

Aaron Harwood

J. Satisf. Boolean Model. Comput., 2009

Monadic constraint programming.

[BibT_eX]

[DOI]

Philip Wadler

J. Funct. Program., 2009

Propagation via lazy clause generation.

[BibT_eX]

[DOI]

Olga Ohrimenko

Constraints An Int. J., 2009

Propagating systems of dense linear integer constraints.

[BibT_eX]

[DOI]

Constraints An Int. J., 2009

Tableau-based protein substructure search using quadratic programming.

[BibT_eX]

[DOI]

Alex D. Stivala

BMC Bioinform., 2009

A declarative encoding of telecommunications feature subscription in SAT.

[BibT_eX]

[DOI]

Samir Genaim

Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Demand-Driven Normalisation for ACD Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 25th International Conference, 2009

Orthogonal Connector Routing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Branch-and-Price Solving in G12.

[BibT_eX]

[DOI]

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

Why Cumulative Decomposition Is Not as Bad as It Sounds.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Maintaining State in Propagation Solvers.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

The Proper Treatment of Undefinedness in Constraint Languages.

[BibT_eX]

[DOI]

Alan M. Frisch

Proceedings of the Principles and Practice of Constraint Programming, 2009

Lazy Clause Generation Reengineered.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Confidence-Based Work Stealing in Parallel Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Using Relaxations in Maximum Density Still Life.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

Minimizing the Maximum Number of Open Stacks by Customer Search.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Exploration of Networks using overview+detail with Constraint-based cooperative layout.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 2008

Constraint Logic Programming using ECLiPSe Krzysztof Apt and Mark Wallace, Cambridge University Press, 2007 Hardback, ISBN 9780521866286, 348 pages.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2008

Logic programming with satisfiability.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2008

Efficient constraint propagation engines.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2008

Comparing usability of one-way and multi-way constraints for diagram editing.

[BibT_eX]

[DOI]

ACM Trans. Comput. Hum. Interact., 2008

Solving Partial Order Constraints for LPO Termination.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2008

HM(X) type inference is CLP(X) solving.

[BibT_eX]

[DOI]

J. Funct. Program., 2008

New integer linear programming approaches for course timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

The Design of the Zinc Modelling Language.

[BibT_eX]

[DOI]

Mark Wallace

Constraints An Int. J., 2008

Structural search and retrieval using a tableau representation of protein folding patterns.

[BibT_eX]

[DOI]

Arthur M. Lesk

Bioinform., 2008

Dynamic variable elimination during propagation solving.

[BibT_eX]

[DOI]

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

Global difference constraint propagation for finite domain solvers.

[BibT_eX]

[DOI]

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

Automating branch-and-bound for dynamic programs.

[BibT_eX]

[DOI]

Jakob Puchinger

Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Flexible, Rule-Based Constraint Model Linearisation.

[BibT_eX]

[DOI]

Proceedings of the Practical Aspects of Declarative Languages, 2008

Dynamic Analysis of Bounds Versus Domain Propagation.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

Cadmium: An Implementation of ACD Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

Telecommunications Feature Subscription as a Partial Order Constraint Problem.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

Optimizing Compilation of CHR with Rule Priorities.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Fast Set Bounds Propagation using BDDs.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2008, 2008

Smooth Linear Approximation of Non-overlap Constraints.

[BibT_eX]

[DOI]

Proceedings of the Diagrammatic Representation and Inference, 5th International Conference, 2008

From High-Level Model to Branch-and-Price Solution in G12.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Modelling for Lazy Clause Generation.

[BibT_eX]

[DOI]

Olga Ohrimenko

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

The Core Concept for 0/1 Integer Programming.

[BibT_eX]

[DOI]

Samuel J. Huston

Jakob Puchinger

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

Removing propagation redundant constraints in redundant modeling.

[BibT_eX]

[DOI]

Chiu Wo Choi

ACM Trans. Comput. Log., 2007

Understanding functional dependencies via constraint handling rules.

[BibT_eX]

[DOI]

Simon L. Peyton Jones

J. Funct. Program., 2007

Dynamic Programming to Minimize the Maximum Number of Open Stacks.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

The island confinement method for reducing search space in local search methods.

[BibT_eX]

[DOI]

J. Heuristics, 2007

Constraint propagation for loose constraint graphs.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

Propagating dense systems of integer linear equations.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

Observable Confluence for Constraint Handling Rules.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 23rd International Conference, 2007

Practical Preference Relations for Large Data Sets.

[BibT_eX]

[DOI]

Kenneth A. Ross

Amélie Marian

Proceedings of the 23rd International Conference on Data Engineering Workshops, 2007

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Propagation = Lazy Clause Generation.

[BibT_eX]

[DOI]

Olga Ohrimenko

Proceedings of the Principles and Practice of Constraint Programming, 2007

MiniZinc: Towards a Standard CP Modelling Language.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

Encodings of the Sequence Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

2006

Constraint Logic Programming.

[BibT_eX]

[DOI]

Mark Wallace

Proceedings of the Handbook of Constraint Programming, 2006

Improving PARMA trailing.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2006

Optimal Sum-of-Pairs Multiple Sequence Alignment Using Incremental Carrillo and Lipman Bounds.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Islands for SAT

[BibT_eX]

[DOI]

CoRR, 2006

A Stochastic Non-CNF SAT Solver.

[BibT_eX]

[DOI]

Rafiq Muhammad

Proceedings of the PRICAI 2006: Trends in Artificial Intelligence, 2006

A Hybrid BDD and SAT Finite Domain Constraint Solver.

[BibT_eX]

[DOI]

Peter Hawkins

Proceedings of the Practical Aspects of Declarative Languages, 8th International Symposium, 2006

Adding Constraint Solving to Mercury.

[BibT_eX]

[DOI]

Ralph Becket

Proceedings of the Practical Aspects of Declarative Languages, 8th International Symposium, 2006

Realizing the e-science desktop peer using a peer-to-peer distributed virtual machine middleware.

[BibT_eX]

[DOI]

Lei Ni

Aaron Harwood

Proceedings of the 4th international workshop on Middleware for grid computing, 2006

ACD Term Rewriting.

[BibT_eX]

[DOI]

Sebastian Brand

Proceedings of the Logic Programming, 22nd International Conference, 2006

Fast Node Overlap Removal - Correction.

[BibT_eX]

[DOI]

Tim Dwyer

Proceedings of the Graph Drawing, 14th International Symposium, 2006

A Framework for Extended Algebraic Data Types.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

Size-Change Termination Analysis in k-Bits.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2006

Finite Domain Bounds Consistency Revisited.

[BibT_eX]

[DOI]

Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

Principal Type Inference for GHC-Style Multi-parameter Type Classes.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

Type Processing by Constraint Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

2005

Optimizing compilation of constraint handling rules in HAL.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2005

Checking modes of HAL programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2005

A theory of overloading.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2005

When do bounds and domain propagation lead to the same search space?

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2005

Solving Set Constraint Satisfaction Problems using ROBDDs.

[BibT_eX]

[DOI]

Peter Hawkins

J. Artif. Intell. Res., 2005

Automatic Implication Checking for CHR Constraints.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Rule-Based Programming, 2005

Type Inference for Guarded Recursive Data Types

[BibT_eX]

[DOI]

CoRR, 2005

Improved Inference for Checking Annotations

[BibT_eX]

[DOI]

CoRR, 2005

Abstract interpretation for constraint handling rules.

[BibT_eX]

[DOI]

Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization.

[BibT_eX]

[DOI]

Proceedings of the Practical Aspects of Declarative Languages, 7th International Symposium, 2005

The G12 Project: Mapping Solver Independent Models to Efficient Solutions.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 21st International Conference, 2005

Testing for Termination with Monotonicity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 21st International Conference, 2005

Incremental Connector Routing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Fast Node Overlap Removal.

[BibT_eX]

[DOI]

Tim Dwyer

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Structuring Documents Efficiently.

[BibT_eX]

[DOI]

Robert Marshall

Steven Bird

Proceedings of the Australasian Language Technology Workshop, 2005

2004

NP-Completeness of Minimal Width Unordered Tree Layout.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

Progressive Multiple Alignment Using Sequence Triplet Optimizations and Three-residue Exchange Costs.

[BibT_eX]

[DOI]

James C. Whisstock

J. Bioinform. Comput. Biol., 2004

Just enough tabling.

[BibT_eX]

[DOI]

Konstantinos Sagonas

Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

A Generic Framework for Context-Sensitive Analysis of Modular Programs.

[BibT_eX]

[DOI]

Jesús Correas

Francisco Bueno

Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Herbrand Constraints in HAL.

[BibT_eX]

[DOI]

Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

The Refined Operational Semantics of Constraint Handling Rules.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 20th International Conference, 2004

Compiling Ask Constraints.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 20th International Conference, 2004

Improving type error diagnosis.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Workshop on Haskell, 2004

Sound and Decidable Type Inference for Functional Dependencies.

[BibT_eX]

[DOI]

Simon L. Peyton Jones

Proceedings of the Programming Languages and Systems, 2004

Speeding Up Constraint Propagation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

Set Domain Propagation Using ROBDDs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

Set Bounds and (Split) Set Domain Propagation Using ROBDDs.

[BibT_eX]

[DOI]

Peter Hawkins

Proceedings of the AI 2004: Advances in Artificial Intelligence, 2004

Towards Flexible Graphical Communication Using Adaptive Diagrams.

[BibT_eX]

[DOI]

Bernd Meyer

Proceedings of the Advances in Computer Science, 2004

2003

Flexible access control policy specification with constraint logic programming.

[BibT_eX]

[DOI]

Steve Barker

ACM Trans. Inf. Syst. Secur., 2003

The Chameleon Type Debugger (Tool Demonstration)

[BibT_eX]

[DOI]

CoRR, 2003

Removing Node Overlapping in Graph Layout Using Constrained Optimization.

[BibT_eX]

[DOI]

Constraints An Int. J., 2003

Improving Linear Constraint Propagation by Changing Constraint Representation.

[BibT_eX]

[DOI]

Constraints An Int. J., 2003

Extending arbitrary solvers with constraint handling rules.

[BibT_eX]

[DOI]

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Finding all minimal unsatisfiable subsets.

[BibT_eX]

[DOI]

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Propagation Redundancy for Permutation Channels.

[BibT_eX]

[DOI]

Chiu Wo Choi

Proceedings of the IJCAI-03, 2003

Efficient Representation of Adhoc Constraints.

[BibT_eX]

[DOI]

Kenil C. K. Cheng

Proceedings of the IJCAI-03, 2003

Improving Nogood Recording Using 2SAT.

[BibT_eX]

[DOI]

Lei Zheng

Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

Termination Analysis with Types Is More Accurate.

[BibT_eX]

[DOI]

Frédéric Mesnard

Proceedings of the Logic Programming, 19th International Conference, 2003

Interactive type debugging in Haskell.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Workshop on Haskell, 2003

Propagation Redundancy in Redundant Modelling.

[BibT_eX]

[DOI]

Chiu Wo Choi

Proceedings of the Principles and Practice of Constraint Programming, 2003

Box Constraint Collections for Adhoc Constraints.

[BibT_eX]

[DOI]

Chi Kan Cheng

Proceedings of the Principles and Practice of Constraint Programming, 2003

Resource Usage Verification.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, First Asian Symposium, 2003

2002

Flexible Graph Layout for the Web.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 2002

Efficient Intelligent Backtracking Using Linear Programming.

[BibT_eX]

[DOI]

Bruce Davey

Natashia Boland

INFORMS J. Comput., 2002

Fourier Elimination for Compiling Constraint Hierarchies.

[BibT_eX]

[DOI]

Alan Borning

Constraints An Int. J., 2002

Using the heap to eliminate stack accesses.

[BibT_eX]

[DOI]

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Constraint-based mode analysis of mercury.

[BibT_eX]

[DOI]

David Overton

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Precise pair-sharing analysis of logic programs.

[BibT_eX]

[DOI]

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

A Hybrid Algorithm for the Examination Timetabling Problem.

[BibT_eX]

[DOI]

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

Exception analysis for non-strict languages.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

To the Gates of HAL: A HAL Tutorial.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

Improving GSAT Using 2SAT.

[BibT_eX]

[DOI]

Lei Zheng

Proceedings of the Principles and Practice of Constraint Programming, 2002

Compacting Discriminator Information for Spatial Trees.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2002, 2002

Improving SAT Using 2SAT.

[BibT_eX]

[DOI]

Lei Zheng

Proceedings of the Computer Science 2002, 2002

Reducing Search Space in Local Search for Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

The Cassowary linear arithmetic constraint solving algorithm.

[BibT_eX]

[DOI]

Greg J. Badros

Alan Borning

ACM Trans. Comput. Hum. Interact., 2001

Cost-based Unbalanced R-Trees.

[BibT_eX]

[DOI]

Kenneth A. Ross

Proceedings of the 13th International Conference on Scientific and Statistical Database Management, 2001

Effective Strictness Analysis with HORN Constraints.

[BibT_eX]

[DOI]

Kevin Glynn

Proceedings of the Static Analysis, 8th International Symposium, 2001

Boolean Constraints for Binding-Time Analysis.

[BibT_eX]

[DOI]

Proceedings of the Programs as Data Objects, Second Symposium, 2001

Optimizing Compilation of Constraint Handling Rules.

[BibT_eX]

[DOI]

David Jeffery

Proceedings of the Logic Programming, 17th International Conference, 2001

Higher-Precision Groundness Analysis.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 17th International Conference, 2001

Building Constraint Solvers with HAL.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 17th International Conference, 2001

A Framework for Analysis of Typed Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

Solving Disjunctive Constraints for Interactive Graphical Applications.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Incremental analysis of constraint logic programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2000

Type Classes and Constraint Handling Rules

[BibT_eX]

[DOI]

Kevin Glynn

CoRR, 2000

A Lagrangian reconstruction of GENET.

[BibT_eX]

[DOI]

Kenneth M. F. Choi

Artif. Intell., 2000

A Model for Inter-module Analysis and Optimizing Compilation.

[BibT_eX]

[DOI]

Francisco Bueno

Proceedings of the Logic Based Program Synthesis and Transformation, 2000

Improving Temporal Joins Using Histograms.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 11th International Conference, 2000

Model Checking in HAL.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2000

O-Trees: A Constraint-Based Index Structure.

[BibT_eX]

[DOI]

Proceedings of the Australasian Database Conference, 2000

1999

Sharing and groundness dependencies in logic programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1999

Book reviews.

[BibT_eX]

[DOI]

Intell., 1999

Improving Evolutionary Algorithms for Efficient Constraint Satisfaction.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 1999

Constraint Cascading Style Sheets for the Web.

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on User Interface Software and Technology, 1999

Herbrand Constraint Solving in HAL.

[BibT_eX]

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

An Overview of HAL.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1999

1998

Extending GENET with lazy arc consistency.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Part A, 1998

Optimizing Compilation of CLP(R).

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1998

Foundations of Aggregation Constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Practical Object-Oriented Analysis Engine for CLP.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1998

The Semantics of Constraint Logic Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1998

Differential Methods in Logic Program Analysis.

[BibT_eX]

[DOI]

J. Log. Program., 1998

Semantics for using Stochastic Constraint Solvers in Constraint Logic Programming.

[BibT_eX]

[DOI]

J. Funct. Log. Program., 1998

A Lagrangian reconstruction of a class of local search methods.

[BibT_eX]

[DOI]

Kenneth M. F. Choi

Proceedings of the Tenth IEEE International Conference on Tools with Artificial Intelligence, 1998

Constraint Representation for Propagation.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1998

1997

An Efficient Evaluation Technique for Non-Stratified Programs by Transformation to Explicitly Locally Stratified Programs.

[BibT_eX]

[DOI]

J. Syst. Integr., 1997

Well-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models.

[BibT_eX]

[DOI]

S. Sudarshan

J. Log. Program., 1997

Meta-Programming in CLP(R).

[BibT_eX]

[DOI]

J. Log. Program., 1997

Introduction to the Special Issue on Constraints and Databases.

[BibT_eX]

[DOI]

Raghu Ramakrishnan

Constraints An Int. J., 1997

Solving Linear Arithmetic Constraints for User Interface Applications.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual ACM Symposium on User Interface Software and Technology, 1997

Extending EGENET with Lazy Constraint Consistency.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997

Constraint Search Tree.

[BibT_eX]

Proceedings of the Logic Programming, 1997

Optimization of Logic Programs with Dynamic Scheduling.

[BibT_eX]

Proceedings of the Logic Programming, 1997

Compiling Constraint Solving using Projection.

[BibT_eX]

[DOI]

Alan Borning

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

Optimizing Bottom-Up Evaluation of Constraint Queries.

[BibT_eX]

[DOI]

J. Log. Program., 1996

Cost-Based Optimization for Magic: Algebra and Implementation.

[BibT_eX]

[DOI]

Praveen Seshadri

Joseph M. Hellerstein

Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, Third International Symposium, 1996

Models for Using Stochastic Constraint Solvers in Constraint Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages: Implementations, 1996

Effectiveness of Optimizing Compilation for CLP(R).

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1996

Using Stochastic Methods to Guide Search in CLP: A Preliminary Report.

[BibT_eX]

[DOI]

Proceedings of the Concurrency and Parallelism, 1996

Low-contact learning in a first year programming course.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1995

Negation and Constraint Logic Programming

[BibT_eX]

[DOI]

Inf. Comput., April, 1995

Bottom-Up Evaluation and Query Optimization of Well-Founded Models.

[BibT_eX]

[DOI]

Divesh Srivastava

Theor. Comput. Sci., 1995

On Inductive Inference of Cyclic Structures.

[BibT_eX]

[DOI]

Michael J. Maher

Ann. Math. Artif. Intell., 1995

Efficient Analysis of Logic Programs with Dynamic Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1995

Incremental Analysis of Logic Programs.

[BibT_eX]

Proceedings of the Logic Programming, 1995

Linear Equation Solving for Constraint Logic Programming.

[BibT_eX]

Proceedings of the Logic Programming, 1995

ELS Programs and the Efficient Evaluation of Non-Stratified Programs by Transformation to ELS.

[BibT_eX]

[DOI]

Proceedings of the Deductive and Object-Oriented Databases, 1995

An Optimizing Compiler for CLP(R).

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1995

1994

The Aditi Deductive Database System

[BibT_eX]

[DOI]

VLDB J., 1994

Approximating Interaction between Linear Arithmetic Constraints.

[BibT_eX]

Proceedings of the Logic Programming, 1994

Beyond Finite Domains.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1994

Compiling Query Constraints.

[BibT_eX]

[DOI]

S. Sudarshan

Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

1993

Projecting CLP (R) Constraints.

[BibT_eX]

[DOI]

New Gener. Comput., 1993

Semantics of Constraint Logic Programs with Optimization.

[BibT_eX]

[DOI]

LOPLAS, 1993

Redundancy of Variables in CLP (R).

[BibT_eX]

Andrew D. Macdonald

Roland H. C. Yap

Proceedings of the Logic Programming, 1993

The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Status of the Aditi Deductive Database System.

[BibT_eX]

Proceedings of the Logic Programming, 1993

Analysis Based Constraint Query Optimization.

[BibT_eX]

Proceedings of the Logic Programming, 1993

Well-Founded Ordered Search (Extended Abstract).

[BibT_eX]

[DOI]

S. Sudarshan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

The Aditi Deductive Datebase System.

[BibT_eX]

Proceedings of the Workshop on Programming with Logic Databases. In Conjunction with ILPS, 1993

1992

The CLP(R) Language and System.

[BibT_eX]

ACM Trans. Program. Lang. Syst., 1992

Transforming Normal Logic Programs to Constraint Logic Programs.

[BibT_eX]

[DOI]

Kanchana Kanchanasut

Theor. Comput. Sci., 1992

CLP(R) and Some Electrical Engineering Problems.

[BibT_eX]

[DOI]

Nevin Heintze

Spiro Michaylov

J. Autom. Reason., 1992

An Abstract Machine for CLP(R).

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN'92 Conference on Programming Language Design and Implementation (PLDI), 1992

Query Restricted Bottom-Up Evaluation of Normal Logic Programs.

[BibT_eX]

Divesh Srivastava

Proceedings of the Logic Programming, 1992

Output in CLP.

[BibT_eX]

Proceedings of the International Conference on Fifth Generation Computer Systems. FGCS 1992, 1992

1991

Incremental Linear Constraint Solving and Detection of Implicit Equalities.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1991

An Introduction to Aditi Deductive Database System.

[BibT_eX]

Aust. Comput. J., 1991

Magic Sets and Bottom-Up Evaluation of Well-Founded Models.

[BibT_eX]

Divesh Srivastava

Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Semantics of Logic Programs with Aggregates.

[BibT_eX]

Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

Constructive Negation for Constraint Logic Programming

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Design Overview of the Aditi Deductive Database System.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Data Engineering, 1991

The CLP(R) language and system: an overview.

[BibT_eX]

[DOI]

Proceedings of the Compcon Spring '91, San Francisco, 1991

1990

Meta Programming as Constraint Programming.

[BibT_eX]

Pierre Lim

Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

A Constraint Logic Programming Shell.

[BibT_eX]

[DOI]

Pierre Lim

Proceedings of the Programming Language Implementation and Logic Programming, 1990

Eliminating Negation from Normal Logic Programs.

[BibT_eX]

[DOI]

Kanchana Kanchanasut

Proceedings of the Algebraic and Logic Programming, 1990

1989

Interface Logic Programming.

[BibT_eX]

John N. Crossley

Pierre Lim

Aust. Comput. J., 1989

Expanding Query Power in Constraint Logic Programming Languages.

[BibT_eX]

Michael J. Maher

Proceedings of the Logic Programming, 1989

On Meta-Programming in CLR(R).

[BibT_eX]

Proceedings of the Logic Programming, 1989

1986

Semantics of Infinite Tree Logic Programming.

[BibT_eX]

[DOI]

Joxan Jaffar

Theor. Comput. Sci., 1986

Canonical Logic Programs.

[BibT_eX]

[DOI]

Joxan Jaffar

J. Log. Program., 1986

Logic Program Semantics for Programming with Equations.

[BibT_eX]

[DOI]

Joxan Jaffar