Universal Structures and the logic of Forbidden Patterns
Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class which has low tree-depth decomposition (e.g. structure of bounded degree, proper minor closed class and more generally c...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Logical Methods in Computer Science e.V.
2009-06-01
|
| Cyfres: | Logical Methods in Computer Science |
| Pynciau: | |
| Mynediad Ar-lein: | https://lmcs.episciences.org/1237/pdf |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|