| Publication | Date of Publication | Type |
|---|
| Biography of Judea Pearl by Stuart J. Russell | 2023-04-04 | Paper |
| Turing Award Lecture | 2023-04-04 | Paper |
| Interview by Martin Ford | 2023-04-04 | Paper |
| An Interview with Ron Wassertein on How The Book of Why Transforms Statistics | 2023-04-04 | Paper |
| Selected Annotated Bibliography by Judea Pearl | 2023-04-04 | Paper |
| Uncovering trees in constraint networks | 2022-09-27 | Paper |
| Default reasoning using classical logic | 2022-09-23 | Paper |
| Structure-driven algorithms for truth maintenance | 2022-09-22 | Paper |
| Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition | 2019-03-28 | Paper |
| AND/OR Search for Marginal MAP | 2019-01-18 | Paper |
| Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs | 2018-03-22 | Paper |
| AND/OR Branch-and-Bound on a Computational Grid | 2017-10-24 | Paper |
| Weighted heuristic anytime search: new schemes for optimization over graphical models | 2017-03-06 | Paper |
| Searching for the M Best Solutions in Graphical Models | 2016-04-19 | Paper |
| Mini-buckets | 2015-12-07 | Paper |
| Bucket elimination: a unifying framework for processing hard and soft constraints | 2015-06-15 | Paper |
| Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms | 2014-05-15 | Paper |
| Importance sampling-based estimation over AND/OR search spaces for graphical models | 2012-11-15 | Paper |
| Anytime AND/OR depth-first search for combinatorial optimization | 2012-10-25 | Paper |
| SampleSearch: importance sampling in presence of determinism | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2996252 | 2011-05-06 | Paper |
| Active Tuples-based Scheme for Bounding Posterior Beliefs | 2010-11-10 | Paper |
| Join-Graph Propagation Algorithms | 2010-05-31 | Paper |
| Evaluating the impact of AND/OR search on 0-1 integer linear programming | 2010-03-02 | Paper |
| AND/OR branch-and-bound search for combinatorial optimization in graphical models | 2009-12-21 | Paper |
| Memory intensive AND/OR search for combinatorial optimization in graphical models | 2009-12-21 | Paper |
| Mixed deterministic and probabilistic networks | 2009-09-18 | Paper |
| Robust Solutions in Unstable Optimization Problems | 2009-08-06 | Paper |
| AND/OR search spaces for graphical models | 2009-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624045 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624169 | 2009-04-28 | Paper |
| Best-First AND/OR Search for 0/1 Integer Programming | 2009-03-10 | Paper |
| Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| AND/OR Multi-valued Decision Diagrams for Constraint Optimization | 2008-09-02 | Paper |
| AND/OR Multi-valued Decision Diagrams for Constraint Networks | 2008-06-19 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2007-11-07 | Paper |
| Unifying tree decompositions for reasoning in graphical models | 2007-10-23 | Paper |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475643 | 2004-08-09 | Paper |
| Boosting search with variable elimination in constraint optimization and constraint satisfaction problems | 2004-03-15 | Paper |
| Processing disjunctions in temporal constraint networks | 2003-08-28 | Paper |
| Backjump-based backtracking for constraint satisfaction problems | 2002-07-15 | Paper |
| Heuristic search in artificial intelligence | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749860 | 2001-10-21 | Paper |
| Resolution versus search: Two strategies for SAT | 2001-09-03 | Paper |
| Topological parameters for time-space tradeoff | 2001-08-20 | Paper |
| A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) | 2001-08-20 | Paper |
| Experimental evaluation of preprocessing algorithms for constraint satisfaction problems | 2000-08-14 | Paper |
| Maintenance scheduling problems as benchmarks for constraint algorithms | 2000-06-07 | Paper |
| Bucket elimination: A unifying framework for reasoning | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484663 | 2000-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217791 | 1999-04-19 | Paper |
| Local and global relational consistency | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871258 | 1998-05-10 | Paper |
| On computing minimal models | 1998-03-04 | Paper |
| Constraint tightness and looseness versus local and global consistency | 1998-02-17 | Paper |
| On the minimality and global consistency of row-convex constraint networks | 1998-01-28 | Paper |
| Propositional semantics for disjunctive logic programs | 1996-10-20 | Paper |
| Structure identification in relational data | 1993-04-01 | Paper |
| On the Greedy Solution of Ordering Problems | 1993-01-16 | Paper |
| From local to global consistency | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012213 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013541 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013845 | 1992-09-27 | Paper |
| Temporal constraint networks | 1992-06-28 | Paper |
| Decomposing a relation into a tree of binary relations | 1990-01-01 | Paper |
| Tree clustering for constraint networks | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3489503 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493325 | 1989-01-01 | Paper |
| Network-based heuristics for constraint-satisfaction problems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835053 | 1988-01-01 | Paper |
| Generalized best-first search strategies and the optimality of A* | 1985-01-01 | Paper |
| Probabilistic analysis of the complexity of A* | 1980-01-01 | Paper |
