A Dichotomy for First-Order Reducts of Unary Structures
Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite domains. Our first result is a general polynomial-time reduction...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Logical Methods in Computer Science e.V.
2018-05-01
|
| Seria: | Logical Methods in Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://lmcs.episciences.org/3264/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|