• Publications
  • Influence
Temporal Constraint Networks
TLDR
This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a framework for processing temporal constraints that permits the processing of metric information, namely, assessments of time differences between events. Expand
  • 2,055
  • 340
  • PDF
Combining Qualitative and Quantitative Constraints in Temporal Reasoning
  • Itay Meiri
  • Mathematics, Computer Science
  • Artif. Intell.
  • 14 July 1991
TLDR
This paper presents a general, network-based computational model for temporal reasoning, capable of handling both qualitative and quantitative information. Expand
  • 352
  • 49
  • PDF
Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems
TLDR
This paper presents an experimental evaluation of two orthogonal schemes for pre-processing constraint satisfaction problems (CSPs). Expand
  • 114
  • 5
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
TLDR
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). Expand
  • 127
  • 3
  • PDF
Temporal reasoning: a constraint-based approach
This thesis introduces a new approach to temporal reasoning which increases both the expressive power and the flexibility of handling temporal information. It also offers a unifying conceptualizationExpand
  • 16
  • 3
Tree Decomposition with Applications to Constraint Processing
TLDR
We develop a polynomial time algorithm that, given an arbitrary constraint network, generates a precise tree representation whenever such a tree can be extracted from the input network; otherwise, the fact that no tree representation exists is acknowledged and the tree generated may serve as a good approximation to the original network. Expand
  • 15
  • 1
  • PDF
Temporal Constraints in Planning : Free or not Free ?
relating those decisional variables, thus making it possible to apply classical constraints propagation used in planning. Those meta-structures exist together with the classical time-points graphExpand
  • 6
Uncovering Trees in Constraint Networks
TLDR
We develop a polynomial-time algorithm that, given an arbitrary binary constraint network, either extracts (by edge removal) a precise tree representation from the path-consistent version of the network or acknowledges that no such tree can be extracted. Expand
  • 6
  • PDF
Combinin ualitative and Quantitative strai s in Temporal Reasoning
This paper presents a general model for temporal reasoning, capable of handling both qualita tive and quantitative information. This model allows the representation and processing of all types ofExpand
  • 2
  • PDF