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...

Celý popis

Podrobná bibliografie

Hlavní autor:	Florent R. Madelaine
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Logical Methods in Computer Science e.V. 2009-06-01
Edice:	Logical Methods in Computer Science
Témata:	computer science - logic in computer science computer science - discrete mathematics f.4.1
On-line přístup:	https://lmcs.episciences.org/1237/pdf
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!