Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models

Authors:
Roman Barták;Ondřej Čepek
Affiliations:
Faculty of Mathematics and Physics, Charles University in Prague, Praha 1, Czech Republic 118 00;Faculty of Mathematics and Physics, Charles University in Prague, Praha 1, Czech Republic 118 00 and Institute of Finance and Administration, Praha 10, Czech Republic 101 00
Venue:
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Year:
2008

Citing 6
Cited 5

On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Constraint-directed techniques for scheduling alternative activities

Artificial Intelligence
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning

Constraints
Nested temporal networks with alternatives: recognition and tractability

Proceedings of the 2008 ACM symposium on Applied computing
Handling alternative activities in resource-constrained project scheduling problems

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Executing reactive, model-based programs through graph-based temporal planning

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Optimizing alternatives in precedence networks

MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
MAK₠: a system for modelling, optimising, and analyzing production in small and medium enterprises

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Verifying nested workflows with extra constraints

MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
On verification of nested workflows with extra constraints: From theory to practice

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by reasoning about alternative activities in plans/schedules. Temporal Networks with Alternatives (TNA) were proposed to model alternative and parallel processes, however the problem of deciding which activities can be consistently included in such networks is NP-complete. Therefore a tractable subclass of Temporal Networks with Alternatives was proposed. This paper shows formal properties of these networks where precedence constraints are assumed. Namely, an algorithm that effectively recognizes whether a given network belongs to the proposed sub-class is studied and the proof of tractability is given by proposing a constraint model where global consistency is achieved via arc consistency.