Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems

DOI10.3233/FI-2020-1944MaRDI QIDQ5140146zbMATH OpenFDO

Authors Richard J. Wallace

Publication date 14 December 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2020-1944

Mathematics Subject Classification ID

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

Recommendations

• SAC and neighbourhood SAC
• Neighbourhood SAC: extensions and new algorithms
• Theoretical analysis of singleton arc consistency and its extensions
• Efficient algorithms for singleton arc consistency
• Neighborhood singleton consistencies

Cites work

• Experimental studies of variable selection strategies based on constraint weights
• Neighbourhood SAC: extensions and new algorithms
• SAC and neighbourhood SAC

Cited in

(9)

• Neighborhood singleton consistencies
• Partition search for non-binary constraint satisfaction
• Theoretical analysis of singleton arc consistency and its extensions
• Efficient algorithms for singleton arc consistency
• Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
• Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
• SAC and neighbourhood SAC
• Neighbourhood SAC: extensions and new algorithms
• On the Integration of Singleton Consistencies and Look-Ahead Heuristics

This page was built for publication: Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140146)