Download PDFOpen PDF in browser

Replaceability and the Substitutability Hierarchy for Constraint Satisfaction Problems

13 pagesPublished: October 19, 2017


Problem simplification is a topic of continuing interest in the field of constraint satisfaction. In this paper we examine properties associated with the basic idea of substitutability and show how certain forms of substitutability
can be organized into a strict hierarchy. One of these properties, here called replaceability, has been identified by other authors as being of special interest. In this work we confirm these earlier claims and show that replaceability is significant because it is the most general property in the hierarchy that allows inferences from local to global versions of this property. To make use of this discovery, we introduce two algorithms for establishing neighbourhood replaceability, and we present an initial experimental examination of these algorithms including ways to improve their performance through ordering heuristics and various kinds of inference.

Keyphrases: consistency, constraint satisfaction, local to global inference, Substitutability

In: Christoph Benzmüller, Christine Lisetti and Martin Theobald (editors). GCAI 2017. 3rd Global Conference on Artificial Intelligence, vol 50, pages 51--63

Download PDFOpen PDF in browser