Rina Dechter

Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger: A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinformatics 29(2): 197-205 (2013)

Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger: A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinformatics 29(5): 669 (2013)

Rina Dechter, Kalev Kask, Robert Mateescu: Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013)

Rina Dechter, David Ephraim Larkin: Hybrid Processing of Beliefs and Constraints. CoRR abs/1301.2265 (2013)

Kalev Kask, Rina Dechter: Mini-Bucket Heuristics for Improved Search. CoRR abs/1301.6708 (2013)

Irina Rish, Kalev Kask, Rina Dechter: Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. CoRR abs/1301.7409 (2013)

Rina Dechter, Irina Rish: A Scheme for Approximating Probabilistic Inference. CoRR abs/1302.1534 (2013)

Rina Dechter: Bucket Elimination: A Unifying Framework for Several Probabilistic Inference. CoRR abs/1302.3572 (2013)

Rina Dechter: Topological Parameters for Time-Space Tradeoff. CoRR abs/1302.3573 (2013)

Yousri El Fattah, Rina Dechter: An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits. CoRR abs/1302.3576 (2013)

Judea Pearl, Rina Dechter: Identifying Independencies in Causal Graphs with Feedback. CoRR abs/1302.3595 (2013)

Vibhav Gogate, Rina Dechter: Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell. 184-185: 38-77 (2012)

Lars Otten, Rina Dechter: Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25(3): 211-227 (2012)

Rina Dechter, Natalia Flerova, Radu Marinescu: Search Algorithms for m Best Solutions for Graphical Models. AAAI 2012

Lars Otten, Rina Dechter: Advances in Distributed Branch and Bound. ECAI 2012: 917-918

Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten: Join-graph based cost-shifting schemes. UAI 2012: 397-406

Lars Otten, Rina Dechter: A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI 2012: 665-674

Kalev Kask, Rina Dechter, Andrew Gelfand: BEEM : Bucket Elimination with External Memory. CoRR abs/1203.3487 (2012)

Vibhav Gogate, Rina Dechter: AND/OR Importance Sampling. CoRR abs/1206.3232 (2012)

Lars Otten, Rina Dechter: Bounding Search Space Size via (Hyper)tree Decompositions. CoRR abs/1206.3284 (2012)

Vibhav Gogate, Bozhena Bidyuk, Rina Dechter: Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. CoRR abs/1206.5242 (2012)

Robert Mateescu, Rina Dechter: AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. CoRR abs/1206.5266 (2012)

Radu Marinescu, Rina Dechter: Best-First AND/OR Search for Most Probable Explanations. CoRR abs/1206.5268 (2012)

Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca: Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. CoRR abs/1207.1384 (2012)

Vibhav Gogate, Rina Dechter: Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. CoRR abs/1207.1385 (2012)

Robert Mateescu, Rina Dechter: The Relationship Between AND/OR Search and Variable Elimination. CoRR abs/1207.1407 (2012)

Vibhav Gogate, Rina Dechter: A Complete Anytime Algorithm for Treewidth. CoRR abs/1207.4109 (2012)

Rina Dechter, Robert Mateescu: Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. CoRR abs/1207.4119 (2012)

Bozhena Bidyuk, Rina Dechter: On finding minimal w-cutset. CoRR abs/1207.4127 (2012)

Rina Dechter, Thomas S. Richardson: Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006). CoRR abs/1208.5160 (2012)

Alexander T. Ihler, Natalia Flerova, Rina Dechter, Lars Otten: Join-graph based cost-shifting schemes. CoRR abs/1210.4878 (2012)

Lars Otten, Rina Dechter: A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. CoRR abs/1210.4885 (2012)

Bozhena Bidyuk, Rina Dechter: An Empirical Study of w-Cutset Sampling for Bayesian Networks. CoRR abs/1212.2449 (2012)

Rina Dechter, Robert Mateescu: A Simple Insight into Iterative Belief Propagation's Success. CoRR abs/1212.2463 (2012)

Radu Marinescu, Kalev Kask, Rina Dechter: Systematic vs. Non-systematic Algorithms for Solving the MPE Task. CoRR abs/1212.2505 (2012)

Vibhav Gogate, Rina Dechter: SampleSearch: Importance sampling in presence of determinism. Artif. Intell. 175(2): 694-729 (2011)

Vibhav Gogate, Rina Dechter: Sampling-based lower bounds for counting queries. Intelligenza Artificiale 5(2): 171-188 (2011)

Andrew Gelfand, Kalev Kask, Rina Dechter: Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI 2011

Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter: Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011

Natalia Flerova, Emma Rollon, Rina Dechter: Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. GKR 2011: 91-118

Lars Otten, Rina Dechter: Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing 2011: 26-37

Lars Otten, Rina Dechter: Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS 2011

Bozhena Bidyuk, Rina Dechter: Cutset Sampling for Bayesian Networks. CoRR abs/1110.2740 (2011)

Radu Marinescu, Rina Dechter: Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints 15(1): 29-63 (2010)

Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter: Join-Graph Propagation Algorithms. J. Artif. Intell. Res. (JAIR) 37: 279-328 (2010)

Bozhena Bidyuk, Rina Dechter, Emma Rollon: Active Tuples-based Scheme for Bounding Posterior Beliefs. J. Artif. Intell. Res. (JAIR) 39: 335-371 (2010)

Vibhav Gogate, Rina Dechter: On Combining Graph-based Variance Reduction schemes. Journal of Machine Learning Research - Proceedings Track 9: 257-264 (2010)

Emma Rollon, Rina Dechter: New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. AAAI 2010

Lars Otten, Rina Dechter: Toward parallel search for optimization in graphical models. ISAIM 2010

Emma Rollon, Rina Dechter: Evaluating partition strategies for mini-bucket elimination. ISAIM 2010

Kalev Kask, Rina Dechter, Andrew Gelfand: BEEM : Bucket Elimination with External Memory. UAI 2010: 268-276

Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009)

Radu Marinescu, Rina Dechter: Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009)

Robert Mateescu, Rina Dechter: Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008)

Robert Mateescu, Rina Dechter, Radu Marinescu: AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. (JAIR) 33: 465-519 (2008)

Vibhav Gogate, Rina Dechter: Studies in Solution Sampling. AAAI 2008: 271-276

Robert Mateescu, Rina Dechter: AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257

Vibhav Gogate, Rina Dechter: Approximate Solution Sampling (and Counting) on AND/OR Spaces. CP 2008: 534-538

Lars Otten, Rina Dechter: Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581

Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter: Robust Solutions in Unstable Optimization Problems. CSCLP 2008: 116-131

Rina Dechter, Lars Otten, Radu Marinescu: On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914

Vibhav Gogate, Rina Dechter: AND/OR Importance Sampling. UAI 2008: 212-219

Lars Otten, Rina Dechter: Bounding Search Space Size via (Hyper)tree Decompositions. UAI 2008: 452-459

Rina Dechter, Robert Mateescu: AND/OR search spaces for graphical models. Artif. Intell. 171(2-3): 73-106 (2007)

Bozhena Bidyuk, Rina Dechter: Cutset Sampling for Bayesian Networks. J. Artif. Intell. Res. (JAIR) 28: 1-48 (2007)

Vibhav Gogate, Rina Dechter: SampleSearch: A Scheme that Searches for Consistent Samples. Journal of Machine Learning Research - Proceedings Track 2: 147-154 (2007)

Vibhav Gogate, Rina Dechter: Approximate Counting by Sampling the Backtrack-free Search Space. AAAI 2007: 198-203

Radu Marinescu, Rina Dechter: Best-First AND/OR Search for Graphical Models. AAAI 2007: 1171-1176

Robert Mateescu, Radu Marinescu, Rina Dechter: AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513

Radu Marinescu, Rina Dechter: Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR 2007: 171-185

Robert Mateescu, Rina Dechter: A Comparison of Time-Space Schemes for Graphical Models. IJCAI 2007: 2346-2352

Vibhav Gogate, Bozhena Bidyuk, Rina Dechter: Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. UAI 2007: 141-148

Radu Marinescu, Rina Dechter: Best-First AND/OR Search for Most Probable Explanations. UAI 2007: 259-266

Robert Mateescu, Rina Dechter: AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. UAI 2007: 276-284

Bozhena Bidyuk, Rina Dechter: An Anytime Scheme for Bounding Posterior Beliefs. AAAI 2006: 1095-1100

Radu Marinescu, Rina Dechter: Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI 2006: 1200-1205

Robert Mateescu, Rina Dechter: Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP 2006: 329-343

Vibhav Gogate, Rina Dechter: A New Algorithm for Sampling CSP Solutions Uniformly at Random. CP 2006: 711-715

Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR 2006: 152-166

Radu Marinescu, Rina Dechter: Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI 2006: 138-142

Bozhena Bidyuk, Rina Dechter: Improving Bound Propagation. ECAI 2006: 342-346

Bozhena Bidyuk, Rina Dechter: Cutset Sampling with Likelihood Weighting. UAI 2006

Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter: Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2): 165-193 (2005)

Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP 2005: 857

Robert Mateescu, Rina Dechter: AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP 2005: 860

Radu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Graphical Models. IJCAI 2005: 224-229

Robert Mateescu, Rina Dechter: AND/OR Cutset Conditioning. IJCAI 2005: 230-235

Vibhav Gogate, Rina Dechter: Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. UAI 2005: 209-216

Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca: Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. UAI 2005: 217-224

Robert Mateescu, Rina Dechter: The Relationship Between AND/OR Search and Variable Elimination. UAI 2005: 380-387

Kalev Kask, Rina Dechter, Vibhav Gogate: New Look-Ahead Schemes for Constraint Satisfaction. AMAI 2004

Kalev Kask, Rina Dechter, Vibhav Gogate: Counting-Based Look-Ahead Schemes for Constraint Satisfaction. CP 2004: 317-331

Rina Dechter, Robert Mateescu: The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP 2004: 731-736

Kalev Kask, Rina Dechter, Vibhav Gogate: New Look-Ahead Schemes for Constraint Satisfaction. ISAIM 2004

Rina Dechter: Constraints and Probabilistic Networks: A Look At The Interface. LPNMR 2004: 1

Bozhena Bidyuk, Rina Dechter: On Finding Minimal w-cutset. UAI 2004: 43-50

Rina Dechter, Robert Mateescu: Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI 2004: 120-129

Vibhav Gogate, Rina Dechter: A Complete Anytime Algorithm for Treewidth. UAI 2004: 201-208

Rina Dechter: Constraint processing. Elsevier Morgan Kaufmann 2003, isbn 978-1-55860-890-0, pp. I-XX, 1-481

Rina Dechter: Guest Editorial. Constraints 8(3): 227-228 (2003)

Javier Larrosa, Rina Dechter: Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints 8(3): 303-326 (2003)

Rina Dechter, Irina Rish: Mini-buckets: A general scheme for bounded inference. J. ACM 50(2): 107-153 (2003)

Bozhena Bidyuk, Rina Dechter: Cycle-Cutset Sampling for Bayesian Networks. Canadian Conference on AI 2003: 297-312

Bozhena Bidyuk, Rina Dechter: An Empirical Study of w-Cutset Sampling for Bayesian Networks. UAI 2003: 37-46

Rina Dechter, Robert Mateescu: A Simple Insight into Iterative Belief Propagation's Success. UAI 2003: 175-183

Radu Marinescu, Kalev Kask, Rina Dechter: Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402

Rina Dechter, Daniel Frost: Backjump-based backtracking for constraint satisfaction problems. Artif. Intell. 136(2): 147-188 (2002)

Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek: Generating Random Solutions for Constraint Satisfaction Problems. AAAI/IAAI 2002: 15-21

Robert Mateescu, Rina Dechter, Kalev Kask: Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559

Rina Dechter, Kalev Kask, Robert Mateescu: Iterative Join-Graph Propagation. UAI 2002: 128-136

Rina Dechter, Richard S. Sutton (Eds.): Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada. AAAI Press / The MIT Press 2002

Rina Dechter, Yousri El Fattah: Topological parameters for time-space tradeoff. Artif. Intell. 125(1-2): 93-118 (2001)

Weixiong Zhang, Rina Dechter, Richard E. Korf: Heuristic search in artificial intelligence. Artif. Intell. 129(1-2): 1-4 (2001)

Kalev Kask, Rina Dechter: A general scheme for automatic generation of search heuristics from specification dependencies. Artif. Intell. 129(1-2): 91-131 (2001)

Rina Dechter, Kalev Kask, Javier Larrosa: A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP 2001: 346-360

Rina Dechter, David Larkin: Hybrid Processing of Beliefs and Constraints. UAI 2001: 112-119

Irina Rish, Rina Dechter: Resolution versus Search: Two Strategies for SAT. J. Autom. Reasoning 24(1/2): 225-275 (2000)

Robert Menke, Rina Dechter: An Implementation of the Combinatorial Auction Problem in ECLⁱPS^e. AAAI/IAAI 2000: 1084

Rina Dechter: A New Perspective on Algorithms for Optimizing Policies under Uncertainty. AIPS 2000: 72-81

Rina Dechter (Ed.): Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings. Lecture Notes in Computer Science 1894, Springer 2000, isbn 3-540-41053-8

Rina Dechter: Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell. 113(1-2): 41-85 (1999)

Daniel Frost, Rina Dechter: Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26(1-4): 149-170 (1999)

Zeev Collin, Rina Dechter, Shmuel Katz: Self-Stabilizing Distributed Constraint Satisfaction. Chicago J. Theor. Comput. Sci. 1999 (1999)

Kalev Kask, Rina Dechter: Branch and Bound with Mini-Bucket Heuristics. IJCAI 1999: 426-435

Kalev Kask, Rina Dechter: Mini-Bucket Heuristics for Improved Search. UAI 1999: 314-323

Daniel Frost, Rina Dechter: Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. CP 1998: 469

Irina Rish, Kalev Kask, Rina Dechter: Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. UAI 1998: 455-463

Eddie Schwalb, Rina Dechter: Processing Disjunctions in Temporal Constraint Networks. Artif. Intell. 93: 29-61 (1997)

Rina Dechter: Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. Constraints 2(1): 51-55 (1997)

Peter van Beek, Rina Dechter: Constraint tightness and looseness versus local and global consistency. J. ACM 44(4): 549-566 (1997)

Rina Dechter, Peter van Beek: Local and Global Relational Consistency. Theor. Comput. Sci. 173(1): 283-308 (1997)

Rina Dechter: Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. IJCAI 1997: 1297-1303

Arun K. Jagota, Rina Dechter: Simple distributed algorithms for the cycle cutset problem. SAC 1997: 366-373

Rina Dechter, Irina Rish: A Scheme for Approximating Probabilistic Inference. UAI 1997: 132-141

Rina Dechter, Avi Dechter: Structure-Driven Algorithms for Truth Maintenance. Artif. Intell. 82(1-2): 1-2 (1996)

Rachel Ben-Eliyahu, Rina Dechter: Default Reasoning Using Classical Logic. Artif. Intell. 84(1-2): 113-150 (1996)

Itay Meiri, Rina Dechter, Judea Pearl: Uncovering Trees in Constraint Networks. Artif. Intell. 86(2): 245-267 (1996)

Rachel Ben-Eliyahu, Rina Dechter: On Computing Minimal Models. Ann. Math. Artif. Intell. 18(1): 3-27 (1996)

Rina Dechter: Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. ACM Comput. Surv. 28(4es): 61 (1996)

Kalev Kask, Rina Dechter: A Graph-Based Method for Improving GSAT. AAAI/IAAI, Vol. 1 1996: 350-355

Daniel Frost, Rina Dechter: Looking at Full Looking Ahead. CP 1996: 539-540

Irina Rish, Rina Dechter: To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). CP 1996: 555-556

Eddie Schwalb, Rina Dechter: Processing Disjunctions of Temporal Constraints. TIME 1996: 30-35

Rina Dechter: Bucket elimination: A unifying framework for probabilistic inference. UAI 1996: 211-219

Rina Dechter: Topological parameters for time-space tradeoff. UAI 1996: 220-227

Yousri El Fattah, Rina Dechter: An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. UAI 1996: 244-251

Judea Pearl, Rina Dechter: Identifying Independencies in Causal Graphs with Feedback. UAI 1996: 420-426

Peter van Beek, Rina Dechter: On the Minimality and Decomposability of Row-Convex Constraint Networks. J. ACM 42(3): 543-561 (1995)

Gadi Pinkas, Rina Dechter: Improving Connectionist Energy Minimization. J. Artif. Intell. Res. (JAIR) 3: 223-248 (1995)

Rina Dechter, Peter van Beek: Local and Global Relational Consistency. CP 1995: 240-257

Daniel Frost, Rina Dechter: Look-Ahead Value Ordering for Constraint Satisfaction Problems. IJCAI (1) 1995: 572-578

Kalev Kask, Rina Dechter: GSAT and Local Consistency. IJCAI (1) 1995: 616-623

Yousri El Fattah, Rina Dechter: Diagnosing Tree-Decomposable Circuits. IJCAI 1995: 1742-1749

Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang: Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032

Rina Dechter, Itay Meiri: Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. Artif. Intell. 68(2): 211-241 (1994)

Rachel Ben-Eliyahu, Rina Dechter: Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell. 12(1-2): 53-87 (1994)

Daniel Frost, Rina Dechter: Dead-End Driven Learning. AAAI 1994: 294-300

Daniel Frost, Rina Dechter: In Search of the Best Constraint Satisfaction Search. AAAI 1994: 301-306

Eddie Schwalb, Kalev Kask, Rina Dechter: Temporal Reasoning with Constraints on Fluents and Events. AAAI 1994: 1067-1072

Rina Dechter, Irina Rish: Directional Resolution: The Davis-Putnam Procedure, Revisited. KR 1994: 134-145

Peter van Beek, Rina Dechter: Constraint Tightness versus Global Consistency. KR 1994: 572-582

Rachel Ben-Eliyahu, Rina Dechter: On Computing Minimal Models. AAAI 1993: 2-8

Eddie Schwalb, Rina Dechter: Coping With Disjunctions in Temporal Constraint Satisfaction Problems. AAAI 1993: 127-132

Rina Dechter: From Local to Global Consistency. Artif. Intell. 55(1): 87-108 (1992)

Rina Dechter, Judea Pearl: Structure Identification in Relational Data. Artif. Intell. 58(1-3): 237-270 (1992)

Gadi Pinkas, Rina Dechter: An Improved Connectionist Activation Function for Energy Minimization. AAAI 1992: 434-439

Rachel Ben-Eliyahu, Rina Dechter: Propositional Sematics for Disjunctive Logic Programs. JICSLP 1992: 813-827

Rina Dechter, Itay Meiri, Judea Pearl: Temporal Constraint Networks. Artif. Intell. 49(1-3): 61-95 (1991)

Rachel Ben-Eliyahu, Rina Dechter: Default Logic, Propositional Logic, and Constraints. AAAI 1991: 379-385

Zeev Collin, Rina Dechter, Shmuel Katz: On the Feasibility of Distributed Constraint Satisfaction. IJCAI 1991: 318-324

Rina Dechter, Judea Pearl: Directed Constraint Networks: A Relational Framework for Causal Modeling. IJCAI 1991: 1164-1170

Rina Dechter: Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artif. Intell. 41(3): 273-312 (1990)

Rina Dechter: Decomposing a Relation into a Tree of Binary Relations. J. Comput. Syst. Sci. 41(1): 2-24 (1990)

Itay Meiri, Judea Pearl, Rina Dechter: Tree Decomposition with Applications to Constraint Processing. AAAI 1990: 10-16

Rina Dechter: On the Expressiveness of Networks with Hidden Variables. AAAI 1990: 556-562

Rina Dechter, Judea Pearl: Tree Clustering for Constraint Networks. Artif. Intell. 38(3): 353-366 (1989)

Avi Dechter, Rina Dechter: On the Greedy Solution of Ordering Problems. INFORMS Journal on Computing 1(3): 181-189 (1989)

Judea Pearl, Rina Dechter: Learning Structure from Data: A Survey. COLT 1989: 230-244

Rina Dechter, Itay Meiri: Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. IJCAI 1989: 271-277

Rina Dechter, Itay Meiri, Judea Pearl: Temporal Constraint Networks. KR 1989: 83-93

Rina Dechter, Avi Dechter: Belief Maintenance in Dynamic Constraint Networks. AAAI 1988: 37-42

Rina Dechter, Judea Pearl: Tree-Clustering Schemes for Constraint-Processing. AAAI 1988: 150-154

Rina Dechter, Judea Pearl: Network-Based Heuristics for Constraint-Satisfaction Problems. Artif. Intell. 34(1): 1-38 (1987)

Avi Dechter, Rina Dechter: Removing Redundancies in Constraint Networks. AAAI 1987: 105-109

Rina Dechter: Decomposing an N-ary Relation into a Tree of Binary Relations. PODS 1987: 185-189

Rina Dechter, Leonard Kleinrock: Broadcast Communications and Distributed Algorithms. IEEE Trans. Computers 35(3): 210-219 (1986)

Rina Dechter: Learning While Searching in Constraint-Satisfaction-Problems. AAAI 1986: 178-185

Rina Dechter, Judea Pearl: Generalized Best-First Search Strategies and the Optimality of A*. J. ACM 32(3): 505-536 (1985)

Rina Dechter, Judea Pearl: The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. IJCAI 1985: 1066-1072

Rina Dechter, Judea Pearl: The Optimality of A* Revisited. AAAI 1983: 95-99

Nam Huyn, Rina Dechter, Judea Pearl: Probabilistic Analysis of the Complexity of A^*. Artif. Intell. 15(3): 241-254 (1980)