[R162] Abstract | PDF
Radu Marinescu and Rina Dechter. "Advancing AND/OR Search for Optimization Using Diverse Principles." In Workshop on Inference Methods based on Graphical Structures of Knowledge of the European Conference on Artificial Intelligence (ECAI), 2008.
Longer version: [R162a] Abstract | PDF

[R161] Abstract | PDF
Vibhav Gogate and Rina Dechter. "Approximate Solution Sampling (and Counting) on AND/OR spaces" In CP'08 (To appear).
Longer version: [R161a] Abstract | PDF

[R160] Abstract | PDF
Lars Otten and Rina Dechter. "Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems." In CP'08.
Longer version: [R160a] Abstract | PDF

[R159] Abstract | PDF
Robert Mateescu and Rina Dechter. "Mixed deterministic and probabilistic networks". ICS Technical Report (Submitted), May 2008.

[R158] Abstract | PDF
Radu Marinescu. "AND/OR Search Strategies for Combinatorial Optimization in Graphical Models." Ph.D. Thesis, 2008.

[R157] Abstract | PDF
Rina Dechter, Lars Otten, and Radu Marinescu. "On the Practical Significance of Hypertree vs. Tree Width." In ECAI'08.
Longer version: [R157a] Abstract | PDF

[R156] Abstract | PDF
Vibhav Gogate and Rina Dechter. "AND/OR Importance Sampling." In UAI'08 (To appear).

[R155] Abstract | PDF
Lars Otten and Rina Dechter. "Bounding Search Space Size via (Hyper)tree Decompositions." In UAI'08.

[R154] Abstract | PDF
Radu Marinescu and Rina Dechter. "Evaluating the Impact of AND/OR Search on 0-1 Integer Linear Programming." ICS Technical Report (Submitted), May 2008.

[R153] Abstract | PDF
Radu Marinescu and Rina Dechter. "Memory Intensive AND/OR Search for Combinatorial Optimization in Graphical Models." ICS Technical Report (Submitted), April 2008.

[R152] Abstract | PDF
Vibhav Gogate and Rina Dechter. "Studies in Solution Sampling" In AAAI'08 (To appear).

[R151] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Branch-and-Bound Search for Combinatorial Optimization in Graphical Models." ICS Technical Report (Submitted), April 2008.

[R150] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "An Anytime Scheme for Bounding Posterior Beliefs". ICS Technical Report (Submitted), March 2008.

[R149] Abstract | PDF
Robert Mateescu, Rina Dechter and Radu Marinescu. "AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models". Forthcoming, Journal of Artificial Intelligence Research (JAIR), 2008.

[R147] Abstract | PDF
Robert Mateescu. "AND/OR Search Spaces for Graphical Models". Ph.D. Thesis, 2007.

[R146] Abstract | PDF
Robert Mateescu and Rina Dechter. "AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models". In UAI'07.

[R145] Abstract | PDF
Vibhav Gogate, Bozhena Bidyuk and Rina Dechter. "Studies in Lower Bounding Probability of Evidence using the Markov Inequality". In UAI'07.

[R144] Abstract | PDF
Radu Marinescu and Rina Dechter. "Best-First AND/OR Search for Most Probable Explanations". In UAI'07.

[R143] Abstract | PDF
Radu Marinescu and Rina Dechter. "Best-First AND/OR Search for Graphical Models". In AAAI'07.

[R142] Abstract | PDF
Vibhav Gogate and Rina Dechter. "Approximate Counting by Sampling the Backtrack-free Search Space". In AAAI'07.

[R141] Abstract | PDF
Vibhav Gogate and Rina Dechter. "SampleSearch: A Scheme that Searches for Consistent Samples". In AISTATS'07.

[R140] Abstract | PDF
Radu Marinescu and Rina Dechter. "Best-first AND/OR Search for 0/1 Integer Programming". In CPAIOR'07. To appear

[R139] PDF
Rina Dechter. "Tractable Structures for Constraint Satisfaction Problems". Chapter in the "Handbook of Constraint Programming". F. Rossi, T. Walsh and P. van Beek, editors. Elsevier, 2006.

[R138] Abstract | PDF
Robert Mateescu and Rina Dechter. "A Comparison of Time-Space Schemes for Graphical Models". In IJCAI'07.

[R137] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "Cutset Sampling for Bayesian Networks". In JAIR, 2006.

[R136] Abstract | PDF
Vibhav Gogate and Rina Dechter. "A New Algorithm for Sampling CSP Solutions Uniformly at Random". In CP'06.
Longer version: [R136a] Abstract | PDF

[R135] Abstract | PDF
Robert Mateescu and Rina Dechter. "Compiling Constraint Networks into AND/OR Multi-Valued Decision Diagrams (AOMDDs)". In CP'06.

[R134] Abstract | PDF
Bozhena Bidyuk. "Exploiting Graph Cutsets for Sampling-Based Approximations in Bayesian Networks". Ph.D. Thesis, 2006

[R133] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "Cutset Sampling with Likelihood Weighting". In UAI'06.

[R132] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "Improving Bound Propagation". In ECAI'06.

[R131] Abstract | PDF
Radu Marinescu and Rina Dechter. "Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models". In ECAI'06.

[R130] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "An Anytime Scheme for Bounding Posterior Beliefs". In AAAI'06.
Longer version: [R130a] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "An Anytime Scheme for Bounding Posterior Belief". Extended version, ICS Technical Report, January 2006.

[R129] Abstract | PDF
Radu Marinescu and Rina Dechter. "Memory Intensive Branch-and-Bound Search for Graphical Models". In AAAI'06.

[R128] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Graph Search for Genetic Linkage Analysis". In Workshop on Heuristic Search, Memory Based Heuristics and Their Applications, AAAI'06.
Longer version: [R128a] Abstract | PDF

[R127] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems". In CPAIOR 2006.

[R126] Abstract | PDF
Rina Dechter and Robert Mateescu. "AND/OR Search Spaces for Graphical Models". Artificial Intelligence 171 (2-3), pp. 73-106, 2006.

[R125] Abstract | PDF
Radu Marinescu and Rina Dechter. "Advances in AND/OR Branch-and-Bound Search for Constraint Optimization". In The 7th International Workshop on Preferences and Soft Constraints of the Eleventh International Conference on Principles and Practice of Constraint Programming , CP'2005.

[R124] Abstract | PDF
Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt and James Marca. "Modeling Transportation Routines using Hybrid Dynamic Mixed Networks". In UAI 2005.

[R123] Abstract | PDF
Vibhav Gogate and Rina Dechter. "Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints". In UAI 2005.

[R122] Abstract | PDF
Robert Mateescu and Rina Dechter. "The Relationship Between AND/OR Search Spaces and Variable Elimination". In UAI 2005.

[R121] Abstract | PDF
Robert Mateescu and Rina Dechter. "AND/OR Cutset Conditioning". In proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI'2005.

[R120] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Branch-and-Bound for Graphical Models". In proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI'2005.

[R109] Abstract | PDF
Kalev Kask, Rina Dechter, Javier Larrosa and Avi Dechter. "Unifying Cluster-Tree Decompositions for Reasoning in Graphical Models". In Artificial Intelligence Journal, 2005.

[R119] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Tree Search for Constraint Optimization". In the 6th International Workshop on Preferences and Soft Constraints, of the Tenth International Conference on Principles and Practice of Constraint Programming , CP'2004.

[R118] Abstract | PDF
Kalev Kask, Rina Dechter, and Vibhav Gogate. "Counting-Based Look-Ahead Schemes for Constraint Satisfaction". In Constraint Programming, CP'2004.

[R117] Abstract | PDF
Rina Dechter and Robert Mateescu. "The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting". In Constraint Programming, CP'2004.
Longer version: [R117a] Abstract | PDF

[R116] Abstract | PDF
Bozhena Bidyuk. "Approximation Algorithms for Probabilistic Reasoning: Sampling and Iterative Inference". Ph.D. Proposal, May 2004.

[R115] Abstract | PDF
Rina Dechter."AND/OR Search Spaces for Graphical Models". ICS Technical Report, March, 2004.

[R114] Abstract | PDF
Rina Dechter and Robert Mateescu. "Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space". In UAI 2004.

[R113] Abstract | PDF
Bozhena Bidyuk and Rina Dechter. "On finding minimal w-cutset problem". In UAI 2004.

[R112] Abstract | PDF
Vibhav Gogate and Rina Dechter. "A Complete Anytime Algorithm for Treewidth". In UAI 2004.

[R111] Abstract | PDF
Kalev Kask, Rina Dechter and Vibhav Gogate. "New Look-Ahead Schemes for Constraint Satisfaction". In The Eighth International Symposium on Artificial Intelligence and Mathematics, 2004.

[R110] Abstract | PDF
Robert Mateescu. "Iterative Algorithms for Graphical Models". Ph.D. Proposal, June 2003.

[R108] Abstract | PDF
David Larkin. "Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries". In UAI 2003.

[R107] Abstract | PDF
David Larkin. "Semi-Independent Partitioning: A Method for Approximating the Solution to Constraint Optimization Problems". In CP2003.

[R106] Abstract | PDF
Rina Dechter, and Robert Mateescu. "A Simple Insight Into Properties Of Iterative Belief Propagation". In UAI 2003.

[R105] Abstract | PDF
Bozhena Bidyuk, and Rina Dechter. "An Empirical Study of w-Cutset Sampling for Bayesian Networks". In UAI 2003

[R104] Abstract | PDF
Radu Marinescu, Kalev Kask, and Rina Dechter. "Systematic vs. Non-systematic Algorithms for Solving the MPE Task". In UAI 2003.

[R103] Abstract | PostScript | PDF
David Larkin. "Generating Random Solutions from a Constraint Satisfaction Problem with Controlled Probability", In the 1st International Workshop on Constraints in Functional Verification of Principles and Practice of Constraint Programming (CP 2002).

[R102] Abstract | PostScript | PDF
Bozhena Bidyuk, and Rina Dechter. "Cycle-Cutset sampling for Bayesian Networks", In The Canadian AI Conference, June 2003.

[R101] Abstract | PostScript | PDF
Rina Dechter, Kalev Kask and Robert Mateescu. "Iterative Join-Graph Propagation", In proceedings of Uncertainty in Artificial Intelligence (UAI 2002), pp. 128-136.

[R100] Abstract | PostScript | PDF
David Larkin and Rina Dechter. "Bayesian Inference in the Presence of Determinism", In AI and Statistics, AI-STAT, 2003.

[R99] Abstract | PostScript | PDF
Robert Mateescu, Rina Dechter, Kalev Kask. "Tree Approximation for Belief Updating", In proceedings of AAAI-2002.

[R98] Abstract | PostScript | PDF
Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek. "Generating Random Solutions for Constraint Satisfaction Problems", In proceedings of AAAI-2002.

[R97] Abstract | PostScript | PDF
Bozhena Bidyuk, Rina Dechter. "The Epsilon-cutset Effect in Bayesian Networks", An ICS Technical Report, July, 2001.
Longer version: [R97a] PostScript | PDF

[R96] Abstract | PostScript | PDF
R. Dechter, D. Larkin, "Hybrid Processing of Beliefs and Constraints", In proceedings of UAI '01.
Longer version: [R96a] PostScript | PDF

[R95] Abstract | PostScript | PDF
R. Dechter, K. Kask, J. Larrosa, "A General Scheme for Multiple Lower Bound Computation in Constraint Optimization", Appears in Constraint Programming (CP2001).
Longer version: [R95a] PostScript | PDF

[R94] Abstract | PostScript | PDF
K. Kask, R. Dechter, "A General Scheme for Automatic Generation of Search Heuristics from Specification Dependencies", In Artificial Intelligence 129:91-131, 2001.

[R93] Abstract | PostScript | PDF
J. Larrosa, "On the Time Complexity of Bucket Elimination Algorithms", An ICS technical report, January, 2001.

[R92] Abstract | PostScript | PDF
K. Kask, R. Dechter, J. Larrosa and F. Cozman, "Bucket-Tree Elimination for Automated Reasoning", ICS Technical Report.
Longer version: [R92a] Abstract | PostScript | PDF

[R91] Abstract | PostScript | PDF
K. Kask, J. Larrosa, R. Dechter, "Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks" Technical Report, January, 2001.

[R90] Abstract | PostScript | PDF
J. Larrosa, R. Dechter, "On The Duel Representation of Non-Binary Semiring-Based CSPs" In workshop 1 (Soft Constraints) of the "Sixth International Conference on Principles and Practice of Constraint Programming" (CP2000), September, 2000.

[R89] Abstract | PostScript | PDF
J. Larrosa, "Boosting Search With Variable Elimination" In the proceedings of the "Sixth International Conference on Principles and Practice of Constraint Programming" (CP2000), September, 2000."
Longer version: [89a] Abstract | PostScript | PDF

[R88] Abstract | PostScript | PDF
R. Menke, R. Dechter, "An Implementation of the Combinatorial Auction Problem in ECLIPSE" An ICS Technical Report, July, 2000

[R87] Abstract | PostScript | PDF
K. Kask. "New Search Heuristics For Max-CSP" In the proceedings of the "Sixth International Conference on Principles and Practice of Constraint Programming" (CP2000), September, 2000, pp.255-269

[R87a] Abstract | PostScript | PDF
K. Kask, R. Dechter "Using Mini-Bucket Heuristics For Max-CSP" An ICS Technical Report, June, 2000
Longer version: [R86] Abstract | PostScript | PDF

[R85] Abstract | PostScript | PDF
Dechter, R., Rossi, F., "Constraint Satisfaction" Survey ECS, March, 2000.

[R84] Abstract | PostScript | PDF
Dechter, R. "An Anytime Approximation For Optimizing Policies Under Uncertainty" In workshop of Decision Theoretic Planning, "AIPS2000", April, 2000.

[R83] Abstract | PostScript | PDF
Dechter, R., Smyth, P. "Processing Boolean Queries Over Belief Networks" An ICS Technical report.

[R82] Abstract | PostScript | PDF
Dechter, R., "A New Perspective on Algorithims for Optimizing Policies Under Uncertainty" In "AI and Planning" (AIPS2000) April, 2000. Technical Reports (AIPS-2000)".

[R81] Abstract | PostScript | PDF
Rish, I. "Efficient Reasoning in Graphical Models" Ph.D. Thesis, 1999

[R80] Abstract | PostScript | PDF
Rish, I., and Dechter, R., "Resolution versus Search: Two Strategies for SAT" In "Journal of Automated Reasoning", special issue on SAT, Volume 24, Issue 1/2, pp. 225-275, Januray, 2000.

[R79] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Mini-Bucket Heuristics for Improved Search" In proceedings of "Uncertainty in AI", February, 1999.

[R78] Abstract | PostScript | PDF
Students of 275B Fall Quarter 1998, "Empirical Evaluations of Some Benchmark Bayesian Networks"

[R77] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Branch and Bound with Mini-Bucket Heuristics" In "International Joint Conference on Artificial Intelligence" (IJCAI99), pp. 426­433, Stockholm, August 1999.

[R76] Abstract | PostScript | PDF
Shapiro, R., Feldman, Y. A., and Dechter, R., "On the Complexity of Interval-Based Constraint Networks" In "MISC'99 Workshop on Applications of Interval Analysis to Systems and Control", February, 1999 pp. 389-399.

[R75] Abstract | PostScript | PDF
Schwalb, E., "Temporal Reasoning With Constraints" A Ph.D. thesis, UCI, ICS, June 1998.

[R74] Abstract | PostScript | PDF
D. Frost and R. Dechter, "Evaluating Constraint Processing Algorithms" In Workshop on Combinatorial Search and Planning of the Fourth International Conference on Artificial Intelligence, In "Artificial Intelligence Planning Systems" (AIPS '98), Carnegie Mellon University, June 7-10, 1998

[R73]
Dechter, R. and the Constraint Programming Workgroup, "Constraint Programming" In "Constraints Journal", 1997.

[R72] Abstract | PostScript | PDF
K. Kask and R. Dechter, "Stochastic Local Search For Bayesian Networks" In Workshop on "AI and Statistics 99", D. Heckerman and J. Whittaker Ed. Morgan Kaufmann Publishers, pp 113­122, January 1999.

[R71] Abstract | PostScript | PDF
Rish, I., Kask, K., and R. Dechter, "Empirical Evaluation Of Approximation Algorithms For Probabilistic Decoding" In "Uncertainty in AI" (UAI98).

[R70] Abstract | PostScript | PDF
Dechter, R., and D. Frost, "Optimizing With Constraints: A Case Study In Scheduling Maintenance Of Electric Power Units" In the "Fifth International Symposium on Artificial Intelligence and Mathematics", January, 1998.
Longer version: [R70a] Abstract | PostScript | PDF,
Alternate version: [R70b] Abstract | PostScript | PDF,

[R69] Abstract | PostScript | PDF
Frost, D., "Algorithms And Heuristics For Constraint Satisfaction Problems" A Ph.D. thesis, ICS, UCI, October 1997.

[R68] Abstract | PostScript | PDF
Dechter, R., "Constraint Satisfaction" In the "MIT Encyclopedia of the Cognitive Sciences" (MITECS), 1998.

[R67] Abstract | PostScript | PDF
Dechter, R., and I. Rish, "On The Impact Of Causal Independence" An ICS Technical Report, October 1998.

[R66] Abstract | PostScript | PDF
E. Schwalb, L. Vila "Temporal Constraints: A Survey" An ICS Technical Report, October 1997.

[R65]
Rish, I., and Frost, D., "Statistical Analysis Of Backtracking OnInconsistent CSPs" In proceedings of "Constraint Programming (CP97), October 29 - November 1, 1997, Schloss Hagenberg, Austria.

[R64] Abstract | PostScript | PDF
Dechter, R., "Bucket Elimination: A Unifying Framework For Processing Hard And Soft Constraints" In "Constraints: An International Journal", No. 2, pp. 51-55, 1997.

[R63] Abstract | PostScript | PDF
Dechter, R., and Rish, I., "A Scheme For Approximating Probabilistic Inference" In "Uncertainty in Artificial Intelligence" (UAI97), August 1997.

[R62] Abstract | PostScript | PDF
Dechter, R., "Mini-Buckets: A General Scheme For Generating Approximations In Automated Reasoning" In "Fifteenth International Joint Conference of Artificial Intelligence" (IJCAI97), Japan, 1997. An extended version.
Longer version: [R62a] Abstract | PostScript | PDF

[R61]
Dechter, R., Vila, L., and Schwalb, E., "Temporal Constraint Logic Programming" An ICS Technical Report.

[R60]
Schwalb, E., "Temporal Reasoning With Resolution And Constraint Propagation" in AAAI '97

[R59]
Frost, D., Rish, I., and Vila, L., "Summarizing CSP Hardness With Continuous Probability Distributions" An ICS Technical Report.

[R58]
Frost, D., Dechter, R., "Full Looking Ahead For Constraint Satisfaction Problems" An ICS Technical Report.

[R57]
Dechter, R., Vila, L., and Schwalb, E., "Decidability And Finite Representability Of Deductive Databases With Temporal Constraints" An ICS Technical Report.

[R56] Abstract | PostScript | PDF
Dechter R. and Frost, D., "Backjump-based Backtracking for Constraint Satisfaction Problems", in Artificial Intelligence.

[R54] Abstract | PostScript | PDF
Rish, I., Dechter, R., "Finding A Balance Between Guessing and Thinking: Combining Conditioning with Variable Elimination" (A Ph.D. proposal), August 14, 1996.

[R53]
Abstract | PostScript | PDF
Frost, D., and Dechter, R., "Looking At Full Look-Ahead" In "International Conference on Constraint Programming" (CP96), Boston, September 1996.

[R52] Abstract | PostScript | PDF
Dechter, R., and Dechter, A., "Structure Driven Algorithms For Truth Maintenance" In the "Artificial Intelligence Journal", Volume 82, 1996, pp. 1-20.

[R51] Abstract | PostScript | PDF
Pearl, J., and Dechter, R., "Identifying Independencies In Causal Graphs With Feedback" In "Uncertainty in Artificial Intelligence", UA196, Portland, Oregon, August 1996, pp. 420-426.

[R50] Dechter, R., "Constraint-Based Computing; A Position Paper" For "ACM Strategic Direction", June 1996.

[R49] Abstract | PostScript | PDF
Rish, I., and Dechter, R., "To Guess Or To Think? Hybrid Algorithms For SAT" In "International Conference on Constraint Programming" (CP96), Boston, Massachusetts, September 1996.
Longer version: [R49a] Abstract | PostScript | PDF

[R48] Abstract | PostScript | PDF
R. Dechter, "Bucket Elimination: A Unifying Framework for Probabilistic Inference" In "Uncertainty in Artificial Intelligence", UA196, 1996, pp. 211-219.
Longer version:[R48a] Abstract | PostScript | PDF,
Alternate version: [R48b] PostScript | PDF

[R47] Abstract | PostScript | PDF
El Fattah, Y., and Dechter, R., "An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits." In "Uncertainty in Artificial Intelligence", UA196, Portland, Oregon, August 1996 pp. 244-251.

[R46] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "Graph-based methods for improving GSAT." In proceedings of "National Conference of Artificial Intelligence" (AAAI-96), Portland, Oregon, August 1996.

[R45] Abstract | PostScript | PDF
C. Freuder, R. Dechter, B. Selman, M. Ginsberg, and E. Tsang, "Systematic versus stochastic constraint satisfaction" Panel, IJCAI-95, pp.2027-2032.

[R44] Abstract | PostScript | PDF
Dechter, R., "Topological parameters for time-space tradeoff." In "Uncertainty in Artificial Intelligence" (UA196), Portland, Oregon, August 1996 pp. 220-227.
Longer version: [R44a] Abstract | PostScript | PDF

[R43] Thimor, D., "GSAT vs. LVO vs. DVO experimental report." A Technical Report.

[R42] Abstract | PostScript | PDF
I. Rish, and R. Dechter, "Variable Independence In Markov Decision Problems" A Technical Report.
Longer version: [R42a] Abstract | PostScript | PDF

[R41] Abstract | PostScript | PDF
Dechter, R., and van Beek, P., "Local and global relational consistency." In "Journal of Theoretical Computer Science", 1996.
Longer version: [R41a] Abstract | PostScript | PDF

[R40] Abstract | PostScript | PDF
Schwalb, E., and Dechter, R., "Processing Disjunctions in Temporal Constraint Networks." In "Artificial Intelligence", volume 93, pp. 29-61, 1997.

[R39] Abstract | PostScript | PDF
Frost, D., and Dechter, R., "Look-ahead value ordering for constraint satisfaction problems." In "International Joint Conference on Artificial Intelligence" (IJCAI-95), Montreal, Canada, August 1995, pp. 572-578.

[R38] Abstract | PostScript | PDF
Schwalb, E., Kask, K., and Dechter, R., "Temporal Reasoning With Constraints On Fluents And Event." In The Twelfth National Conference of Artificial Intelligence" (AAAI-94), Seattle, WA, August 1994, pp. 1067-1072.

[R37] Schwalb, E., Pazzani, M., and Dechter, R., "Using Identifiability for learning horn logic programs." Machine Learning Workshop, Canada.
Longer version: [R37a] Also appears as a UCI Technical Report #94-13.

[R36] Abstract | PostScript | PDF
van Beek, P., and Dechter, R., "Constraint Restrictiveness Versus Local and Global Consistency." In "Journal of the Association of Computing Memory".
Longer version: [R36a] "Constraint Tightness and Looseness Versus Local and Global Consistency." In "Principles of Knowledge Representation and Reasoning" (KR-94), Bonn, Germany, May 1994, pp. 572-582.

[R35] Abstract | PostScript | PDF
Frost, D., and Dechter, R., "Dead-End Driven Learning." In Proceedings of the "Twelfth National Conference of Artificial Intelligence" (AAAI-94), Seattle, WA, August 1994, pp. 294-300.
Longer version: [R35a] Abstract | PostScript | PDF
"In Search Of The Best Constraint Satisfaction Search." In Proceedings of the "Twelfth National Conference of Artificial Intelligence" (AAAI-94), Seattle, WA, August 1994, pp. 301-306.

[R34] Abstract | PostScript | PDF
Kask, K., and Dechter, R., "GSAT and Local Consistency." In "International Joint Conference on Artificial Intelligence" (IJCAI-95), Montreal, Canada, August 1995, pp. 616-622.

[R33] Abstract | PostScript | PDF
van Beek, P., and Dechter, R., "On The Minimality And Global Consistency Of Row-Convex Constraint Networks." Journal of the ACM, Vol. 42, No. 3, May 1995, pp. 543-561.

[R32] Abstract | PostScript | PDF
Schwalb, E., and Dechter, R., "Compiling Relational Data Into Disjunctive Structure: Empirical Evaluation." In AI/GI/VI-94, Banff, Alberta, Canada, May 1994, pp. 71-78.

[R31] Dechter, R., and Dechter, A., "On the representation of general constraint networks." November, 1992.

[R30] Abstract | PostScript | PDF
Schwalb, E., and Dechter, R., "Coping With Disjunctions In Temporal Constraint Satisfaction Problems." In "The National Conference on Artificial Intelligence" (AAAI-93), Washington, D.C., July 1993, pp. 127-132.

[R29] Abstract | PostScript |
Dechter, R., and Rish, I., "Directional Resolution: The Davis Putnam Procedure, Revisited." In Principles of Knowledge Representation (KR-94), Bonn, Germany, May 1994, pp. 134-145.
Longer version: [R29a] Abstract | PostScript | PDF

[R28] Abstract | PostScript | PDF
Ben-Eliyahu, R., and Dechter, R., "On Computing Minimal Models." In the "Journal of Annals of Mathematics and Artificial Intelligence", 1995.
Longer version: [R28a] A preliminary version in "The National Conference on Artificial Intelligence", AAAI-93, Washington, D.C.,July 1993, pp. 2-8.

[R27] Abstract | PostScript | PDF
El Fattah, Y., and Dechter, R., "Diagnosing Tree-Decomposable Circuits." In "International Joint Conference on Artificial Intelligence", IJCAI-95, Montreal, Canada, August 1995, pp. 572-578.

[R26] Abstract | PostScript | PDF
Ben-Eliyahu, R., and Dechter, R., "Default Reasoning Using Classical Logic" In "Artificial Intelligence", Vol. 84, 1996, pp. 113-150.
Longer version: [R26a] Abstract | PostScript | PDF

[R25] Abstract | PostScript | PDF
Ben-Eliyahu, R., and Dechter, R., "Propositional Semantics for Disjunctive Logic Programs." In the "Journal of Annals of Mathematics and Artificial Intelligence", Vol. 12, 1994, pp. 53-87.

[R24] Abstract | PostScript | PDF
Pinkas, G., and Dechter, R., "On Improving Connectionist Energy Minimization." In "Journal of Artificial Intelligence Research" (JAIR), Vol. 3, 1995, pp. 223-248.
Longer version: [R24a] "An improved connectionist activation function for energy minimization." In "The National Conference on Artificial Intelligence", San Jose, CA, July 1992, pp. 434-439.

[R23] Abstract | PostScript | PDF
Dechter, R., and Itai, A., "Finding All Solutions If You Can Find One." Presented in the Workshop on Tractable Reasoning (AAAI-92), San Jose, CA, July 1992, pp. 35-39.

[R22] Dechter, R., and Pearl, J., "Structure identification in relational data." In Artificial Intelligence, Vol. 58, 1992, pp. 237-270.
Longer version: [R22a] A preliminary version in the Canadian Artificial Intelligence Conference, May 1992, Vancouver, British Columbia, pp. 176-182.

[R21] Baram, Y., and Dechter, R., "Processing constraints by neural networks."

[R20] Pearl, J., and Dechter, R., "Learning structure from data: A survey." In Proceedings of the Workshop on Computational Learning Theory (COLT'89), Santa Cruz, CA, July 1989, pp. 230-244.

[R19] Abstract | PostScript | PDF
Meiri, I., "Combining qualitative and quantitative constraints in temporal reasoning." In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), Anaheim, California, July 1991, pp. 1-8.

[R18] Dechter, R., and Pearl, J., "Directed constraint networks: A relational framework for causal modeling." In Proceedings of the Twelfth International Joint Conference of Artificial Intelligence [IJCAI-91], Sydney, Australia, August 1991, pp. 1164-1170.

[R17] Abstract | PostScript | PDF
Dechter, R., "Constraint Networks (Survey)." In Encyclopedia of Artificial Intelligence, 2nd edition, 1992, John Wiley & Sons, Inc., pp. 276-285.

[R16] Cohen, S., and Dechter, R., "Evaluating production systems in a multiprocessing environment." In Y.A. Feldman and A. Bruckstein (Eds.), Artificial Intelligence and Computer Vision, Elsevier Science Publishers (North Holland), 1991, pp. 285-300.

[R15] Abstract | PostScript | PDF
Collin, Z., Dechter, R., and Katz, S., "On the feasibility of distributed constraint satisfaction." In Proceedings of the Twelfth International Joint Conference of Artificial Intelligence (IJCAI-91), 1991.
Longer version: [R15a] Abstract | PostScript | PDF

[R14] PDF
Dechter, R., "From local to global consistency." In Artificial Intelligence Journal, Vol. 55, 1992, pp. 87-107.
Longer version: [R14a] A preliminary version in Proceedings of the 8th CSCSI (Canadian AI Conference), Ottawa, Canada, May 1990, (best paper award), pp. 231-237.

[R13] PDF
Dechter, R., "On the expressiveness of networks with hidden variables." In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), July 1990, Boston, MA, pp. 556-562.

[R12] Abstract | PostScript | PDF
Meiri, I., Dechter, R., and Pearl, J., "Uncovering trees in constraint networks." In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-1990), pp. 10-16, July 1990, Boston, MA.
Longer version: [R12a] Abstract | PDF

[R11] Dechter, R., and Meiri, I., "Experimental evaluation of preprocessing algorithms for constraint satisfaction problems" Artificial Intelligence Journal, Vol. 68(2), 1994, pp. 211-241.
Longer version: [R11a] A preliminary version appears in Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-89), Detroit, MI, August 1989, pp. 271-277.

[R10] PDF
Dechter, R., Meiri, I., and Pearl, J., "Temporal constraint networks." Artificial Intelligence, Vol. 49, 1991, pp. 61-95.
Longer version: [R10a] A preliminary version appears in Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, May 1989, pp. 83-93.

[R9] Dechter, R., "Decomposing a relation into a tree of binary relations." Journal of Computer and System Sciences, Special Issue on the Theory of Relational Databases, Vol. 41, 1990, pp. 2-24.
Longer version: [R9a] A preliminary version appears in Proceedings of the 6th Conference on Principles of Database Systems, San Diego, CA, March 1987, pp. 185-189.

[R8] Dechter, R., "Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition." Artificial Intelligence, Vol. 41(3), January 1990, pp.273-312.

[R7] Dechter, R., Dechter, A., and Pearl, J., "Optimization in constraint networks." In R.M. Oliver and J.Q. Smith (Eds.), Influence Diagrams, Belief Nets and Decision Analysis, Sussex, England, John Wiley & Sons, Ltd., 1990, pp. 411-425.

[R6] PDF
Dechter, R., and Pearl, J., "Tree Clustering schemes for constraint-processing." Artificial Intelligence, Vol. 38(3), April 1989, pp. 353-366.
Longer version: [R6a] Appears in Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), St. Paul, MN, 1988, pp. 150-154.

[R5] PDF
A. Dechter and R. Dechter, "Belief Maintenance in dynamic constraint networks." In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), St. Paul, MN, August 1988, pp. 37-42. (A full extended version appears in R52)    
Longer version: [R5a] PDF
Longer version: [R5b] Dechter, R., "A distributed algorithm for ATMS." In Bar-Ilan Symposium on Foundation of AI (BISFAI-89), June 1989.

[R4] PDF
Dechter, A., and Dechter, R., "On the greedy solution of ordering problems." ORSA Journal on Computing , Vol. 1(3), Summer 1989, pp. 181-189.

[R3] PDF
Dechter R., and Pearl, J., "Network-based heuristics for constraint-satisfaction problems." In Artificial Intelligence, Vol. 34 (1), December 1987, pp. 1-38.
Longer version: [R3a] Appears in Search in AI , Springer-Verlag, 1988, pp. 370-422, L. Kanal and V. Kumar (Eds.).

[R2] A. Dechter and R. Dechter, "Minimal Constraint Graphs," Technical Report CSD-870007(R-74). UCLA, Cognitive Systems Laboratory, December 1986.
Longer version: [R2a] "Removing redundancies in constraint networks." In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87), Seattle, WA, July 1987, pp. 105-109.

[R1] Dechter, R., and Michie, D., "Structured induction of plans and programs." Lab Report , IBM Scientific Center, Los Angeles, CA, October 1984.

[R0] Dechter, R., and Pearl, J., "Generalized Best-First Search Strategies and the Optimality of A*." Journal of the Association for Computing Machinery , Vol. 32, No. 3, July 1985, pp. 505-536.