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

DOI10.1007/978-3-540-85776-1_20zbMath1169.68599OpenAlexW1508879136MaRDI QIDQ3534663

Ondřej Čepek, Roman Barták

Publication date: 4 November 2008

Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_20

zbMATH Keywords

complexitytemporal networksalternativesconstraint models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Constraint-directed techniques for scheduling alternative activities
• CTP: A new constraint-based formalism for conditional, temporal planning
• On the Desirability of Acyclic Database Schemes

This page was built for publication: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models