Toby Walsh

According to our database1, Toby Walsh authored at least 306 papers between 1989 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
The new robber barons: the optimistic objectivists overturning the old order.
AI Matters, 2018

Fixing balanced knockout and double elimination tournaments.
Artif. Intell., 2018

Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items.
Proceedings of the KI 2018: Advances in Artificial Intelligence, 2018

Fairness in Deceased Organ Matching.
Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

Verifying Properties of Binarized Deep Neural Networks.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Orbital shrinking: Theory and applications.
Discrete Applied Mathematics, 2017

Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261).
Dagstuhl Reports, 2017

The Singularity May Never Be Near.
AI Magazine, 2017

Ethical Considerations in Artificial Intelligence Courses.
AI Magazine, 2017

Most Competitive Mechanisms in Online Fair Division.
Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

Expected Outcomes and Manipulations in Online Fair Division.
Proceedings of the KI 2017: Advances in Artificial Intelligence, 2017

Mechanisms for Online Organ Matching.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Pure Nash Equilibria in Online Fair Division.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

Equilibria in Sequential Allocation.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

The Meta-Turing Test.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
New Approaches to Constraint Acquisition.
Proceedings of the Data Mining and Constraint Programming, 2016

Barriers to Manipulation in Voting.
Proceedings of the Handbook of Computational Social Choice, 2016

Turing's red flag.
Commun. ACM, 2016

Reports of the 2016 AAAI Workshop Program.
AI Magazine, 2016

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

Control of Fair Division.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Interdependent Scheduling Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

h-Index Manipulation by Undoing Merges.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Welfare of Sequential Allocation Mechanisms for Indivisible Goods.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Strategic Behaviour When Allocating Indivisible Goods.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences.
SIGecom Exchanges, 2015

Who speaks for AI?
AI Matters, 2015

Reports from the 2015 AAAI Workshop Program.
AI Magazine, 2015

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Reasoning about Connectivity Constraints.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Possible and Necessary Allocations via Sequential Mechanisms.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Equilibria Under the Probabilistic Serial Rule.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Online Fair Division: Analysing a Food Bank Problem.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Controlling Elections by Replacing Candidates or Votes.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Manipulating the Probabilistic Serial Rule.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Challenges in Resource and Cost Allocation.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

A Study of Proxies for Shapley Allocations of Transport Costs.
Proceedings of the Artificial Intelligence for Transportation: Advice, 2015

Justified Representation in Approval-Based Committee Voting.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.
Artif. Intell., 2014

Reasoning about Constraint Models.
Proceedings of the PRICAI 2014: Trends in Artificial Intelligence, 2014

Allocation in Practice.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

The PeerRank Method for Peer Assessment.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

The Computational Impact of Partial Votes on Strategic Voting.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

How Hard Is It to Control an Election by Breaking Ties?
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Buffered Resource Constraint: Algorithms and Complexity.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

SAT and Hybrid Models of the Car Sequencing Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

The Balance Constraint Family.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Fair assignment of indivisible objects under ordinal preferences.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Controlling Elections by Replacing Candidates: Theoretical and Experimental Results.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Justified Representation in Approval-Based Committee Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Fixing a Balanced Knockout Tournament.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Fixing a Balanced Knockout Tournament.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency
Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

Multiset variable representations and constraint propagation.
Constraints, 2013

Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences.
Algorithms, 2013

Local Search Approaches in Stable Matching Problems.
Algorithms, 2013

SAT Encodings for the Car Sequencing Problem.
Proceedings of the POS-13. Fourth Pragmatics of SAT workshop, 2013

A Framework for Combining Set Variable Representations.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Efficient Approximation of Well-Founded Justification and Well-Founded Domination.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Three Generalizations of the FOCUS Constraint.
Proceedings of the IJCAI 2013, 2013

A Social Welfare Optimal Sequential Allocation Procedure.
Proceedings of the IJCAI 2013, 2013

On the Complexity of Global Scheduling Constraints under Structural Restrictions.
Proceedings of the IJCAI 2013, 2013

Detecting and Exploiting Subproblem Tractability.
Proceedings of the IJCAI 2013, 2013

Constraint Acquisition via Partial Queries.
Proceedings of the IJCAI 2013, 2013

An Adaptive Model Restarts Heuristic.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Breaking Symmetry with Different Orderings.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Manipulating two stage voting rules.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Coalitional manipulation for Schulze's rule.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

PrefLib: A Library for Preferences http://www.preflib.org.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
AI@NICTA.
AI Magazine, 2012

Winner determination in voting trees with incomplete preferences and weighted votes.
Autonomous Agents and Multi-Agent Systems, 2012

Answer Set Solving with Lazy Nogood Generation.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Combining Voting Rules Together.
Proceedings of the ECAI 2012, 2012

A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2012

The SeqBin Constraint Revisited.
Proceedings of the Principles and Practice of Constraint Programming, 2012

The RegularGcc Matrix Constraint.
Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

TRANSIT Routing on Video Game Maps.
Proceedings of the Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2012

Lot-based voting rules.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Symmetry Breaking Constraints: Recent Results.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Eliminating the Weakest Link: Making Manipulation Intractable?
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, 2011

Where Are the Hard Manipulation Problems?
J. Artif. Intell. Res., 2011

New algorithms for max restricted path consistency.
Constraints, 2011

The weighted Grammar constraint.
Annals OR, 2011

Symmetry-breaking answer set solving.
AI Commun., 2011

Incompleteness and incomparability in preference aggregation: Complexity results.
Artif. Intell., 2011

Manipulation complexity and gender neutrality in stable marriage procedures.
Autonomous Agents and Multi-Agent Systems, 2011

Weights in stable marriage problems increase manipulation opportunities.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Symmetry Breaking for Distributed Multi-Context Systems.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Adaptive signal-vehicle cooperative controlling system.
Proceedings of the 14th International IEEE Conference on Intelligent Transportation Systems, 2011

Exploiting Constraints.
Proceedings of the Inductive Logic Programming - 21st International Conference, 2011

Translation-Based Constraint Answer Set Solving.
Proceedings of the IJCAI 2011, 2011

Modelling Grammar Constraints with Answer Set Programming.
Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

Stability and Optimality in Matching Problems with Weighted Preferences.
Proceedings of the Agents and Artificial Intelligence - Third International Conference, 2011

Stability in Matching Problems with Weighted Preferences.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 2, 2011

A Local Search Approach to Solve Incomplete Fuzzy CSPs.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1, 2011

The AllDifferent Constraint with Precedences.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Possible and necessary winners in voting trees: majority graphs vs. profiles.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Procedural fairness in stable marriage problems.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Online Cake Cutting.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

Manipulation of Nanson's and Baldwin's Rules.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Conflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Complexity of and Algorithms for Borda Manipulation.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Dominating Manipulations in Voting with Partial Information.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

The Next Best Solution.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
A translational approach to constraint answer set solving.
TPLP, 2010

Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies.
Artif. Intell., 2010

Symmetry within and between Solutions.
Proceedings of the PRICAI 2010: Trends in Artificial Intelligence, 2010

Local Search for Stable Marriage Problems with Ties and Incomplete Lists.
Proceedings of the PRICAI 2010: Trends in Artificial Intelligence, 2010

Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Parameterized Complexity Results in Symmetry Breaking.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

An Empirical Study of the Manipulability of Single Transferable Voting.
Proceedings of the ECAI 2010, 2010

Symmetries of Symmetry Breaking Constraints.
Proceedings of the ECAI 2010, 2010

Local search algorithms on the Stable Marriage Problem: Experimental Studies.
Proceedings of the ECAI 2010, 2010

Manipulability of Single Transferable Vote.
Proceedings of the Computational Foundations of Social Choice, 07.03. - 12.03.2010, 2010

On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Decomposition of the NValue Constraint.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Improving the Performance of maxRPC.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Is Computational Complexity a Barrier to Manipulation?
Proceedings of the Computational Logic in Multi-Agent Systems, 11th International Workshop, 2010

Male optimality and uniqueness in stable marriage problems with partial orders.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Symmetry in Solutions.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Reformulation of Global Constraints in Answer Set Programming.
Proceedings of the Abstraction, 2010

Propagating Conjunctions of AllDifferent Constraints.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Aggregating Partially Ordered Preferences.
J. Log. Comput., 2009

Filtering algorithms for the multiset ordering constraint.
Artif. Intell., 2009

Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints.
Artif. Intell., 2009

Restart Strategy Selection Using Machine Learning Techniques.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule.
Proceedings of the IJCAI 2009, 2009

Circuit Complexity and Decompositions of Global Constraints.
Proceedings of the IJCAI 2009, 2009

Decompositions of All Different, Global Cardinality and Related Constraints.
Proceedings of the IJCAI 2009, 2009

Reformulating Global Grammar Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

Restricted Global Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2009

Manipulation and gender neutrality in stable marriage procedures.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Manipulating Tournaments in Cup and Round Robin Competitions.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Compact Preference Representation in Stable Marriage Problems.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Constraint Programming.
Proceedings of the Handbook of Knowledge Representation, 2008

Preferences in Constraint Satisfaction and Optimization.
AI Magazine, 2008

Domain filtering consistencies for non-binary constraints.
Artif. Intell., 2008

Online Estimation of SAT Solving Runtime.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Complexity Issues in Preference Elicitation and Manipulation.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

SLIDE: A Useful Special Case of the CARDPATH Constraint.
Proceedings of the ECAI 2008, 2008

Combining Symmetry Breaking and Global Constraints.
Proceedings of the Recent Advances in Constraints, 2008

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

Flow-Based Propagators for the SEQUENCE and Related Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Complexity of terminating preference elicitation.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Breaking Value Symmetry.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Decompositions of Grammar Constraints.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

The Parameterized Complexity of Global Constraints.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Configuration.
IEEE Intelligent Systems, 2007

The Complexity of Reasoning with Global Constraints.
Constraints, 2007

Representing and Reasoning with Preferences.
AI Magazine, 2007

Reformulating Global Constraints: The Slideand RegularConstraints.
Proceedings of the Abstraction, 2007

Incompleteness and Incomparability in Preference Aggregation.
Proceedings of the IJCAI 2007, 2007

Constraint and Variable Ordering Heuristics for Compiling Configuration Problems.
Proceedings of the IJCAI 2007, 2007

Winner Determination in Sequential Majority Voting.
Proceedings of the IJCAI 2007, 2007

Distance Constraints in Constraint Satisfaction.
Proceedings of the IJCAI 2007, 2007

Breaking Value Symmetry.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Decomposing Global Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Breaking Symmetry of Interchangeable Variables and Values.
Proceedings of the Principles and Practice of Constraint Programming, 2007

A Compression Algorithm for Large Arity Extensional Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Encodings of the Sequence Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Uncertainty in Preference Elicitation and Aggregation.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Introduction.
Proceedings of the Handbook of Constraint Programming, 2006

Randomness and Structure.
Proceedings of the Handbook of Constraint Programming, 2006

Tetravex is NP-complete.
Inf. Process. Lett., 2006

Hard and soft constraints for reasoning about qualitative conditional preferences.
J. Heuristics, 2006

Stochastic Constraint Programming: A Scenario-Based Approach.
Constraints, 2006

Filtering Algorithms for the NValueConstraint.
Constraints, 2006

Propagation algorithms for lexicographic ordering constraints.
Artif. Intell., 2006

Symmetry Breaking Using Value Precedence.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Inverse Consistencies for Non-Binary Constraints.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

The Range Constraint: Algorithms and Implementation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

General Symmetry Breaking Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Global Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2006

The ROOTS Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Symmetry Breaking.
Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

Strategic voting when aggregating partially ordered preferences.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Estimating Search Tree Size.
Proceedings of the Proceedings, 2006

2005
Satisfiability in the Year 2005.
J. Autom. Reasoning, 2005

Aggregating preferences cannot be fair.
Intelligenza Artificiale, 2005

Aggregating partially ordered preferences: impossibility and possibility results.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

Transforming and Refining Abstract Constraint Specifications.
Proceedings of the Abstraction, 2005

The Backbone of the Travelling Salesperson.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

The Range and Roots Constraints: Specifying Counting and Occurrence Problems.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Propagating Logical Combinations of Constraints.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
Proceedings of the Logic Programming, 21st International Conference, 2005

The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables.
Proceedings of the Recent Advances in Constraints, 2005

Among, Common and Disjoint Constraints.
Proceedings of the Recent Advances in Constraints, 2005

Filtering Algorithms for the NValue Constraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

The G12 Project: Mapping Solver Independent Models to Efficient Solutions.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Beyond Finite Domains: The All Different and Global Cardinality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Improved Algorithm for Finding (a, b)-Super Solutions.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Computing Super-Schedules.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Constraint-Based Preferential Optimization.
Proceedings of the Proceedings, 2005

Backbones and Backdoors in Satisfiability.
Proceedings of the Proceedings, 2005

Finding Diverse and Similar Solutions in Constraint Programming.
Proceedings of the Proceedings, 2005

2004
Dual Modelling of Permutation and Injection Problems.
J. Artif. Intell. Res., 2004

Hybrid Modelling for Robust Solving.
Annals OR, 2004

Principles of Constraint Programming and Constraint Processing: A Review.
AI Magazine, 2004

Solving Non-clausal Formulas with DPLL search.
Proceedings of the SAT 2004, 2004

Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

Robust Solutions for Constraint Satisfaction and Optimization.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Super Solutions in Constraint Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

Solving Non-clausal Formulas with DPLL Search.
Proceedings of the Principles and Practice of Constraint Programming, 2004

The Tractability of Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Disjoint, Partition and Intersection Constraints for Set and Multiset Variables.
Proceedings of the Principles and Practice of Constraint Programming, 2004

mCP Nets: Representing and Reasoning with Preferences of Multiple Agents.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

The Complexity of Global Constraints.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Local Consistencies in SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Scenario-based Stochastic Constraint Programming.
Proceedings of the IJCAI-03, 2003

Multiset Ordering Constraints.
Proceedings of the IJCAI-03, 2003

Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques.
Proceedings of the IJCAI-03, 2003

Consistency and Propagation with Multiset Constraints: A Formal Viewpoint.
Proceedings of the Principles and Practice of Constraint Programming, 2003

Constraint Patterns.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Satisfiability in the Year 2000.
J. Autom. Reasoning, 2002

AAAI 2002 Workshops.
AI Magazine, 2002

AAAI 2002 Fall Symposium Series Reports.
AI Magazine, 2002

Binary vs. non-binary constraints.
Artif. Intell., 2002

A Fixpoint Based Encoding for Bounded Model Checking.
Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

Stochastic Constraint Programming.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002

Models of Injection Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Global Constraints for Lexicographic Orderings.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Breaking Row and Column Symmetries in Matrix Models.
Proceedings of the Principles and Practice of Constraint Programming, 2002

Automatic Generation of Implied Clauses for SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2002

CGRASS: A System for Transforming Constraint Satisfaction Problems.
Proceedings of the Recent Advances in Constraints, 2002

The Interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Random Constraint Satisfaction: Flaws and Structure.
Constraints, 2001

Symposium on Abstraction, Reformulation, and Approximation (SARA-2000).
AI Magazine, 2001

Permutation Problems and Channelling Constraints.
Proceedings of the Logic for Programming, 2001

Search on High Degree Graphs.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Backbones in Optimization and Approximation.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Satisfiability in the Year 2000.
J. Autom. Reasoning, 2000

On the notion of interestingness in automated mathematical discovery.
Int. J. Hum.-Comput. Stud., 2000

Reformulating Propositional Satisfiability as Constraint Satisfaction.
Proceedings of the Abstraction, 2000

Automatic Identification of Mathematical Concepts.
Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

SAT v CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Singleton Consistencies.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Automatic Generation of Implied Constraints: Project Description.
Proceedings of the Seventh Workshop on Automated Reasoning, 2000

Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

Automatic Invention of Integer Sequences.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Paul R. Cohen's Empirical Methods for Artificial Intelligence.
Artif. Intell., 1999

Search in a Small World.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

The Difference All-Difference Makes.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Automatic Concept Formation in Pure Mathematics.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

CSPLIB: A Benchmark Library for Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1999

Decomposable Constraints.
Proceedings of the New Trends in Contraints, 1999

Encodings of Non-Binary Constraint Satisfaction Problems.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

Beyond NP: the QSAT phase transition.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

Morphing: Combining Structure and Randomness.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study.
Inf. Process. Lett., 1998

Analysis of Heuristics for Number Partitioning.
Computational Intelligence, 1998

Empirical Methods in AI.
AI Magazine, 1998

Interleaved and Discrepancy Based Search.
ECAI, 1998

Random Constraint Satisfaction: Theory Meets Practice.
Proceedings of the Principles and Practice of Constraint Programming, 1998

The Constrainedness Knife-Edge.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem.
J. Autom. Reasoning, 1997

Theories of Abstraction.
AI Commun., 1997

Depth-bounded Discrepancy Search.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

The Constrainedness of Arc Consistency.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

The Scaling of Search Cost.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
A Calculus for and Termination of Rippling.
J. Autom. Reasoning, 1996

A Divergence Critic for Inductive Proof.
J. Artif. Intell. Res., 1996

The Satisfiability Constraint Gap.
Artif. Intell., 1996

The TSP Phase Transition.
Artif. Intell., 1996

Calculating Criticalities.
Artif. Intell., 1996

Phase Transitions and Annealed Theories: Number Partitioning as a Case Study.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Local Search and the Number of Solutions.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

A General Purpose Reasoner for Abstraction.
Proceedings of the Advances in Artificial Intelligence, 1996

The Constrainedness of Search.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

Computing Abstraction Hierarchies by Numerical Simulation.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Scaling Effects in the CSP Phase Transition.
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Easy Problems are Sometimes Hard.
Artif. Intell., 1994

The Hardest Random SAT Problems.
Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

Coloured Rippling: An Extension of a Theorem Proving Heuristic.
ECAI, 1994

The SAT Phase Transition.
ECAI, 1994

A Calculus for Rippling.
Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

A Divergence Critic.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

Termination Orderings for Rippling.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
The Inevitability of Inconsistent Abstract Spaces.
J. Autom. Reasoning, 1993

An Empirical Analysis of Search in GSAT.
J. Artif. Intell. Res., 1993

Difference Unification.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

General Purpose Proof Plans.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

Towards an Understanding of Hill-Climbing Procedures for SAT.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
A Theory of Abstraction.
Artif. Intell., 1992

Tree Subsumption: Reasoning with Outlines.
ECAI, 1992

The Use of Proof Plans to Sum Series.
Proceedings of the Automated Deduction, 1992

Difference Matching.
Proceedings of the Automated Deduction, 1992

1989
Abstract Theorem Proving.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989


  Loading...