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

In Constraint Processing, Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics.Expand

Bucket elimination is a unifying algorithmic framework that generalizes dynamic programming to accommodate algorithms for many complex problem-solving and reasoning tasks.Expand

This paper reports several properties of heuristic best-first search strategies whose scoring functions ƒ depend on all the information available from each candidate path, not merely on the current cost g and the estimated completion cost h.Expand

We propose an integrated strategy for enhancing the performance of the backtracking algorithm that utilizes the distinct advantages of each scheme.Expand

In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs.Expand

The paper introduces an AND/OR search space perspective for graphical models that include probabilistic networks (directed or undirected) and constraint networks.Expand

This paper identifies classes of problems that lend themselves to easy solutions, and develops algorithms that solve these problems optimally based on both the sparseness found in the constraint network and the simplicity of tree-structured CSPs.Expand