Solving Sequential Planning Problems via Constraint Satisfaction
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10052035" target="_blank" >RIV/00216208:11320/10:10052035 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving Sequential Planning Problems via Constraint Satisfaction
Original language description
The paper describes how to enhance existing constraint models of sequential planning problems by using techniques such as symmetry breaking (dominance rules), singleton consistency, nogoods, lifting, or techniques motivated by the partial-order planning.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
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
2010
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
Name of the periodical
Fundamenta Informaticae
ISSN
0169-2968
e-ISSN
—
Volume of the periodical
99
Issue of the periodical within the volume
2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
21
Pages from-to
—
UT code for WoS article
000277761200002
EID of the result in the Scopus database
—