Sciweavers

3134 search results - page 16 / 627
» Computing full disjunctions
Sort
View
AMAI
1999
Springer
13 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen