Exploiting Global Properties in Path-Consistency Applied on SAT
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10103284" target="_blank" >RIV/00216208:11320/11:10103284 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Exploiting Global Properties in Path-Consistency Applied on SAT
Original language description
The task of enforcing certain level of consistency in Boolean satisfiability problem (SAT problem) is addressed in this paper. The concept of path-consistency known from the constraint programming paradigm is revisited in this context.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 11th Scandinavian Conference on Artificial Intelligence
ISBN
978-1-60750-753-6
ISSN
0922-6389
e-ISSN
—
Number of pages
10
Pages from-to
90-99
Publisher name
IOS Press
Place of publication
Trondheim
Event location
Trondheim
Event date
May 24, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—