◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Peter William Nightingale

University of York

10 papers hereh-index 191.2k citations75 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author8
  • last author2

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • cs.AI9
  • cs.CE1
affiliations
  • University of York
Homepage

identity via Semantic Scholar / OpenAlex

activity
20122024
most citedSAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints

13 citations · 21 across the 8 of their papers we have counts for

collaborators
Showing 2023Show all

3 papers · 1 filter

cs.AI2023

Towards a Model of Puzznic

Joan Espasa, Ian P. Gent, Ian Miguel +3

We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks. We focus here on levels wit…

cs.AI2023

Challenges in Modelling and Solving Plotting with PDDL

Joan Espasa, Ian Miguel, Peter Nightingale +2

We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this game is to remove a target number of coloured blo…

cs.AI2023★ 1 cited

Learning to Select SAT Encodings for Pseudo-Boolean and Linear Integer Constraints

Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker

Many constraint satisfaction and optimisation problems can be solved effectively by encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the simple…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.