• 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,050
  • 339
  • PDF
Constraint Processing
  • R. Dechter
  • Computer Science
  • Lecture Notes in Computer Science
  • 1995
TLDR
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
  • 1,318
  • 180
  • PDF
Bucket Elimination: A Unifying Framework for Reasoning
  • R. Dechter
  • Computer Science
  • Artif. Intell.
  • 1 September 1999
TLDR
Bucket elimination is a unifying algorithmic framework that generalizes dynamic programming to accommodate algorithms for many complex problem-solving and reasoning tasks. Expand
  • 645
  • 68
  • PDF
Generalized best-first search strategies and the optimality of A*
TLDR
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
  • 954
  • 60
  • PDF
Tree Clustering for Constraint Networks
TLDR
This paper offers a systematic way of regrouping constraints into hierarchical structures capable of supporting search without backtracking. Expand
  • 615
  • 46
Bucket elimination: A unifying framework for probabilistic inference
  • R. Dechter
  • Mathematics, Computer Science
  • UAI
  • 1 August 1996
TLDR
We present a general way of combining conditioning and elimination within this framework. Expand
  • 533
  • 41
  • PDF
Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition
  • R. Dechter
  • Mathematics, Computer Science
  • Artif. Intell.
  • 3 January 1990
TLDR
We propose an integrated strategy for enhancing the performance of the backtracking algorithm that utilizes the distinct advantages of each scheme. Expand
  • 624
  • 38
  • PDF
Propositional semantics for disjunctive logic programs
TLDR
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
  • 216
  • 36
AND/OR search spaces for graphical models
TLDR
The paper introduces an AND/OR search space perspective for graphical models that include probabilistic networks (directed or undirected) and constraint networks. Expand
  • 274
  • 34
  • PDF
Network-based heuristics for constraint satisfaction problems
TLDR
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
  • 448
  • 32