- Dynamic Variable Elimination during Propagation Solving Christian Schulte
- Comparative Usability of One-way and Multi-way Constraints for Diagram Editing
- Hindley/Milner Types Type Classes
- Why cumulative decomposition is not as bad as Andreas Schutt1
- Constraints, , 1?? () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Termination Analysis with Types is More Vitaly Lagoon 1 , Fred Mesnard 2 , and Peter J. Stuckey 1
- Improving Evolutionary Algorithms for Efficient Constraint Satisfaction
- Negation and Constraint Logic Programming Peter J. Stuckey
- Set Domain Propagation Using ROBDDs Vitaly Lagoon and Peter J. Stuckey
- Propagation Redundancy in Redundant Modelling ? C.W. Choi 1 , J.H.M. Lee 1 , and P. J. Stuckey 2
- Abstract Interpretation for Constraint Handling Rules Tom Schrijvers
- The Proper Treatment of Undefinedness in Constraint Languages
- Optimal k-level Planarization and Crossing Minimization
- Under consideration for publication in J. Functional Programming 1 HM(X) Type Inference is CLP(X) Solving
- Constraints, , 1?? () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- An Efficient HeuristicBased Evolutionary Algorithm for Solving Constraint Satisfaction Problems
- Modelling for Lazy Clause Generation Olga Ohrimenko and Peter J. Stuckey
- Observable Confluence for Constraint Handling Gregory J. Duck1
- Journal on Satisfiability, Boolean Modeling and Computation 5 (2008) 193215 Solving Partial Order Constraints for LPO Termination
- A Stochastic Non-CNF SAT Solver Rafiq Muhammad and Peter J. Stuckey
- J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 THE SEMANTICS OF CONSTRAINT LOGIC
- Flexible, Rule-based Constraint Model Linearisation
- Testing for Termination with Monotonicity Constraints
- Lazy clause generation reengineered Thibaut Feydy and Peter J. Stuckey
- ELIMINATING NEGATION FROM NORMAL LOGIC PROGRAMS
- Cost-based Unbalanced R-Trees Kenneth A. Ross
- Constraints manuscript No. (will be inserted by the editor)
- Principal Type Inference for GHC-Style Multi-Parameter Type Classes
- When Do Bounds and Domain Propagation Lead to the Same Search Space
- Constraint Cascading Style Sheets for the Web Greg J. Badros
- New Integer Linear Programming Approaches for Course Timetabling
- Optimizing Compilation of CLP(R) ANDREW D. KELLY and KIM MARRIOTT
- Precise Pair-Sharing Analysis of Logic Programs Vitaly Lagoon and Peter J. Stuckey
- Flexible Access Control Policy Specification with Constraint Logic Programming
- Boolean Constraints for Binding-Time Analysis Kevin Glynn, Peter J. Stuckey, Martin Sulzmann and Harald S ndergaard
- A Unit Two Variable Per Inequality Integer Constraint Solver
- A Framework for Analysis of Typed Logic Programs
- Improving Temporal Joins Using Histograms Inga Sitzmann and Peter J. Stuckey
- A Hybrid BDD and SAT Finite Domain Constraint Solver
- Confidence-based Work Stealing in Parallel Constraint Programming
- Fast Set Bounds Propagation Using a BDD-SAT Graeme Gange ggange@csse.unimelb.edu.au
- Type Processing by Constraint Reasoning Peter J. Stuckey1,2
- Rapid Learning for Binary Programs Timo Berthold 1
- Constraint Search Trees Peter J. Stuckey
- Using the heap to eliminate stack accesses Zoltan Somogyi and Peter J. Stuckey
- Propagating Dense Systems of Integer Linear Equations Thibaut Feydy and Peter J. Stuckey
- Cadmium: An Implementation of ACD Term Gregory J. Duck1
- Under consideration for publication in Theory and Practice of Logic Programming 1 Logic Programming with Satisfiability
- IMPROVING GENET AND EGENET BY NEW VARIABLE ORDERING STRATEGIES
- UNCORRECTEDPROOF S0004-3702(00)00053-9/FLA AID:1754 Vol.00(0) P.1 (1-39)
- AADEBUG2003 XXX1 The Chameleon Type
- Compacting Discriminator Information for Spatial Trees Inga Sitzmann Peter J. Stuckey
- A Theory of Overloading Peter J. Stuckey and Martin Sulzmann
- Building Design Optimization using Constraint Logic Programming
- E ective Strictness Analysis with HORN Constraints
- Flexible Font-Size Speci cation in Web Richard Lin y , Kim Marriott y and Peter Stuckey z
- Solving Linear Arithmetic Constraints for User Interface Applications
- Sound and Decidable Type Inference for Functional Dependencies
- Solving the Resource Constrained Project Scheduling Problem with Generalized
- Sharing and Groundness Dependencies in Logic MICHAEL CODISH, HARALD S NDERGAARD, and PETER J. STUCKEY
- Flexible Graph Layout for the Web Trevor Hansen, Kim Marriott & Bernd Meyer
- OTrees: a Constraintbased Index Structure Inga Sitzmann and Peter Stuckey
- Global Difference Constraint Propagation for Finite Domain Thibaut Feydy
- Trials and Tribulations of Designing a Modelling Maria Garcia de la Banda, Kim Marriott, Nicholas Nethercote, Reza
- A Hybrid Algorithm for the Examination Timetabling Problem
- The Usefulness of Constraints for Diagram Editing Michael Wybrow, Kim Marriott and Linda McIver
- Under consideration for publication in J. Functional Programming 1 Understanding Functional Dependencies via
- When Do Bounds and Domain Propagation Lead to the Same Search Space
- Box Constraint Collections for Adhoc Constraints # K.C.K. Cheng 1 , J.H.M. Lee 1 , and P.J. Stuckey 2
- , , 1{31 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- The Island Confinement Method for Reducing Search Space in Local Search Methods
- Efficient Constraint Propagation Engines CHRISTIAN SCHULTE
- G12: From Solver Independent Models to Efficient Solutions
- Lazy Clause Generation: Combining the best of SAT and CP (and MIP?) solving
- INFORMS JOURNAL ON COMPUTING Vol. 00, No. 0, Xxxxx 0000, pp. 000000
- Constraints manuscript No. (will be inserted by the editor)
- Incremental Satisfiability and Implication for UTVPI Constraints
- ZU064-05-FPR paper 7 September 2009 14:38 Under consideration for publication in J. Functional Programming 1
- Propagation via Lazy Clause Generation Olga Ohrimenko1
- Journal on Satisfiability, Boolean Modeling and Computation ? (2008) ??? Cache Conscious Data Structures for Boolean Satisfiability
- Removing Propagation Redundant Constraints in Redundant Modeling
- Optimal Sum-of-Pairs Multiple Sequence Alignment using Incremental Carrillo-and-Lipman Bounds.
- Journal of Artificial Intelligence Research 24 (2005) 109156 Submitted 10/04; published 7/05 Solving Set Constraint Satisfaction Problems using ROBDDs
- Lazy Clause Generation: Combining the power of SAT and CP (and MIP?) solving
- Automatically Exploiting Subproblem Equivalence in Constraint Programming
- Orthogonal Connector Routing Michael Wybrow1
- Minimizing the maximum number of open stacks by customer search
- Demand-driven Normalisation for ACD Term Rewriting
- Dynamic Analysis of Bounds versus Domain Propagation
- Telecommunications Feature Subscription as a Partial Order Constraint Problem
- Fast Set Bounds Propagation using BDDs Graeme Gange and Vitaly Lagoon
- Smooth Linear Approximation of Non-overlap Constraints
- From High-Level Model to Branch-and-Price Solution in G12
- Automating Branch-and-Bound for Dynamic Programs Jakob Puchinger Peter J.Stuckey
- Propagation = Lazy Clause Generation Olga Ohrimenko1
- MiniZinc: Towards A Standard CP Modelling Nicholas Nethercote1
- Encodings of the SEQUENCE constraint Sebastian Brand1
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP
- Constraint Propagation for Loose Constraint Graphs Kathryn Francis,
- CSP-104: Constraint Propagation for Loose Constraint In this paper we investigate whether we can improve propagation-
- ACD Term Rewriting Gregory J. Duck, Peter J. Stuckey, and Sebastian Brand
- Solving Partial Order Constraints for LPO Termination
- Size-Change Termination Analysis in k-Bits Michael Codish1
- Fast Node Overlap Removal , Kim Marriott1
- Cost-Based Optimization for Magic: Algebra and Implementation Praveen Seshadri
- A Lagrangian Reconstruction of a Class of Local Search Methods K.M.F. Choi J.H.M. Lee P.J. Stuckey
- Higher-Precision Groundness Analysis Michael Codish 1 , Samir Genaim 1 , Harald S ndergaard 2 and Peter J. Stuckey 2
- , , 1{20 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Interactive Type Debugging in Haskell Peter J. Stuckey
- Improving SAT using 2SAT Lei Zheng Peter J. Stuckey
- Propagating systems of dense linear integer constraints
- Constraints manuscript No. (will be inserted by the editor)
- Lock-free Parallel Dynamic Programming Alex Stivalaa
- Resource Usage Verification Kim Marriott 1 , Peter J. Stuckey 2 , and Martin Sulzmann 3
- Incremental Analysis of Constraint Logic Programs MANUEL HERMENEGILDO and GERMAN PUEBLA
- Set Bounds and (Split) Set Domain Propagation Using ROBDDs
- Finite Domain Bounds Consistency Revisited , W. Harvey2
- The Core Concept for 0/1 Integer Programming In this paper we examine an extension of the
- Just Enough Tabling Konstantinos Sagonas
- Incremental Connector Routing Michael Wybrow1
- Maintaining State in Propagation Solvers Raphael M. Reischuk1
- Half Reification and Flattening Thibaut Feydy1
- MiniZinc: Towards A Standard CP Modelling Nicholas Nethercote1
- Reducing Chaos in SAT-like Search: Finding Solutions Close to a Given One
- Optimal Carpet Cutting Andreas Schutt
- Explaining alldifferent Nicholas Downing Thibaut Feydy Peter J. Stuckey
- Search Combinators Tom Schrijvers1, Guido Tack2, Pieter Wuille2, Horst Samulowitz3, and Peter J.
- Noname manuscript No. (will be inserted by the editor)
