The Complexity of Model-Preference Default Theories. - Bart Selman; Henry A. Kautz (NMR, 1988)

The Tractability of Path-Based Inheritance. - Bart Selman; Hector J. Levesque (IJCAI, 1989)

Connectionist systems for natural language understanding. - Bart Selman (Artif. Intell. Rev., 1989)

Abductive and Default Reasoning: A Computational Core. - Bart Selman; Hector J. Levesque (AAAI, 1990)

Model-Preference Default Theories. - Bart Selman; Henry A. Kautz (Artif. Intell., 1990)

The Tractability of Path-Based Inheritance. - Bart Selman; Hector J. Levesque (Principles of Semantic Networks, 1991)

Knowledge Compilation using Horn Approximations. - Bart Selman; Henry A. Kautz (AAAI, 1991)

A General Framework for Knowledge Compilation. - Henry A. Kautz; Bart Selman (PDK, 1991)

Hard Problems for Simple Default Logics. - Henry A. Kautz; Bart Selman (Artif. Intell., 1991)

Tractable default reasoning. - Bart Selman (1991)

Forming Concepts for Fast Inference. - Henry A. Kautz; Bart Selman (AAAI, 1992)

Hard and Easy Distributions of SAT Problems. - David G. Mitchell; Bart Selman; Hector J. Levesque (AAAI, 1992)

A New Method for Solving Hard Satisfiability Problems. - Bart Selman; Hector J. Levesque; David G. Mitchell (AAAI, 1992)

Planning as Satisfiability. - Henry A. Kautz; Bart Selman (ECAI, 1992)

Reasoning With Characteristic Models. - Henry A. Kautz; Michael J. Kearns; Bart Selman (AAAI, 1993)

An Empirical Study of Greedy Local Search for Satisfiability Testing. - Bart Selman; Henry A. Kautz (AAAI, 1993)

Local search strategies for satisfiability testing. - Bart Selman; Henry A. Kautz; Bram Cohen (Cliques, Coloring, and Satisfiability, 1993)

Non-Systematic Search Methods for Model Finding. - Bart Selman (ICTAI, 1993)

Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. - Bart Selman; Henry A. Kautz (IJCAI, 1993)

The Complexity of Path-Based Defeasible Inheritance. - Bart Selman; Hector J. Levesque (Artif. Intell., 1993)

An Empirical Evaluation of Knowledge Compilation by Theory Approximation. - Henry A. Kautz; Bart Selman (AAAI, 1994)

An Experiment in the Design of Software Agents. - Henry A. Kautz; Bart Selman; Michael H. Coen; Steven P. Ketchpel; Chris Ramming (AAAI, 1994)

Noise Strategies for Improving Local Search. - Bart Selman; Henry A. Kautz; Bram Cohen (AAAI, 1994)

Domain-Specific Complexity Tradeoffs. - Bart Selman (ECAI, 1994)

Near-Optimal Plans, Tractability, and Reactivity. - Bart Selman (KR, 1994)

Bottom-Up Design of Software Agents. - Henry A. Kautz; Bart Selman; Michael H. Coen (Commun. ACM, 1994)

Intelligent Agents in Distributed Systems (Panel). - Joann J. Ordille; Oswald Drobnik; Michael R. Genesereth; Y. Lashkari; Bart Selman (ICDCS, 1995)

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

The Comparative Linguistics of Knowledge Representation. - Goran Gogic; Henry A. Kautz; Christos H. Papadimitriou; Bart Selman (IJCAI (1), 1995)

Stochastic Search and Phase Transitions: AI Meets Physics. - Bart Selman (IJCAI (1), 1995)

Horn Approximations of Empirical Data. - Henry A. Kautz; Michael J. Kearns; Bart Selman (Artif. Intell., 1995)

Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. - Henry A. Kautz; Bart Selman (AAAI/IAAI, Vol. 2, 1996)

Agent Amplified Communication. - Henry A. Kautz; Bart Selman; Al Milewski (AAAI/IAAI, Vol. 1, 1996)

Challenge Problems for Artificial Intelligence (Panel Statements). - Bart Selman; Rodney A. Brooks; Thomas L. Dean; Eric Horvitz; Tom M. Mitchell; Nils J. Nilsson (AAAI/IAAI, Vol. 2, 1996)

A general stochastic approach to solving problems with hard and soft constraints. - Henry A. Kautz; Bart Selman; YueYen Jiang (Satisfiability Problem: Theory and Applications, 1996)

Encoding Plans in Propositional Logic. - Henry A. Kautz; David A. McAllester; Bart Selman (KR, 1996)

Critical Behavior in the Computational Cost of Satisfiability Testing. - Bart Selman; Scott Kirkpatrick (Artif. Intell., 1996)

Support Set Selection for Abductive and Default Reasoning. - Bart Selman; Hector J. Levesque (Artif. Intell., 1996)

Generating Hard Satisfiability Problems. - Bart Selman; David G. Mitchell; Hector J. Levesque (Artif. Intell., 1996)

Computational Challenges in Artificial Intelligence. - Bart Selman (ACM Comput. Surv., 1996)

Knowledge Compilation and Theory Approximation. - Bart Selman; Henry A. Kautz (J. ACM, 1996)

Problem Structure in the Presence of Perturbations. - Carla P. Gomes; Bart Selman (AAAI/IAAI, 1997)

Evidence for Invariants in Local Search. - David A. McAllester; Bart Selman; Henry A. Kautz (AAAI/IAAI, 1997)

Heavy-Tailed Distributions in Combinatorial Search. - Carla P. Gomes; Bart Selman; Nuno Crato (CP, 1997)

Ten Challenges in Propositional Reasoning and Search. - Bart Selman; Henry A. Kautz; David A. McAllester (IJCAI (1), 1997)

Algorithm Portfolio Design: Theory vs. Practice. - Carla P. Gomes; Bart Selman (UAI, 1997)

The Hidden Web. - Henry A. Kautz; Bart Selman; Mehul A. Shah (AI Mag., 1997)

Referral Web: Combining Social Networks and Collaborative Filtering. - Henry A. Kautz; Bart Selman; Mehul A. Shah (Commun. ACM, 1997)

Boosting Combinatorial Search Through Randomization. - Carla P. Gomes; Bart Selman; Henry A. Kautz (AAAI/IAAI, 1998)

Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. - Carla P. Gomes; Bart Selman; Ken McAloon; Carol Tretkoff (AIPS, 1998)

The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. - Henry A. Kautz; Bart Selman (AIPS, 1998)

Control Knowledge in Planning: Benefits and Tradeoffs. - Yi-Cheng Huang; Bart Selman; Henry A. Kautz (AAAI/IAAI, 1999)

On the Fine Structure of Large Search Spaces. - Carla P. Gomes; Bart Selman (ICTAI, 1999)

Search Strategies for Hybrid Search Spaces. - Carla P. Gomes; Bart Selman (ICTAI, 1999)

Unifying SAT-based and Graph-based Planning. - Henry A. Kautz; Bart Selman (IJCAI, 1999)

2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. - Rémi Monasson; Riccardo Zecchina; Scott Kirkpatrick; Bart Selman; Lidror Troyansky (Random Struct. Algorithms, 1999)

Generating Satisfiable Problem Instances. - Dimitris Achlioptas; Carla P. Gomes; Henry A. Kautz; Bart Selman (AAAI/IAAI, 2000)

Analysis of Random Noise and Random Walk Algorithms. - Bhaskar Krishnamachari; Xi Xie; Bart Selman; Stephen B. Wicker (CP, 2000)

Learning Declarative Control Rules for Constraint-BAsed Planning. - Yi-Cheng Huang; Bart Selman; Henry A. Kautz (ICML, 2000)

Satisfiability Testing: Recent Developments and Challenge Problems. - Bart Selman (LICS, 2000)

The AIPS-98 Planning Competition. - Derek Long; Henry A. Kautz; Bart Selman; Blai Bonet; Hector Geffner; Jana Koehler; Michael Brenner 001; Jörg Hoffmann 001; Frank Rittinger; Corin R. Anderson; Daniel S. Weld; David E. Smith 001; et al. (AI Mag., 2000)

Compute-intensive methods in artificial intelligence. - Bart Selman (Ann. Math. Artif. Intell., 2000)

Hybrid Search Strategies for Heterogeneous Search Spaces. - Carla P. Gomes; Bart Selman (Int. J. Artif. Intell. Tools, 2000)

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. - Carla P. Gomes; Bart Selman; Nuno Crato; Henry A. Kautz (J. Autom. Reason., 2000)

Formal Models of Heavy-Tailed Behavior in Combinatorial Search. - Hubie Chen; Carla P. Gomes; Bart Selman (CP, 2001)

Balance and Filtering in Structured Satisfiable Problems. - Henry A. Kautz; Yongshao Ruan; Dimitris Achlioptas; Carla P. Gomes; Bart Selman; Mark E. Stickel (IJCAI, 2001)

A Bayesian Approach to Tackling Hard Computational Problems. - Eric Horvitz; Yongshao Ruan; Carla P. Gomes; Henry A. Kautz; Bart Selman; David Maxwell Chickering (UAI, 2001)

Algorithm portfolios. - Carla P. Gomes; Bart Selman (Artif. Intell., 2001)

A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). - Eric Horvitz; Yongshao Ruan; Carla P. Gomes; Henry A. Kautz; Bart Selman; David Maxwell Chickering (Electron. Notes Discret. Math., 2001)

Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). - Henry A. Kautz; Yongshao Ruan; Dimitris Achlioptas; Carla P. Gomes; Bart Selman; Mark E. Stickel (Electron. Notes Discret. Math., 2001)

Preface: Volume 9. - Henry A. Kautz; Bart Selman (Electron. Notes Discret. Math., 2001)

Editorial. - Olivier Dubois 002; Rémi Monasson; Bart Selman; Riccardo Zecchina (Theor. Comput. Sci., 2001)

Dynamic Restart Policies. - Henry A. Kautz; Eric Horvitz; Yongshao Ruan; Carla P. Gomes; Bart Selman (AAAI/IAAI, 2002)

Accelerating Random Walks. - Wei Wei 040; Bart Selman (CP, 2002)

A principled study of the design tradeoffs for autonomous trading agents. - Ioannis A. Vetsikas; Bart Selman (AAMAS, 2003)

Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. - Henry A. Kautz; Bart Selman (CP, 2003)

Grid-based SensorDCSP. - Ramón Béjar; Carmel Domshlak; Cèsar Fernández; Carla P. Gomes; Bart Selman; Magda Valls (IJCAI, 2003)

Sampling Combinatorial Spaces Using Biased Random Walks. - Jordan Erenrich; Bart Selman (IJCAI, 2003)

Backdoors To Typical Case Complexity. - Ryan Williams 001; Carla P. Gomes; Bart Selman (IJCAI, 2003)

Natural communities in large linked networks. - John E. Hopcroft; Omar Khan; Brian Kulis; Bart Selman (KDD, 2003)

Towards Efficient Sampling: Exploiting Random Walk Strategies. - Wei Wei 040; Jordan Erenrich; Bart Selman (AAAI, 2004)

A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents. - Ioannis A. Vetsikas; Bart Selman (AAMAS, 2004)

Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. - Bart Selman (CP, 2004)

From Spin Glasses to Hard Satisfiable Formulas. - Haixia Jia; Cristopher Moore; Bart Selman (SAT (Selected Papers, 2004)

Autonomous trading agent design in the presence of tradeoffs. - Ioannis A. Vetsikas; Bart Selman (ICEC, 2005)

The Achilles' Heel of QBF. - Carlos Ansótegui; Carla P. Gomes; Bart Selman (AAAI, 2005)

A New Approach to Model Counting. - Wei Wei 040; Bart Selman (SAT, 2005)

Sensor networks and distributed CSP: communication, computation and complexity. - Ramón Béjar; Carmel Domshlak; Cèsar Fernández; Carla P. Gomes; Bhaskar Krishnamachari; Bart Selman; Magda Valls (Artif. Intell., 2005)

Statistical Regimes Across Constrainedness Regions. - Carla P. Gomes; Cèsar Fernández; Bart Selman; Christian Bessière (Constraints An Int. J., 2005)

Regular Random k-SAT: Properties of Balanced Formulas. - Yacine Boufkhad; Olivier Dubois 002; Yannet Interian; Bart Selman (J. Autom. Reason., 2005)

Model Counting: A New Strategy for Obtaining Good Bounds. - Carla P. Gomes; Ashish Sabharwal; Bart Selman (AAAI, 2006)

Constraint Programming for Distributed Planning and Scheduling. - Carla P. Gomes; Willem Jan van Hoeve; Bart Selman (AAAI Spring Symposium: Distributed Plan and Schedule Management, 2006)

Integration of Learning and Reasoning Techniques. - Bart Selman (ILP, 2006)

Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. - Yannet Interian; Gabriel Corvera; Bart Selman; Ryan Williams 001 (AI&M, 2006)

Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. - Carla P. Gomes; Ashish Sabharwal; Bart Selman (NIPS, 2006)

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. - Ashish Sabharwal; Carlos Ansótegui; Carla P. Gomes; Justin W. Hart; Bart Selman (SAT, 2006)

Counting CSP Solutions Using Generalized XOR Constraints. - Carla P. Gomes; Willem Jan van Hoeve; Ashish Sabharwal; Bart Selman (AAAI, 2007)

Optimal Multi-Agent Scheduling with Constraint Programming. - Willem Jan van Hoeve; Carla P. Gomes; Bart Selman; Michele Lombardi 001 (AAAI, 2007)

ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming. - Yunsong Guo; Bart Selman (ICTAI (2), 2007)

From Sampling to Model Counting. - Carla P. Gomes; Jörg Hoffmann 001; Ashish Sabharwal; Bart Selman (IJCAI, 2007)

SAT Encodings of State-Space Reachability Problems in Numeric Domains. - Jörg Hoffmann 001; Carla P. Gomes; Bart Selman; Henry A. Kautz (IJCAI, 2007)

Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. - Ioannis A. Vetsikas; Nicholas R. Jennings; Bart Selman (IJCAI, 2007)

Short XORs for Model Counting: From Theory to Practice. - Carla P. Gomes; Jörg Hoffmann 001; Ashish Sabharwal; Bart Selman (SAT, 2007)

Sampling and Soundness: Can We Have Both? - Carla P. Gomes; Jörg Hoffmann 001; Ashish Sabharwal; Bart Selman (New Forms of Reasoning for the Semantic Web, 2007)

Survey Propagation Revisited. - Lukas Kroc; Ashish Sabharwal; Bart Selman (UAI, 2007)

The state of SAT. - Henry A. Kautz; Bart Selman (Discret. Appl. Math., 2007)

Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. - Jörg Hoffmann 001; Carla P. Gomes; Bart Selman (Log. Methods Comput. Sci., 2007)

Bayes-Nash equilibria for mth price auctions with multiple closing times. - Ioannis A. Vetsikas; Bart Selman (SIGecom Exch., 2007)

Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. - Lukas Kroc; Ashish Sabharwal; Bart Selman (NIPS, 2008)

Satisfiability Solvers. - Carla P. Gomes; Henry A. Kautz; Ashish Sabharwal; Bart Selman (Handbook of Knowledge Representation, 2008)

Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. - Lukas Kroc; Ashish Sabharwal; Carla P. Gomes; Bart Selman (IJCAI, 2009)

Message-passing and local heuristics as decimation strategies for satisfiability. - Lukas Kroc; Ashish Sabharwal; Bart Selman (SAC, 2009)

Relaxed DPLL Search for MaxSAT. - Lukas Kroc; Ashish Sabharwal; Bart Selman (SAT, 2009)

Model Counting. - Carla P. Gomes; Ashish Sabharwal; Bart Selman (Handbook of Satisfiability, 2009)

Incomplete Algorithms. - Henry A. Kautz; Ashish Sabharwal; Bart Selman (Handbook of Satisfiability, 2009)

Approximate Inference for Clusters in Solution Spaces. - Lukas Kroc; Ashish Sabharwal; Bart Selman (Abstraction, Reformulation, and Approximation, 2010)

On Adversarial Search Spaces and Sampling-Based Planning. - Raghuram Ramanujan; Ashish Sabharwal; Bart Selman (ICAPS, 2010)

Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation. - Stefano Ermon; Carla P. Gomes; Bart Selman (AAMAS, 2010)

Computing the Density of States of Boolean Formulas. - Stefano Ermon; Carla P. Gomes; Bart Selman (CP, 2010)

An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. - Lukas Kroc; Ashish Sabharwal; Bart Selman (SAT, 2010)

Playing games against nature: optimal policies for renewable resource allocation. - Stefano Ermon; Jon Conrad; Carla P. Gomes; Bart Selman (UAI, 2010)

Understanding Sampling Style Adversarial Search Methods. - Raghuram Ramanujan; Ashish Sabharwal; Bart Selman (UAI, 2010)

Special issue on learning and intelligent optimization. - Roberto Battiti; Bart Selman; Thomas Stützle (Ann. Math. Artif. Intell., 2010)

Human Activity Detection from RGBD Images. - Jaeyong Sung; Colin Ponce; Bart Selman; Ashutosh Saxena (Plan, Activity, and Intent Recognition, 2011)

Monte-Carlo Style UCT Search for Boolean Satisfiability. - Alessandro Previti; Raghuram Ramanujan; Marco Schaerf; Bart Selman (AI*IA, 2011)

Trade-Offs in Sampling-Based Adversarial Planning. - Raghuram Ramanujan; Bart Selman (ICAPS, 2011)

A message passing approach to multiagent gaussian inference for dynamic processes. - Stefano Ermon; Carla P. Gomes; Bart Selman (AAMAS, 2011)

Risk-Sensitive Policies for Sustainable Renewable Resource Allocation. - Stefano Ermon; Jon Conrad; Carla P. Gomes; Bart Selman (IJCAI, 2011)

A Flat Histogram Method for Computing the Density of States of Combinatorial Problems. - Stefano Ermon; Carla P. Gomes; Bart Selman (IJCAI, 2011)

Accelerated Adaptive Markov Chain for Partition Function Computation. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (NIPS, 2011)

Applying UCT to Boolean Satisfiability. - Alessandro Previti; Raghuram Ramanujan; Marco Schaerf; Bart Selman (SAT, 2011)

S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition. - Ashish Sabharwal; Bart Selman (Artif. Intell., 2011)

Leveraging belief propagation, backtrack search, and statistics for model counting. - Lukas Kroc; Ashish Sabharwal; Bart Selman (Ann. Oper. Res., 2011)

From Streamlined Combinatorial Search to Efficient Constructive Procedures. - Ronan LeBras; Carla P. Gomes; Bart Selman (AAAI, 2012)

Probabilistic planning with non-linear utility functions and worst-case guarantees. - Stefano Ermon; Carla P. Gomes; Bart Selman; Alexander Vladimirsky (AAMAS, 2012)

Unstructured human activity detection from RGBD images. - Jaeyong Sung; Colin Ponce; Bart Selman; Ashutosh Saxena (ICRA, 2012)

Density Propagation and Improved Bounds on the Partition Function. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (NIPS, 2012)

SMT-Aided Combinatorial Materials Discovery. - Stefano Ermon; Ronan LeBras; Carla P. Gomes; Bart Selman; R. Bruce van Dover (SAT, 2012)

Uniform Solution Sampling Using a Constraint Solver As an Oracle. - Stefano Ermon; Carla P. Gomes; Bart Selman (UAI, 2012)

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (ICML (2), 2013)

Crowdsourcing Backdoor Identification for Combinatorial Optimization. - Ronan LeBras; Richard Bernstein; Carla P. Gomes; Bart Selman; R. Bruce van Dover (IJCAI, 2013)

Double-Wheel Graphs Are Graceful. - Ronan LeBras; Carla P. Gomes; Bart Selman (IJCAI, 2013)

Embed and Project: Discrete Sampling with Universal Hashing. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (NIPS, 2013)

Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability. - Marcelo Finger; Ronan LeBras; Carla P. Gomes; Bart Selman (SAT, 2013)

Optimization With Parity Constraints: From Binary Codes to Discrete Integration. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (UAI, 2013)

Learning Sequences of Controllers for Complex Manipulation Tasks. - Jaeyong Sung; Bart Selman; Ashutosh Saxena (CoRR, 2013)

Learning policies for battery usage optimization in electric vehicles. - Stefano Ermon; Yexiang Xue; Carla P. Gomes; Bart Selman (Mach. Learn., 2013)

Challenges in Materials Discovery - Synthetic Generator and Real Datasets. - Ronan Le Bras 001; Richard Bernstein; John M. Gregoire; Santosh K. Suram; Carla P. Gomes; Bart Selman; R. Bruce van Dover (AAAI, 2014)

Designing Fast Absorbing Markov Chains. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (AAAI, 2014)

Uncovering Hidden Structure through Parallel Problem Decomposition. - Yexiang Xue; Stefano Ermon; Carla P. Gomes; Bart Selman (AAAI, 2014)

On the Erdős Discrepancy Problem. - Ronan Le Bras 001; Carla P. Gomes; Bart Selman (CP, 2014)

A Human Computation Framework for Boosting Combinatorial Solvers. - Ronan Le Bras 001; Yexiang Xue; Richard Bernstein; Carla P. Gomes; Bart Selman (HCOMP, 2014)

Low-density Parity Constraints for Hashing-Based Discrete Integration. - Stefano Ermon; Carla P. Gomes; Ashish Sabharwal; Bart Selman (ICML, 2014)

Synthesizing manipulation sequences for under-specified tasks using unrolled Markov Random Fields. - Jaeyong Sung; Bart Selman; Ashutosh Saxena (IROS, 2014)

Pattern Decomposition with Complex Combinatorial Constraints: Application to Materials Discovery. - Stefano Ermon; Ronan Le Bras 001; Santosh K. Suram; John M. Gregoire; Carla P. Gomes; Bart Selman; Robert Bruce van Dover (AAAI, 2015)

Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem. - Yexiang Xue; Stefano Ermon; Carla P. Gomes; Bart Selman (AAAI Workshop: Computational Sustainability, 2015)

Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem: Application to Materials Discovery. - Yexiang Xue; Stefano Ermon; Carla P. Gomes; Bart Selman (IJCAI, 2015)

Letter to the Editor: Research Priorities for Robust and Beneficial Artificial Intelligence: An Open Letter. - Stuart Russell 001; Tom Dietterich; Eric Horvitz; Bart Selman; Francesca Rossi 001; Demis Hassabis; Shane Legg; Mustafa Suleyman; Dileep George; D. Scott Phoenix (AI Mag., 2015)

DPLL: The Core of Modern Satisfiability Solvers. - Donald W. Loveland; Ashish Sabharwal; Bart Selman (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

Variable Elimination in the Fourier Domain. - Yexiang Xue; Stefano Ermon; Ronan Le Bras 001; Carla P. Gomes; Bart Selman (ICML, 2016)

Watch-Bot: Unsupervised learning for reminding humans of forgotten actions. - Chenxia Wu; Jiemi Zhang; Bart Selman; Silvio Savarese; Ashutosh Saxena (ICRA, 2016)

Solving Marginal MAP Problems with NP Oracles and Parity Constraints. - Yexiang Xue; Zhiyuan Li 005; Stefano Ermon; Carla P. Gomes; Bart Selman (NIPS, 2016)

XOR-Sampling for Network Design with Correlated Stochastic Events. - Xiaojian Wu; Yexiang Xue; Bart Selman; Carla P. Gomes (IJCAI, 2017)

Understanding Batch Normalization. - Johan Bjorck; Carla P. Gomes; Bart Selman; Kilian Q. Weinberger (NeurIPS, 2018)

Understanding Batch Normalization. - Johan Bjorck; Carla P. Gomes; Bart Selman (CoRR, 2018)

Watch-n-Patch: Unsupervised Learning of Actions and Relations. - Chenxia Wu; Jiemi Zhang; Ozan Sener; Bart Selman; Silvio Savarese; Ashutosh Saxena (IEEE Trans. Pattern Anal. Mach. Intell., 2018)

Computational sustainability: computing for a better world and a sustainable future. - Carla P. Gomes; Thomas G. Dietterich; Christopher Barrett; Jon Conrad; Bistra Dilkina; Stefano Ermon; Fei Fang 001; Andrew Farnsworth; Alan Fern; Xiaoli Z. Fern; Daniel Fink 002; Douglas H. Fisher; et al. (Commun. ACM, 2019)

A 20-Year Community Roadmap for Artificial Intelligence Research in the US. - Yolanda Gil; Bart Selman (CoRR, 2019)

A 20-Year Roadmap for AI Research. - Bart Selman (ICAART (1), 2020)

Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning. - Dieqiao Feng; Carla P. Gomes; Bart Selman (IJCAI, 2020)

A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances. - Dieqiao Feng; Carla P. Gomes; Bart Selman (NeurIPS, 2020)

Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Perspective. - Jialu Bao; Kun He 001; Xiaodong Xin; Bart Selman; John E. Hopcroft (TAMC, 2020)

Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Prospective. - Jialu Bao; Kun He 001; Xiaodong Xin; Bart Selman; John E. Hopcroft (CoRR, 2020)

Low-Bandwidth Communication Emerges Naturally in Multi-Agent Learning Systems. - Niko A. Grupen; Daniel D. Lee; Bart Selman (CoRR, 2020)

Zeitenwende - Turn of Eras. - Meinolf Sellmann; Bart Selman (AI Mag., 2021)

Fairness for Cooperative Multi-Agent Learning with Equivariant Policies. - Niko A. Grupen; Bart Selman; Daniel D. Lee (CoRR, 2021)

Curriculum-Driven Multi-Agent Learning and the Role of Implicit Communication in Teamwork. - Niko A. Grupen; Daniel D. Lee; Bart Selman (CoRR, 2021)

Structure Amplification on Multi-layer Stochastic Block Models. - Xiaodong Xin; Kun He 001; Jialu Bao; Bart Selman; John E. Hopcroft (CoRR, 2021)

Automating Crystal-Structure Phase Mapping: Combining Deep Learning with Constraint Reasoning. - Di Chen 001; Yiwei Bai; Sebastian Ament; Wenting Zhao 002; Dan Guevarra; Lan Zhou; Bart Selman; R. Bruce van Dover; John M. Gregoire; Carla P. Gomes (CoRR, 2021)

Automating crystal-structure phase mapping by combining deep learning with constraint reasoning. - Di Chen 001; Yiwei Bai; Sebastian Ament; Wenting Zhao 002; Dan Guevarra; Lan Zhou; Bart Selman; R. Bruce van Dover; John M. Gregoire; Carla P. Gomes (Nat. Mach. Intell., 2021)

Model Counting. - Carla P. Gomes; Ashish Sabharwal; Bart Selman (Handbook of Satisfiability, 2021)

Incomplete Algorithms. - Henry A. Kautz; Ashish Sabharwal; Bart Selman (Handbook of Satisfiability, 2021)

Cooperative Multi-Agent Fairness and Equivariant Policies. - Niko A. Grupen; Bart Selman; Daniel D. Lee (AAAI, 2022)

Multi-Agent Curricula and Emergent Implicit Signaling. - Niko A. Grupen; Daniel D. Lee; Bart Selman (AAMAS, 2022)

Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning. - Dieqiao Feng; Carla P. Gomes; Bart Selman (NeurIPS, 2022)

Graph Value Iteration. - Dieqiao Feng; Carla P. Gomes; Bart Selman (CoRR, 2022)

Haptic perception using optoelectronic robotic flesh for embodied artificially intelligent agents. - Jose A. Barreiros; Artemis Xu; Sofya Pugach; Narahari Iyengar; Graeme Troxell; Alexander Cornwell; Samantha Hong; Bart Selman; Robert F. Shepherd (Sci. Robotics, 2022)

Weighted Sampling without Replacement for Deep Top-k Classification. - Dieqiao Feng; Yuanqi Du; Carla P. Gomes; Bart Selman (ICML, 2023)

Policy-Value Alignment and Robustness in Search-based Multi-Agent Learning. - Niko A. Grupen; Michael Hanlon; Alexis Hao; Daniel D. Lee; Bart Selman (CoRR, 2023)

SKI-SAT: A CMOS-compatible Hardware for Solving SAT Problems. - Ahmet Yusuf Salim; Bart Selman; Henry A. Kautz; Zeljko Ignjatovic; Selçuk Köse (CoRR, 2024)

Structure Amplification on Multi-layer Stochastic Block Models. - Kun He 001; Xiaodong Xin; Jialu Bao; Meng Wang 039; Bart Selman; John E. Hopcroft (ACM Trans. Knowl. Discov. Data, 2025)

Position: Multimodal Large Language Models Can Significantly Advance Scientific Reasoning. - Yibo Yan; Shen Wang 005; Jiahao Huo; Jingheng Ye; Zhendong Chu; Xuming Hu; Philip S. Yu; Carla P. Gomes; Bart Selman; Qingsong Wen (CoRR, 2025)

LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solvers. - Junrui Wen; Yifei Li; Bart Selman; Kun He 001 (CoRR, 2025)