#### Filter Results:

- Full text PDF available (242)

#### Publication Year

1980

2017

- This year (3)
- Last 5 years (49)
- Last 10 years (110)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Rina Dechter, Itay Meiri, Judea Pearl
- Artif. Intell.
- 1989

- Rina Dechter
- 2003

- Rina Dechter, Judea Pearl
- Artif. Intell.
- 1989

- Rina Dechter
- UAI
- 1996

Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated within the bucket elimination framework. This emphasizes the principles common to many of the algorithms appearing in the probabilistic inference literature and clariies the… (More)

- Rina Dechter
- Artif. Intell.
- 1999

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional sat-issability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination for solving linear equalities and inequalities, and dynamic… (More)

- Rina Dechter
- Artif. Intell.
- 1990

Researchers m the areas of constramt sattsfactton problems, logtc programmmg, and truth mamte-nance systems have suggested vartous schemes for enhancmg the performance of the backtracking algorithm Thts paper defines and compares the performance of three such schemes "backlumpmg," "learmng," and "cycle-cutset " The backlumpmg and the cycle-cutset methods… (More)

- Rina Dechter, Judea Pearl
- Artif. Intell.
- 1987

- Rachel Ben-Eliyahu-Zohary, Rina Dechter
- Annals of Mathematics and Artificial Intelligence
- 1992

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. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such that each model of the latter corresponds to an answer set,… (More)

Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint network, we often wish to (i) find a solution that satisfies the constraints and (ii) find the corresponding minimal network where the constraints are as explicit as possible. Both… (More)

- Rina Dechter, Judea Pearl
- J. ACM
- 1985

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 <italic>g</italic> and the estimated completion cost <italic>h</italic>. It is shown that several known properties of A* retain their form (with the… (More)