Locally consistent constraint satisfaction problems - (Extended abstract)

DVORAK, Z; Daniel KRÁĽ a O PANGRAC. Locally consistent constraint satisfaction problems - (Extended abstract). AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS. BERLIN: SPRINGER-VERLAG BERLIN, 2004, roč. 3142, s. 469-480. ISSN 0302-9743.

Základní údaje

Originální název

Locally consistent constraint satisfaction problems - (Extended abstract)

Autoři

DVORAK, Z; Daniel KRÁĽ a O PANGRAC

Vydání

AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, BERLIN, SPRINGER-VERLAG BERLIN, 2004, 0302-9743

---

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

Utajení

není předmětem státního či obchodního tajemství

UT WoS

000223656400041

---

Anotace

V originále

An instance of a constraint satisfaction problem is l-consistent if any l constraints of it can be simultaneously satisfied. For a fixed constraint type P, rho(l)(P) denotes the largest ratio of constraints which can be satisfied in any l-consistent instance. In this paper, we study locally consistent constraint satisfaction problems for constraints which are Boolean predicates. We determine the values of rho(l)(P) for all I and all Boolean predicates which have a certain natural property which we call 1-extendibility as well as for all Boolean predicates of arity at most three. All our results hold for both the unweighted and weighted versions of the problem.