Peter Nightingale

Orcid: 0000-0002-5052-8634

Affiliations:
  • University of York, UK


According to our database1, Peter Nightingale authored at least 65 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints.
Constraints An Int. J., September, 2023

Towards a Model of Puzznic.
CoRR, 2023

Challenges in Modelling and Solving Plotting with PDDL.
CoRR, 2023

Learning When to Use Automatic Tabulation in Constraint Model Reformulation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Conjure: Automatic Generation of Constraint Models from Problem Specifications (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Automatic Tabulation in Constraint Models.
CoRR, 2022

Savile Row Manual.
CoRR, 2022

SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints.
Artif. Intell., 2022

Conjure: Automatic Generation of Constraint Models from Problem Specifications.
Artif. Intell., 2022

Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

A Framework for Generating Informative Benchmark Instances.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2021
Towards Reformulating Essence Specifications for Robustness.
CoRR, 2021

Improving Misinformation Detection in Tweets with Abstract Argumentation.
Proceedings of the 21st Workshop on Computational Models of Natural Argument, 2021

2020
How People Visually Represent Discrete Constraint Problems.
IEEE Trans. Vis. Comput. Graph., 2020

Effective Encodings of Constraint Programming Models to SMT.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Determining the Acceptability of Abstract Arguments with Graph Convolutional Networks.
Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 8th International Conference on Computational Models of Argument (COMMA 2020), 2020

2019
Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
A review of literature on parallel constraint solving.
Theory Pract. Log. Program., 2018

Complexity of n-Queens Completion (Extended Abstract).
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Framework for Constraint Based Local Search using Essence.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Closed Frequent Itemset Mining with Arbitrary Side Constraints.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

Automatic Discovery and Exploitation of Promising Subproblems for Tabulation.
Proceedings of the Principles and Practice of Constraint Programming, 2018

Metamorphic Testing of Constraint Solvers.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Complexity of n-Queens Completion.
J. Artif. Intell. Res., 2017

Generalized support and formal development of constraint propagators.
AI Commun., 2017

Automatically improving constraint models in Savile Row.
Artif. Intell., 2017

2016
Essence' Description.
CoRR, 2016

Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
S-Crucial and Bicrucial Permutations with Respect to Squares.
J. Integer Seq., 2015

Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
Qualitative modelling via constraint programming.
Constraints An Int. J., 2014

Generating custom propagators for arbitrary constraints.
Artif. Intell., 2014

Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Discriminating Instance Generation for Automated Constraint Model Selection.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Short and Long Supports for Constraint Propagation.
J. Artif. Intell. Res., 2013

The Extended Global Cardinality Constraint: An Empirical Survey: Extended Abstract.
Proceedings of the IJCAI 2013, 2013

Extending Simple Tabular Reduction with Short Supports.
Proceedings of the IJCAI 2013, 2013

Automated Symmetry Breaking and Model Selection in Conjure.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Qualitative Modelling via Constraint Programming: Past, Present and Future
CoRR, 2012

An automated approach to generating efficient constraint solvers.
Proceedings of the 34th International Conference on Software Engineering, 2012

2011
The extended global cardinality constraint: An empirical survey.
Artif. Intell., 2011

Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers.
Proceedings of the 9th Working IEEE/IFIP Conference on Software Architecture, 2011

Exploiting Short Supports for Generalised Arc Consistency for Arbitrary Constraints.
Proceedings of the IJCAI 2011, 2011

2010
Machine learning for constraint solver design -- A case study for the alldifferent constraint
CoRR, 2010

Implementing logical connectives in constraint programming.
Artif. Intell., 2010

Learning When to Use Lazy Learning in Constraint Solving.
Proceedings of the ECAI 2010, 2010

Ensemble Classification for Constraint Solver Configuration.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Generating Special-Purpose Stateless Propagators for Arbitrary Constraints.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
Non-binary quantified CSP: algorithms and modelling.
Constraints An Int. J., 2009

Modelling Equidistant Frequency Permutation Arrays in Constraints.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
Solving quantified constraint satisfaction problems.
Artif. Intell., 2008

Generalised arc consistency for the AllDifferent constraint: An empirical survey.
Artif. Intell., 2008

2007
Consistency and the Quantified Constraint Satisfaction Problem.
PhD thesis, 2007

Search in the patience game 'Black Hole'.
AI Commun., 2007

Data Structures for Generalised Arc Consistency for Extensional Constraints.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2005
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings.
J. Autom. Reason., 2005

QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Consistency for Quantified Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Encoding Quantified CSPs as Quantified Boolean Formulae.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003
Establishing timing requirements for control loops in real-time systems.
Microprocess. Microsystems, 2003

Establishing Timing Requirements and Control Attributes for Control Loops in Real-Time Systems.
Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS 2003), 2003


  Loading...