---
title: "Resource Temporal Networks: Definition and Complexity"
authors:
  - "Philippe Laborie"
doi: ""
url: "https://ijcai.org/proceedings/2003/136"
pdf: "https://ijcai.org/proceedings/2003/0136.pdf"
venue: "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence"
year: 2003
pages: "948-952"
track: ""
keywords:
---

# Resource Temporal Networks: Definition and Complexity

Philippe Laborie

*Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence*, pages 948-952.

## Abstract

This paper introduces the concept of Resource Temporal Network (RTN), a constraint network that subsumes both classical attributes used in A.l. Planning and capacity resources traditionally handled in Scheduling. After giving a formal definition of RTNs, we analyze their expressive power and study complexities of several fragments of the RTN framework. We show that solving an RTN is in general NP-Complete - which is not surprising given the expressivity of the framework - whereas computing a Necessary Truth Criterion is polynomial. This last result opens the door for promising algorithms to solve RTNs.