Galois connections for patterns: an algebra of labelled graphs
A pattern is a generic instance of a binary constraint satisfaction problem (CSP) in which the compatibility of certain pairs of variable-value assignments may be unspecified. The notion of forbidden pattern has led to the discovery of several novel tractable classes for the CSP. However, for this f...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference item |
| Language: | English |
| Published: |
Springer
2021
|