Rina Dechter

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

AND/OR Search Spaces and the Semantic Width of Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.

[BibT_eX]

[DOI]

Radu Marinescu

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

A Complete Anytime Algorithm for Treewidth.

[BibT_eX]

[DOI]

Vibhav Gogate

Proceedings of the UAI '04, 2004

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space.

[BibT_eX]

[DOI]

Proceedings of the UAI '04, 2004

On Finding Minimal w-cutset.

[BibT_eX]

[DOI]

Bozhena Bidyuk

Proceedings of the UAI '04, 2004

Constraints and Probabilistic Networks: A Look At The Interface.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

New Look-Ahead Schemes for Constraint Satisfaction.

[BibT_eX]

[DOI]

Vibhav Gogate

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

Counting-Based Look-Ahead Schemes for Constraint Satisfaction.

[BibT_eX]

[DOI]

Vibhav Gogate

Proceedings of the Principles and Practice of Constraint Programming, 2004

The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

Mini-buckets: A general scheme for bounded inference.

[BibT_eX]

[DOI]

J. ACM, 2003

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Javier Larrosa

Constraints An Int. J., 2003

Guest Editorial.

[BibT_eX]

[DOI]

Constraints An Int. J., 2003

Systematic vs. Non-systematic Algorithms for Solving the MPE Task.

[BibT_eX]

[DOI]

Radu Marinescu

Proceedings of the UAI '03, 2003

A Simple Insight into Iterative Belief Propagation's Success.

[BibT_eX]

[DOI]

Proceedings of the UAI '03, 2003

An Empirical Study of w-Cutset Sampling for Bayesian Networks.

[BibT_eX]

[DOI]

Bozhena Bidyuk

Proceedings of the UAI '03, 2003

Bayesian Inference in the Presence of Determinism.

[BibT_eX]

[DOI]

David Larkin

Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, 2003

Cycle-Cutset Sampling for Bayesian Networks.

[BibT_eX]

[DOI]

Bozhena Bidyuk

Proceedings of the Advances in Artificial Intelligence, 2003

Constraint processing.

[BibT_eX]

[DOI]

Elsevier Morgan Kaufmann, ISBN: 978-1-55860-890-0, 2003

2002

Backjump-based backtracking for constraint satisfaction problems.

[BibT_eX]

[DOI]

Artif. Intell., 2002

Iterative Join-Graph Propagation.

[BibT_eX]

[DOI]

Proceedings of the UAI '02, 2002

Tree Approximation for Belief Updating.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Generating Random Solutions for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

Heuristic search in artificial intelligence.

[BibT_eX]

[DOI]

Weixiong Zhang

Richard E. Korf

Artif. Intell., 2001

A general scheme for automatic generation of search heuristics from specification dependencies.

[BibT_eX]

[DOI]

Artif. Intell., 2001

Topological parameters for time-space tradeoff.

[BibT_eX]

[DOI]

Yousri El Fattah

Artif. Intell., 2001

Hybrid Processing of Beliefs and Constraints.

[BibT_eX]

[DOI]

David Larkin

Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.

[BibT_eX]

[DOI]

Javier Larrosa

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Resolution versus Search: Two Strategies for SAT.

[BibT_eX]

[DOI]

J. Autom. Reason., 2000

A New Perspective on Algorithms for Optimizing Policies under Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

An Implementation of the Combinatorial Auction Problem in ECLiPSe.

[BibT_eX]

[DOI]

Robert Menke

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

Self-Stabilizing Distributed Constraint Satisfaction.

[BibT_eX]

[DOI]

Zeev Collin

Shmuel Katz

Chic. J. Theor. Comput. Sci., 1999

Maintenance scheduling problems as benchmarks for constraint algorithms.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1999

Bucket Elimination: A Unifying Framework for Reasoning.

[BibT_eX]

[DOI]

Artif. Intell., 1999

Mini-Bucket Heuristics for Improved Search.

[BibT_eX]

[DOI]

Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

Branch and Bound with Mini-Bucket Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Stochastic local search for Bayesian network.

[BibT_eX]

Proceedings of the Seventh International Workshop on Artificial Intelligence and Statistics, 1999

1998

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding.

[BibT_eX]

[DOI]

Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1998

Bucket Elimination: A Unifying Framework for Probabilistic Inference.

[BibT_eX]

[DOI]

Proceedings of the Learning in Graphical Models, 1998

1997

Local and Global Relational Consistency.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Constraint tightness and looseness versus local and global consistency.

[BibT_eX]

[DOI]

J. ACM, 1997

Processing Disjunctions in Temporal Constraint Networks.

[BibT_eX]

[DOI]

Artif. Intell., 1997

A Scheme for Approximating Probabilistic Inference.

[BibT_eX]

[DOI]

Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Simple distributed algorithms for the cycle cutset problem.

[BibT_eX]

[DOI]

Arun K. Jagota

Proceedings of the 1997 ACM symposium on Applied Computing, 1997

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

1996

Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

On Computing Minimal Models.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1996

Uncovering Trees in Constraint Networks.

[BibT_eX]

[DOI]

Artif. Intell., 1996

Structure-Driven Algorithms for Truth Maintenance.

[BibT_eX]

[DOI]

Artif. Intell., 1996

Default Reasoning Using Classical Logic.

[BibT_eX]

[DOI]

Artif. Intell., 1996

Identifying Independencies in Causal Graphs with Feedback.

[BibT_eX]

[DOI]

Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits.

[BibT_eX]

[DOI]

Yousri El Fattah

Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Topological parameters for time-space tradeoff.

[BibT_eX]

[DOI]

Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Bucket elimination: A unifying framework for probabilistic inference.

[BibT_eX]

[DOI]

Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Processing Disjunctions of Temporal Constraints.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Temporal Representation and Reasoning, 1996

To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Looking at Full Looking Ahead.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

A Graph-Based Method for Improving GSAT.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Improving Connectionist Energy Minimization.

[BibT_eX]

[DOI]

Gadi Pinkas

J. Artif. Intell. Res., 1995

On the Minimality and Decomposability of Row-Convex Constraint Networks.

[BibT_eX]

[DOI]

J. ACM, 1995

GSAT and Local Consistency.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Look-Ahead Value Ordering for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Systematic Versus Stochastic Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Diagnosing Tree-Decomposable Circuits.

[BibT_eX]

[DOI]

Yousri El Fattah

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

Propositional Semantics for Disjunctive Logic Programs.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1994

Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Artif. Intell., 1994

Directional Resolution: The Davis-Putnam Procedure, Revisited.

[BibT_eX]

Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Constraint Tightness versus Global Consistency.

[BibT_eX]

Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Temporal Reasoning with Constraints on Fluents and Events.

[BibT_eX]

[DOI]

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

In Search of the Best Constraint Satisfaction Search.

[BibT_eX]

[DOI]

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

Dead-End Driven Learning.

[BibT_eX]

[DOI]

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

Coping With Disjunctions in Temporal Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992

Structure Identification in Relational Data.

[BibT_eX]

[DOI]

Artif. Intell., 1992

From Local to Global Consistency.

[BibT_eX]

[DOI]

Artif. Intell., 1992

Propositional Sematics for Disjunctive Logic Programs.

[BibT_eX]

Proceedings of the Logic Programming, 1992

An Improved Connectionist Activation Function for Energy Minimization.

[BibT_eX]

[DOI]

Gadi Pinkas

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

Temporal Constraint Networks.

[BibT_eX]

[DOI]

Artif. Intell., 1991

Directed Constraint Networks: A Relational Framework for Causal Modeling.

[BibT_eX]

[DOI]

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

On the Feasibility of Distributed Constraint Satisfaction.

[BibT_eX]

[DOI]

Zeev Collin

Shmuel Katz

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Default Logic, Propositional Logic, and Constraints.

[BibT_eX]

[DOI]

Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990

Decomposing a Relation into a Tree of Binary Relations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1990

Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition.

[BibT_eX]

[DOI]

Artif. Intell., 1990

Tree Decomposition with Applications to Constraint Processing.

[BibT_eX]

[DOI]

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

On the Expressiveness of Networks with Hidden Variables.

[BibT_eX]

[DOI]

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989

On the Greedy Solution of Ordering Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1989

Tree Clustering for Constraint Networks.

[BibT_eX]

[DOI]

Artif. Intell., 1989

Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Learning Structure from Data: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Tree-Clustering Schemes for Constraint-Processing.

[BibT_eX]

[DOI]

Proceedings of the 7th National Conference on Artificial Intelligence, 1988

Belief Maintenance in Dynamic Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987

Network-Based Heuristics for Constraint-Satisfaction Problems.

[BibT_eX]

[DOI]

Artif. Intell., 1987

Decomposing an N-ary Relation into a Tree of Binary Relations.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Removing Redundancies in Constraint Networks.

[BibT_eX]

[DOI]

Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986

Broadcast Communications and Distributed Algorithms.

[BibT_eX]

[DOI]

Leonard Kleinrock

IEEE Trans. Computers, 1986

Learning While Searching in Constraint-Satisfaction-Problems.

[BibT_eX]

[DOI]

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985

Generalized Best-First Search Strategies and the Optimality of A*

[BibT_eX]

[DOI]

J. ACM, July, 1985

The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation.

[BibT_eX]

[DOI]

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1983

The Optimality of A* Revisited.

[BibT_eX]

[DOI]

Proceedings of the National Conference on Artificial Intelligence, 1983

1980

Probabilistic Analysis of the Complexity of A*.

[BibT_eX]

[DOI]

Nam Huyn