New schemes for simplifying binary constraint satisfaction problems

Finding a solution to a Constraint Satisfaction Problem (CSP) is known to be an NP-hard task. This has motivatedthe multitude of works that have been devoted to developing techniques that simplify CSP instances before or duringtheir resolution.The present work proposes rigidly enforced schemes for s...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete mathematics and theoretical computer science Ročník 22 no. 1; číslo Discrete Algorithms; s. 1 - 28
Hlavní autor:	Naanaa, Wady
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 01.01.2020 Discrete Mathematics & Theoretical Computer Science
Témata:	[info.info-ai]computer science [cs]/artificial intelligence [cs.ai] [info.info-cc]computer science [cs]/computational complexity [cs.cc] Algorithms Artificial Intelligence Computational Complexity Computer Science constraint satisfaction problems Neighborhoods tractable csp value merging variable elimination Variables Constraint satisfaction problems value merging tractable CSP variable elimination
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!