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)

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)

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

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)