Incremental Filtering Algorithms for Precedence and Dependency Constraints
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00100356" target="_blank" >RIV/00216208:11320/08:00100356 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Incremental Filtering Algorithms for Precedence and Dependency Constraints
Original language description
Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logicalrelations between the activities for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In thepaper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on log-based reconciliation problems and min-cutset problems.
Czech name
Inkrementální filtrační algoritmy pro precedenční a dependenční podmínky
Czech description
Článek pojednává o integraci precedenčních a dependenčních podmínek v rámci temporálních sítí. Konkrétně jsou popsána inkrementální pravidla pro odstraňování nekonzistencí.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
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
2008
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
International Journal on Artificial Intelligence Tools
ISSN
0218-2130
e-ISSN
—
Volume of the periodical
17
Issue of the periodical within the volume
1
Country of publishing house
SG - SINGAPORE
Number of pages
17
Pages from-to
—
UT code for WoS article
000253753000013
EID of the result in the Scopus database
—