- Istituto per la Ricerca Scientifica e Tecnologica I 38100 Trento \Gamma Loc. Pant' e di Povo \Gamma tel. 0461\Gamma814444
- Using auxiliary variables and implied constraints to model nonbinary Barbara Smith
- An Abstract Proof Checker \Lambda Fausto Giunchiglia
- The Difference AllDifference Makes \Lambda Kostas Stergiou and Toby Walsh
- Transforming and Refining Abstract Constraint Specifications
- Combining Symmetry Breaking and Global Constraints
- Constraint Patterns: a research proposal Toby Walsh, APES group, University of York
- Solving Non-clausal Formulas with DPLL search Christian Thiffault
- Where are the hard manipulation problems? One possible escape from the Gibbard-Satterthwaite theorem is computational com-
- Using auxiliary variables and implied constraints to model non-binary Barbara Smith
- Restricted Global Grammar Constraints. George Katsirelos1
- Flow-Based Propagators for the SEQUENCE and Related Global Constraints
- Filtering Algorithms for the NValue Constraint Christian Bessiere 1 , Emmanuel Hebrard 2 , Brahim Hnich 3 , Zeynep Kiziltan 4 ,
- Matrix Modelling Pierre Flener
- Reformulating global constraints: the Slide and Regular constraints
- Dynamic Symmetry Breaking Constraints George Katsirelos 1 and Toby Walsh 2
- Toby Walsh ? University of York, York, England. tw@cs.york.ac.uk
- Two Encodings of DNNF Theories Jean Christoph Jung1 and Pedro Barahona2 and George Katsirelos3 and Toby Walsh4
- Encodings of the SEQUENCE constraint Sebastian Brand1
- Multiset Ordering Constraints of Computer Science
- Encodings of NonBinary Constraint Satisfaction Problems Kostas Stergiou and Toby Walsh
- Reformulating Global Grammar Constraints George Katsirelos1
- An Empirical Study of the Manipulability of Single Transferable Voting
- CGRASS: A System for Transforming Constraint Satisfaction Problems
- A Calculus for and Termination of Rippling David A. Basin \Lambda
- General Symmetry Breaking Constraints Toby Walsh 1
- Difference Matching \Lambda David Basin
- Towards an Understanding of Hillclimbing Procedures for SAT \Lambda
- CGRASS: A System for Transforming Constraint Satisfaction Problems
- Binary vs. NonBinary Constraints Fahiem Bacchus
- Computing possible and necessary winners from incomplete partially-ordered preferences
- Decomposable Constraints , Kostas Stergiou2
- Propagating Conjunctions of ALLDIFFERENT Constraints Christian Bessiere
- On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
- Constraint Programming with Multisets Zeynep Kiziltan1
- Among, Common and Disjoint Constraints Christian Bessiere 1 , Emmanuel Hebrard 2 , Brahim Hnich 3 ,
- Emmanuel Hebrard, Brahim Hnich, and Toby Walsh ? Cork Constraint Computation Centre
- Breaking Row and Column Symmetries in Matrix Models
- Stochastic OPL Cork Constraint Computation Centre
- Automated Discovery in Pure Mathematics Simon Colton, Alan Bundy and Toby Walsh,
- Managing your National ICT Australia
- Artificial Intelligence 172 (2008) 800822 www.elsevier.com/locate/artint
- Decomposing Global Grammar Constraints Claude-Guy Quimper1
- J Heuristics (2006) 12: 263--285 DOI 10.1007/s107320067071x
- Breaking Value Symmetry # NICTA and UNSW
- [7] F. Giunchiglia and R.W. Weyhrauch FOL User Manual FOL version 2 Technical Report 910705, DIST, University of Genova, Genova, Italy,
- Depthbounded Discrepancy Search Toby Walsh \Lambda
- The Hardest Random SAT Problems Ian P. Gent
- Global Grammar Constraints ClaudeGuy Quimper 1 and Toby Walsh 2
- Breaking Value Symmetry # NICTA and UNSW
- The Search for Satisfaction Ian P. Gent and Toby Walsh
- Permutation Problems and Channelling Constraints University of York, York, England. tw@cs.york.ac.uk
- The Range Constraint: Algorithms and Implementation
- Reformulating propositional satisfiability as constraint satisfaction
- Breaking Row and Column Symmetries in Matrix Models
- The Parameterized Complexity of Global Constraints C. Bessiere
- Circuit Complexity and Decompositions of Global Constraints Christian Bessiere
- Symmetry Breaking with SetVariables
- Constraint-based Preferential Optimization S. Prestwich
- Global Grammar Constraints Claude-Guy Quimper1
- The Range and Roots Constraints: some applications
- Filtering Algorithms for the NValue Constraint Christian Bessiere 1 , Emmanuel Hebrard 2 , Brahim Hnich 3 , Zeynep Kiziltan 4 ,
- Automatically Reformulating SAT-Encoded CSPs
- Arc Consistency and Quasigroup Completion Paul Shaw Kostas Stergiou Toby Walsh
- The Interface between P and NP: COL, XOR, NAE, 1-in-, and Horn SAT
- Global constraints for lexicographic orderings 0 Alan Frisch 1 , Brahim Hnich 2 , Zeynep K z ltan 2 , Ian Miguel 1 , and Toby Walsh 3
- Journal of Arti cial Intelligence Research 21 (2004) 357-391 Submitted 08/03; published 02/04 Dual Modelling of Permutation and Injection Problems
- Search on High Degree Graphs Department of Computer Science
- Handbook of Knowledge Representation Edited by B. Porter, V. Lifschitz and F. van Harmelen
- arXiv:1007.4114v1[cs.LO]23Jul2010 Under consideration for publication in Theory and Practice of Logic Programming 1
- WINTER 2007 59 I consider how to represent and reason with
- J Heuristics (2006) 12: 263285 DOI 10.1007/s10732-006-7071-x
- Submission to CONSTRAINTS Stochastic Constraint Programming: A Scenario-Based Approach
- Hybrid Modelling for Robust Solving Brahim Hnich1
- Computational Intelligence, Volume 14, Number 3, 1998 ANALYSIS OF HEURISTICS FOR NUMBER PARTITIONING
- Symmetry Breaking NICTA and UNSW
- Complexity & Symmetry NICTA and UNSW
- Value Symmetry NICTA and UNSW
- How to write a National ICT Australia and UNSW, Sydney
- Handbook of Constraint Programming 3 Edited by F. Rossi, P. van Beek and T. Walsh
- Parameterized Complexity Results in Symmetry Breaking
- Male optimal and unique stable marriages with partially ordered preferences
- An Empirical Study of Borda Manipulation Jessica Davies, George Katsirelos, Nina Narodytska and Toby Walsh
- Decomposition of the NVALUE constraint Christian Bessiere1
- Symmetry within and between solutions NICTA and University of NSW, Sydney, Australia, email: toby.walsh@nicta.com.au
- Is Computational Complexity a Barrier to Manipulation?
- Local search algorithms on the Stable Marriage Problem: Experimental Studies 1
- Compact Preference Representation in Stable Marriage Enrico Pilotto1
- Where are the really hard manipulation problems? The phase transition in manipulating the veto rule
- Decompositions of Grammar Constraints Claude-Guy Quimper
- Breaking Value Symmetry NICTA and UNSW
- The Weighted CFG Constraint George Katsirelos, Nina Narodytska, and Toby Walsh
- Breaking Symmetry of Interchangeable Variables and Values
- Decomposing Global Grammar Constraints Claude-Guy Quimper1
- Breaking Value Symmetry NICTA and UNSW
- Distance Constraints in Constraint Satisfaction Emmanuel Hebrard
- Filtering Algorithms for the NValue Constraint Christian Bessiere1
- Solving Non-clausal Formulas with DPLL search Christian Thiffault
- Combining Symmetry Breaking with Other Constraints: lexicographic ordering with sums
- Stochastic Constraint Programming Abstract. To model combinatorial decision problems involving
- Backbones in Optimization and Approximation John Slaney
- Search on High Degree Graphs Department of Computer Science
- Search in a Small World Department of Computer Science
- Constrained CP-nets Steve Prestwich
- Combining Symmetry Breaking with Other Constraints: lexicographic ordering with sums
- Stochastic Constraint Programming Department of Computer Science
- The Limits of Model-based Discovery? University of York, York, England. tw@cs.york.ac.uk
- Proof Planning in Maple Toby Walsh1
- Manipulating Tournaments in Cup and Round Robin Competitions
- Where are the really hard manipulation problems? The manipulation phase transition
- Dynamic Symmetry Breaking Constraints George Katsirelos1 and Toby Walsh2
- The Parameterized Complexity of Global Constraints C. Bessiere
- Breaking Value Symmetry NICTA and UNSW
- General Symmetry Breaking Constraints Toby Walsh1
- Symmetry Breaking using Value Precedence Toby Walsh1
- Samos SummerEMN soft_alldifferent
- University of the Aegean Department of Information and
- A Theory of Abstraction University of Edinburgh
- Permutation Problems and Channelling Constraints Toby Walsh 1
- Unsatisfied Variables in Local Search Ian P. Gent \Lambda Toby Walsh
- Hybrid Modelling for Robust Solving Brahim Hnich 1 , Zeynep Kiziltan 2 , Ian Miguel 3 , and Toby Walsh 1#
- Matrix Modelling: Exploiting Common Patterns Constraint Programming
- [Sim88] A. Simpson. Grazing: A Stand Alone Tactic for Theoretical Inference. Master's thesis, Dept. of Artificial Intelligence, University of Edinburgh, 1988.
- Why Channel? Multiple viewpoints for branching heuristics
- Symmetry Breaking Toby Walsh #
- Permutation Problems and Channelling Constraints Department of Computer Science
- Breaking Symmetry of Interchangeable Variables and Values #
- Reasoning about constraints conditional preferences: complexity results approximation techniques
- Journal of Arti cial Intelligence Research 21 (2004) 357-391 Submitted 08/03; published 02/04 Dual Modelling of Permutation and Injection Problems
- Artificial Intelligence 173 (2009) 299328 Contents lists available at ScienceDirect
- Artificial Intelligence 173 (2009) 10541078 Contents lists available at ScienceDirect
- Scenario-based Stochastic Constraint Programming Suresh Manandhar and Armagan Tarim
- Filtering Algorithms for the NValue Constraint Christian Bessiere 1 , Emmanuel Hebrard 2 , Brahim Hnich 3 , Zeynep Kiziltan 4 ,
- Filtering Algorithms for the NValue Constraint Christian Bessiere 1 , Emmanuel Hebrard 2 , Brahim Hnich 3 , Zeynep Kiziltan 4 ,
- A Calculus for Rippling \Lambda David A. Basin
- Symmetries of Symmetry Breaking Constraints George Katsirelos1 and Toby Walsh2
- The Parameterized Complexity of Global Constraints # C. Bessiere
- Breaking Symmetry of Interchangeable Variables and Values #
- Analogical Proof Planning Department of Artificial Intelligence
- A Fixpoint Based Encoding for Bounded Model Alan Frisch 1 , Daniel Sheridan 1 , and Toby Walsh 2
- General Symmetry Breaking Constraints Toby Walsh1
- The Range and Roots Constraints: some applications
- CP nets: representing and reasoning with preferences of multiple agents F. Rossi and K. B. Venable
- Singleton Consistencies Patrick Prosser 1 , Kostas Stergiou 2 , and Toby Walsh 3
- Complexity of Terminating Preference Elicitation NICTA and UNSW
- Artificial Intelligence 170 (2006) 803834 www.elsevier.com/locate/artint
- Among, Common and Disjoint Constraints Christian Bessiere1
- Handbook of Constraint Programming Edited by F. Rossi, P. van Beek and T. Walsh
- Multiset Ordering Constraints Alan Frisch and Ian Miguel
- by Toby Walsh September 14, 2009
- Finding Diverse and Similar Solutions in Constraint Programming Emmanuel Hebrard
- The Range Constraint: Algorithms and Implementation
- Manipulability of Single Transferable Vote Toby Walsh1
- Winner Determination in Sequential Majority Voting , M. S. Pini2
- Preferences in constraint satisfaction and optimization Francesca Rossi, K. Brent Venable, Toby Walsh
- Breaking Generator Symmetry George Katsirelos
- Decompositions of All Different, Global Cardinality and Related Constraints Christian Bessiere
- A compression algorithm for large arity extensional constraints
- Information Processing Letters 99 (2006) 171174 www.elsevier.com/locate/ipl
- (not PROVABLE(prov(all(x, diag(x)), k(all(x, diag(x))))))) 11 OCONS (11)
- Matrix Modelling: Exploiting Common Patterns
- Decomposing Global Grammar Constraints ClaudeGuy Quimper 1 and Toby Walsh 2
- Backbones in Optimization and Approximation John Slaney
- J Heuristics (2006) 12: 263--285 DOI 10.1007/s107320067071x
- Constraint Programming with Multisets Zeynep Kiziltan 1 and Toby Walsh 2
- Scenariobased Stochastic Constraint Programming Suresh Manandhar and Armagan Tarim
- mCP nets: representing and reasoning with preferences of multiple agents F. Rossi and K. B. Venable
- Aggregating partially ordered preferences: impossibility and possibility results
- Encodings of the SEQUENCE constraint Sebastian Brand 1 , Nina Narodytska 2 , ClaudeGuy Quimper 3 , Peter Stuckey 1 , and
- Termination Orderings for Rippling ? David A. Basin 1 and Toby Walsh 2
- Theorem Proving with De nitions Fausto Giunchiglia and Toby Walsh y
- Stochastic OPL Cork Constraint Computation Centre
- Solving Nonclausal Formulas with DPLL search Christian Thiffault 1 , Fahiem Bacchus 1? , and Toby Walsh 2??
- Automatically Reformulating SAT-Encoded CSPs
- The All Di#erent and Global Cardinality Constraints on Set, Multiset and Tuple Variables
- Consistency and Propagation with Multiset Constraints: A Formal Viewpoint
- Symmetry in Constraint Optimization # NICTA and UNSW
- Search on High Degree Graphs Department of Computer Science
- Interchangeable variables and values
- Local search for stable marriage problems with ties and incomplete lists
- The Range and Roots Constraints: Algorithms and Implementation
- Constraint Patterns Cork Constraint Computation Center, University College Cork, Ireland.
- Towards CSP Model Reformulation at Multiple Levels of Abstraction
- The Range and Roots Constraints: Algorithms and Implementation
- Combining Symmetry Breaking with Other Constraints: lexicographic ordering with sums #
- Multiset Ordering Constraints Frisch Computer Science
- MAXPLANCKINSTITUT \Omega \Psi
- Adding resolution to the DPLL procedure for Boolean satisfiability
- Preferences NICTA and University of NSW
- SLIDE: A Useful Special Case of the CARDPATH Constraint
- Some Complexity and Correctness Results for Proof Planning
- The Constrainedness KnifeEdge Department of Computer Science
- Phase Transition Behavior: from Decision to Optimization
- Cork Constraint Computation Center University College Cork
- An Empirical Analysis of Search in GSAT \Lambda Ian P. Gent
- Solving Nonclausal Formulas with DPLL search ? Christian Thiffault 1 , Fahiem Bacchus 1?? , and Toby Walsh 2? ? ?
- Reformulating global constraints: the Slide and Regular constraints
- Global Grammar Constraints Claude-Guy Quimper1
- Symmetry Breaking National ICT Australia and School of CSE, University of New South Wales, Sydney,
- Propagating Logical Combinations of Constraints Fahiem Bacchus
- Decomposition of the NVALUE constraint Christian Bessiere1
- The SAT Phase Transition Ian P. Gent 1 and Toby Walsh 2
- Permutation Problems and Channelling Constraints Toby Walsh 1
- Symmetry Breaking using Value Precedence Toby Walsh 1
- Adding resolution to the DPLL procedure for Boolean satisfiability
- Stochastic Constraint Programming Toby Walsh 1
- Search in a Small World Department of Computer Science
- Random Constraint Satisfaction: theory meets practice ?
- Reasoning about constraints conditional preferences: complexity results approximation techniques
- CP-networks: semantics, complexity, approximations and extensions
- Scaling Effects in the CSP Phase Transition ? Ian P. Gent 1 , Ewan MacIntyre 1 , Patrick Prosser 1 and Toby Walsh 2
- Beyond Finite Domains: the All Different and Global Cardinality Constraints
- Symmetries of Symmetry Breaking Constraints George Katsirelos
- Symmetry in Matrix Models Pierre Flener
- Constraint and Variable Ordering Heuristics for Compiling Configuration Nina Narodytska
- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables
- The Interface between P and NP: COL, XOR, NAE, 1ink, and Horn SAT Cork Constraint Computation Center
- The Use of Proof Plans to Sum Series \Lambda Toby Walsh Alex Nunes Alan Bundy
- CP-networks: semantics, complexity, approximations and extensions
- Incompleteness and Incomparability in Preference Aggregation # M. S. Pini 1 , F. Rossi 1 , K. B. Venable 1 and T. Walsh 2
- The Satisfiability Constraint Gap Ian P. Gent Toby Walsh
- A Divergence Critic Bundy, A., van Harmelen, F., Horn, C., & Smaill, A. (1990). The OysterClam system. In
- The Range and Roots Constraints: Specifying Counting and Occurrence Problems
- University of Leeds SCHOOL OF COMPUTER STUDIES
- A CP Model Disjunctive Scheduling Cumulative Scheduling Complex Objective Function ATC Constraint Based Scheduling
- Symmetry in Constraint Optimization NICTA and UNSW
- Modelling the Golomb Ruler Problem Barbara M. Smith1, Kostas Stergiou2, and Toby Walsh2
- Inverse Consistencies for Non-binary Constraints Kostas Stergiou1 and Toby Walsh2
- Breaking Value Symmetry NICTA and UNSW
- Combining Symmetry Breaking with Other Constraints: lexicographic ordering with sums #
- Decompositions of Grammar Constraints # ClaudeGuy Quimper
- Winner Determination in Sequential Majority Voting # J. Lang 1 , M. S. Pini 2 , F. Rossi 2 , K. B. Venable 2 and T. Walsh 3
- Modelling a Balanced Academic Curriculum Problem
- Matrix Modelling: Exploiting Common Patterns in Constraint Programming
- Online Cake Cutting We propose an online form of the cake cutting problem. This models situations where
- The SLIDE Meta-Constraint Christian Bessiere
- Cork Constraint Computation Center University College Cork
- Manipulating Tournaments in Cup and Round Robin Competitions
- Interleaved and Discrepancy Based Search Pedro Meseguer 1 and Toby Walsh 2
- Binary vs. NonBinary Constraints Fahiem Bacchus
- Breaking Value Symmetry # NICTA and UNSW
- [Pra65] D. Prawitz. Natural Deduction A proof theoretical study. Almquist and Wiksell, Stockholm, 1965.
- A compression algorithm for large arity extensional constraints #
- A Divergence Critic INRIALorraine
- A Fixpoint Based Encoding for Bounded Model Alan Frisch 1 , Daniel Sheridan 1 , and Toby Walsh 2
- Improving the Performance of maxRPC Thanasis Balafoutis1
- Modelling Grammar Constraints with Answer Set Programming
- The AllDifferent Constraint with Precedences Christian Bessiere1
- CoLogNET ....membership policy MEMBERSHIP POLICY
- Ann Oper Res (2011) 184: 179207 DOI 10.1007/s10479-010-0697-y
- Conflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation Christian Drescher and Toby Walsh
- Auton Agent Multi-Agent Syst (2011) 22:183199 DOI 10.1007/s10458-010-9121-x
- Symmetry-breaking Answer Set Solving Christian Drescher a, Oana Tifrea b and
- STABILITY IN MATCHING PROBLEMS WITH WEIGHTED PREFERENCES
- Complexity of and Algorithms for Borda Manipulation Jessica Davies
- Possible and necessary winners in voting trees: majority graphs vs. profiles
- Artificial Intelligence 175 (2011) 12721289 Contents lists available at ScienceDirect
- Translation-based Constraint Answer Set Solving Christian Drescher and Toby Walsh
- CoLogNET ....membership application A separate set a of rights and duties applies for non-European groups in accordance with the
- A Grand Challenge for Computing Research: a mathematical assistant
- Mathematical Mathematics?
- Symmetry Breaking for Distributed Multi-Context Systems
- A Comparison of Lex Bounds for Multiset Variables in Constraint Programming Y.C. Law and J.H.M. Lee and M.H.C. Woo
- Constraints (2011) 16:372406 DOI 10.1007/s10601-011-9110-y
- Journal of Artificial Intelligence Research 42 (2011) 1-29 Submitted 11/10; published 09/11 Where Are the Hard Manipulation Problems?
- The RegularGcc Matrix Constraint Ronald de Haan12
- Ann Math Artif Intell (2011) 62:726 DOI 10.1007/s10472-011-9255-9
