Neighborhood singleton consistencies

DOI10.1007/s10601-018-9298-1zbMath1468.68207OpenAlexW2739834405WikidataQ128818407 ScholiaQ128818407MaRDI QIDQ2331105

Kostas Stergiou

Publication date: 25 October 2019

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-018-9298-1

zbMATH Keywords

constraint propagationlocal consistencysingleton consistency

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New algorithms for max restricted path consistency
• Adjustment of heads and tails for the job-shop problem
• Theoretical analysis of singleton arc consistency and its extensions
• Domain filtering consistencies for non-binary constraints
• Efficient algorithms for singleton arc consistency
• A sufficient condition for backtrack-bounded search
• SAC and neighbourhood SAC
• Neighbourhood SAC: Extensions and new algorithms
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Neighborhood singleton consistencies