Temporal Reasoning in Nested Temporal Networks with Alternatives

DOI10.1007/978-3-540-89812-2_2zbMath1162.68649OpenAlexW1534961286MaRDI QIDQ5302722

Ondřej Čepek, Martin Hejna, Roman Barták

Publication date: 13 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89812-2_2

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs ⋮ Resource leveling in projects with flexible structures

Cites Work

• Temporal constraint networks
• Backtracking algorithms for disjunctions of temporal constraints
• CTP: A new constraint-based formalism for conditional, temporal planning
• Unnamed Item

This page was built for publication: Temporal Reasoning in Nested Temporal Networks with Alternatives