Nested Temporal Networks with Alternatives
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004342" target="_blank" >RIV/00216208:11320/07:00004342 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Nested Temporal Networks with Alternatives
Original language description
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Recently, several extensions of temporal networks were proposed to integrate non-temporal information such as resource consumption or logical dependencies. Temporal Networks with Alternatives were proposed to model alternative and parallel processes, however the problem of deciding which nodes can be consistently included in such networks is NP-complete. In this paper we propose a tractable subclass of Temporal Networks with Alternatives that can still cover a wide range of real-life processes, while the problem of deciding node validity is solvable in polynomial time. We also present an algorithm that can effectively recognize whether a givennetwork belongs to the proposed sub-class.
Czech name
Zahnízděné temporální sítě s alternativami
Czech description
Článek popisuje podtřídu temporálních sítí s podmínkami, kde je problém validity uzlů rozhodnutelný v polynomiálním čase.
Classification
Type
D - Article in proceedings
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
2007
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
Papers from the 2007 AAAI Workshop on Spatial and Temporal Reasoning
ISBN
978-1-57735-339-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
1-8
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Menlo Park
Event date
Jan 1, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—