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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 22 no. 1; H. Discrete Algorithms; S. 1 - 28
1. Verfasser:	Naanaa, Wady
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.01.2020 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	[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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!