Bart Selman

Q: What Schools Are Affiliated With Bart Selman

Bart Selman is affiliated with the following schools: University of Amsterdam, Cornell University, University of Toronto, Delft University of Technology

Bart Selman's AcademicInfluence.com Rankings

Bart Selman

Computer Science

#973

World Rank

#1009

Historical Rank

#528

USA Rank

Automated Reasoning

World Rank

Historical Rank

USA Rank

Artificial Intelligence

#110

World Rank

#113

Historical Rank

#50

USA Rank

Database

#1729

World Rank

#1814

Historical Rank

#440

USA Rank

computer-science Degrees

Download Badge

Computer Science

Bart Selman's Degrees

Bachelors Computer Science University of Amsterdam

Similar Degrees You Can Earn

Why Is Bart Selman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bart Selman is a Dutch-American professor of computer science at Cornell University. He has previously worked at AT&T Bell Laboratories. He is also co-founder and principal investigator of the Center for Human-Compatible Artificial Intelligence at the University of California, Berkeley, led by Berkeley artificial intelligence expert Stuart J. Russell, and co-chair of the Computing Community Consortium's 20-year roadmap for AI research.

(See a Problem?)

Bart Selman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A New Method for Solving Hard Satisfiability Problems (1992) (1490)
Planning as Satisfiability (1992) (1146)
Hard and Easy Distributions of SAT Problems (1992) (1126)
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search (1996) (1071)
Referral Web: combining social networks and collaborative filtering (1997) (1007)
Noise Strategies for Improving Local Search (1994) (972)
Local search strategies for satisfiability testing (1993) (743)
Determining computational complexity from characteristic ‘phase transitions’ (1999) (728)
Boosting Combinatorial Search Through Randomization (1998) (708)
Unstructured human activity detection from RGBD images (2011) (565)
Unifying SAT-based and Graph-based Planning (1999) (562)
Critical Behavior in the Satisfiability of Random Boolean Expressions (1994) (555)
Algorithm portfolios (2001) (496)
Evidence for Invariants in Local Search (1997) (452)
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems (2000) (438)
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems (1993) (404)
Backdoors To Typical Case Complexity (2003) (373)
Understanding Batch Normalization (2018) (359)
Encoding Plans in Propositional Logic (1996) (353)
Human Activity Detection from RGBD Images (2011) (353)
Knowledge compilation and theory approximation (1996) (349)
Tracking evolving communities in large linked networks (2004) (332)
The Hidden Web (1997) (315)
Generating Hard Satisfiability Problems (1996) (308)
Satisfiability Solvers (2008) (259)
BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving (1998) (236)
Abductive and Default Reasoning: A Computational Core (1990) (233)
Ten Challenges in Propositional Reasoning and Search (1997) (204)
Heavy-Tailed Distributions in Combinatorial Search (1997) (193)
Knowledge Compilation using Horn Approximations (1991) (191)
S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition (2011) (191)
An Empirical Study of Greedy Local Search for Satisfiability Testing (1993) (191)
Hard Problems for Simple Default Logics (1989) (189)
Generating Satisfiable Problem Instances (2000) (188)
Natural communities in large linked networks (2003) (163)
Problem Structure in the Presence of Perturbations (1997) (161)
Towards Efficient Sampling: Exploiting Random Walk Strategies (2004) (155)
Model Counting: A New Strategy for Obtaining Good Bounds (2006) (151)
A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report) (2001) (148)
Model Counting (2021) (145)
Dynamic restart policies (2002) (143)
A general stochastic approach to solving problems with hard and soft constraints (1996) (142)
The Comparative Linguistics of Knowledge Representation (1995) (134)
Algorithm Portfolio Design: Theory vs. Practice (1997) (134)
Agent Amplified Communication (1996) (129)
Critical Behavior in the Computational Cost of Satisfiability Testing (1996) (120)
Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization (2013) (119)
A New Approach to Model Counting (2005) (115)
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition (1999) (113)
Noise Strategies for Local Search (1994) (104)
From Sampling to Model Counting (2007) (101)
Horn Approximations of Empirical Data (1995) (100)
The Tractability of Path-Based Inheritance (1989) (99)
Combining social networks and collaborative ?ltering (1997) (96)
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints (2006) (95)
Sensor networks and distributed CSP: communication, computation and complexity (2005) (93)
The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework (1998) (92)
The state of SAT (2007) (87)
Balance and Filtering in Structured Satisfiable Problems (2001) (86)
The Achilles' Heel of QBF (2005) (85)
Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT (1995) (84)
Systematic Versus Stochastic Constraint Satisfaction (1995) (80)
Hill‐climbing Search (2006) (79)
Bottom-up design of software agents (1994) (77)
Forming Concepts for Fast Inference (1992) (74)
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems (1998) (71)
Statistical Regimes Across Constrainedness Regions (2004) (70)
Model-Preference Default Theories (1990) (68)
The AIPS-98 Planning Competition (2000) (66)
An Experiment in the Design of Software Agents (1994) (65)
Embed and Project: Discrete Sampling with Universal Hashing (2013) (64)
Low-density Parity Constraints for Hashing-Based Discrete Integration (2014) (64)
Reasoning With Characteristic Models (1993) (64)
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search (2003) (61)
Phase transitions in combinatorial problems (2001) (58)
Learning Declarative Control Rules for Constraint-BAsed Planning (2000) (58)
On Adversarial Search Spaces and Sampling-Based Planning (2010) (58)
Formal Models of Heavy-Tailed Behavior in Combinatorial Search (2001) (56)
On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search (2003) (55)
Control Knowledge in Planning: Benefits and Tradeoffs (1999) (54)
A principled study of the design tradeoffs for autonomous trading agents (2003) (53)
Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT (2009) (52)
Uniform Solution Sampling Using a Constraint Solver As an Oracle (2012) (52)
Challenge problems for artificial intelligence (1996) (51)
Letter to the Editor: Research Priorities for Robust and Beneficial Artificial Intelligence: An Open Letter (2015) (49)
Counting CSP Solutions Using Generalized XOR Constraints (2007) (49)
Near-Optimal Plans, Tractability, and Reactivity (1994) (47)
Accelerating Random Walks (2002) (46)
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (2006) (45)
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting (2008) (45)
SAT Encodings of State-Space Reachability Problems in Numeric Domains (2007) (44)
Support Set Selection for Abductive and Default Reasoning (1996) (44)
Blackbox: Unifying sat-based and graph-based planning (1999) (44)
Artificial intelligence for materials discovery (2019) (44)
Regular Random k-SAT: Properties of Balanced Formulas (2005) (43)
Short XORs for Model Counting: From Theory to Practice (2007) (42)
Incomplete Algorithms (2021) (42)
On the Erdős Discrepancy Problem (2014) (42)
A General Framework for Knowledge Compilation (1991) (41)
Phase transition and search cost in the 2+p-sat problem (1996) (41)
A 20-Year Community Roadmap for Artificial Intelligence Research in the US (2019) (39)
Trade-Offs in Sampling-Based Adversarial Planning (2011) (38)
Tractable default reasoning (1991) (37)
Survey Propagation Revisited (2007) (36)
From Spin Glasses to Hard Satisfiable Formulas (2004) (36)
Stochastic Search and Phase Transitions: AI Meets Physics (1995) (35)
The Complexity of Model-Preference Default Theories (1988) (34)
Pattern Decomposition with Complex Combinatorial Constraints: Application to Materials Discovery (2014) (33)
Optimization With Parity Constraints: From Binary Codes to Discrete Integration (2013) (33)
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (2010) (28)
Message-passing and local heuristics as decimation strategies for satisfiability (2009) (27)
An Empirical Evaluation of Knowledge Compilation by Theory Approximation (1994) (27)
Understanding Sampling Style Adversarial Search Methods (2012) (27)
Generating Hard Satis ability Problems ? (1995) (26)
Watch-n-Patch: Unsupervised Learning of Actions and Relations (2016) (26)
Computational science: Can get satisfaction (2005) (23)
Learning policies for battery usage optimization in electric vehicles (2012) (22)
SMT-Aided Combinatorial Materials Discovery (2012) (22)
Double-Wheel Graphs Are Graceful (2013) (22)
The Role of Domain-speciic Knowledge in the Planning as Satissability Framework (1998) (22)
The Complexity of Path-Based Defeasible Inheritance (1993) (22)
On the Behavior of UCT in Synthetic Search Spaces (2011) (21)
Synthesizing manipulation sequences for under-specified tasks using unrolled Markov Random Fields (2013) (21)
Automating crystal-structure phase mapping by combining deep learning with constraint reasoning (2021) (20)
Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning (2020) (20)
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (2006) (20)
Satisfied with Physics (2002) (20)
The role of domain-specific axioms in the planning as satisfiability framework (1998) (20)
Rule-Based Processing in a Connectionist System for Natural Language Understanding (1985) (20)
Probabilistic planning with non-linear utility functions and worst-case guarantees (2012) (18)
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report) (2001) (18)
Optimal Multi-Agent Scheduling with Constraint Programming (2007) (18)
Interim Report from the Panel Chairs: AAAI Presidential Panel on Long-Term AI Futures (2012) (17)
Crowdsourcing Backdoor Identification for Combinatorial Optimization (2013) (16)
A computational challenge problem in materials discovery: synthetic problem generator and real-world datasets (2014) (15)
Neural network-based detection of mechanical, sensor and biological faults in deep-trough hydroponics (2003) (15)
Domain-independant extensions to GSAT : Solving large structured variables (1993) (15)
Solving Marginal MAP Problems with NP Oracles and Parity Constraints (2016) (15)
Watch-Bot: Unsupervised learning for reminding humans of forgotten actions (2015) (15)
On the fine structure of large search spaces (1999) (14)
Playing games against nature: optimal policies for renewable resource allocation (2010) (14)
Risk-Sensitive Policies for Sustainable Renewable Resource Allocation (2011) (14)
Monte-Carlo Style UCT Search for Boolean Satisfiability (2011) (13)
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation (2008) (13)
Hard problems for simple default theories (1991) (13)
Computing the Density of States of Boolean Formulas (2010) (12)
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (2013) (12)
Walksat in the 2004 SAT Competition (2004) (12)
Branch and bound algorithm selection by performance prediction (2001) (12)
A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances (2021) (11)
Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents (2007) (11)
Editorial (1902) (11)
Learning Sequences of Controllers for Complex Manipulation Tasks (2013) (11)
ming, Propositional Logic, and Stochastic Search (1996) (11)
Search strategies for hybrid search spaces (1999) (11)
Computational science: A hard statistical view (2008) (11)
Variable Elimination in the Fourier Domain (2015) (10)
An Empirical Evaluation of Knowledge Compilation (1994) (10)
On the Erd˝ os Discrepancy Problem* (2014) (10)
Designing Fast Absorbing Markov Chains (2014) (9)
From Streamlined Combinatorial Search to Efficient Constructive Procedures (2012) (9)
Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs (2006) (8)
Satisfiability testing: recent developments and challenge problems (2000) (8)
WhiteBear: An Empirical Study of Design Tradeoffs for Autonomous Trading Agents (2002) (8)
Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12) (2012) (7)
Challenge Problems for Arti cial Intelligence (1996) (7)
Accelerated Adaptive Markov Chain for Partition Function Computation (2011) (7)
The AIPS-98 planning competition: competitors' perspectives (2000) (7)
DPLL: The Core of Modern Satisfiability Solvers (2016) (7)
Practical Aspects of Algorithm Portfolio Design (1997) (7)
Density Propagation and Improved Bounds on the Partition Function (2012) (6)
Relaxed DPLL Search for MaxSAT (2009) (6)
A Flat Histogram Method for Computing the Density of States of Combinatorial Problems (2011) (6)
Constraint Programming for Distributed Planning and Scheduling (2006) (6)
Bayes-Nash equilibria for mth price auctions with multiple closing times (2007) (6)
Applying UCT to Boolean Satisfiability (2011) (6)
Hybrid Search Strategies for Heterogeneous Search Spaces (2000) (5)
Sparse Message Passing Algorithms for Weighted Maximum Satisfiability (2007) (5)
A Human Computation Framework for Boosting Combinatorial Solvers (2014) (5)
Computational challenges in artificial intelligence (1996) (5)
Compute‐intensive methods in artificial intelligence (2000) (5)
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming (2007) (5)
Low-Bandwidth Communication Emerges Naturally in Multi-Agent Learning Systems (2020) (5)
Combining Social Networks and Collaborative Filtering An interactive system for restructuring, visualizing, and searching social networks on the Web. (1997) (5)
Challenges in Materials Discovery - Synthetic Generator and Real Datasets (2014) (5)
Agent Ampliied Communication (1996) (5)
Connectionist systems for natural language understanding (1989) (4)
Structure and Problem Hardness: Asymmetry and DPLL Proofs in SAT-Based Planning (2005) (4)
Haptic perception using optoelectronic robotic flesh for embodied artificially intelligent agents (2022) (4)
2.6.3 Designing a Systems Engineering Educational Program Using Academic/Industry Collaboration (2000) (4)
Colloquium Tracking evolving communities in large linked networks (2004) (4)
Analysis of Random Noise and Random Walk Algorithms (2000) (4)
Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation (2010) (3)
Autonomous trading agent design in the presence of tradeoffs (2005) (3)
Fairness for Cooperative Multi-Agent Learning with Equivariant Policies (2021) (3)
XOR-Sampling for Network Design with Correlated Stochastic Events (2017) (3)
Leveraging belief propagation, backtrack search, and statistics for model counting (2011) (3)
Domain-Specific Complexity Tradeoffs (1994) (3)
Computational Challenges in Propositional Reasoning and Search (2007) (3)
Challenge Problems for Artificial Intelligence (Panel Statements) (1996) (3)
ts for Fast Inference (1992) (2)
Tractability through Theory Approximation (1992) (2)
A message passing approach to multiagent gaussian inference for dynamic processes (2011) (2)
Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics (2004) (2)
Solving Large-Scale Computational Problems Using Insights from Statistical Physics (2012) (2)
Multi-Agent Curricula and Emergent Implicit Signaling (2021) (2)
AAAI Presidential Panel on Long-Term AI Futures: Interim Report from the Panel Chairs (2016) (2)
Asilomar Study on Long-Term AI Features (2016) (2)
Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Prospective (2020) (2)
"Intelligent Agents in Distributed Systems" (1995) (2)
Boosting combination search through randomiza-tion (1998) (2)
Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem (2015) (2)
Special issue on learning and intelligent optimization (2010) (2)
Cooperative Multi-Agent Fairness and Equivariant Policies (2021) (1)
Learning policies for battery usage optimization in electric vehicles (2013) (1)
HEAVY TAILS, PHASE TRANSITIONS, AND THE NATURE OF CUTOFF (2002) (1)
Chapter 12 COMMUNICATION AND COMPUTATION IN DISTRIBUTED CSP ALGORITHMS (2003) (1)
Encoding domain knowledge for propositional planning (2001) (1)
Uncovering Hidden Structure through Parallel Problem Decomposition (2014) (1)
Encoding Domain and Control Knowledge for Propositional Planning (2000) (1)
Integration of Learning and Reasoning Techniques (2007) (1)
Preface: Volume 9 (2001) (1)
Structure and PhaseTransition Phenomenain the VTC Problem (2001) (1)
Performance Analysis of Neighborhood Search Algorithms (2007) (1)
Materials Discovery : New Opportunities at the Intersection of Constraint Reasoning and Learning ∗ (2012) (1)
Neural Network Based Fault Detection in Hydroponics (2001) (1)
Computer science. Satisfied with physics. (2002) (1)
Modularity and Complexity Profiles in Overconstrained Resource Allocation Problems (2002) (1)
Sampling Combinatorial Spaces Using Biased Random Walks (2003) (1)
A methodology and equilibria for design tradeoffs of autonomous trading agents (2004) (1)
Walksat in the SAT04 Competition (2004) (1)
Analogical Representations (2007) (1)
Non-systematic search methods for model finding (1993) (1)
Grid-based SensorDCSP (2003) (0)
Why Now is the Time for a Paradigm Shift in Research in Artificial Intelligence (2020) (0)
Statistical Physics and Computational Complexity (2020) (0)
A Bayesian Approach to Solving Hard Computational Problems (2016) (0)
Greedy Local Search (2007) (0)
8.2 Denecker's Approach 8 Related Work 8.1 Gelfond and Lifschitz' Original Approach (1997) (0)
Controlling Computational Cost: Structure, Phase Transition and Randomization (2004) (0)
Multi-resolution modelling and Pseudo-Boolean encoding of the SNAP scheduling problem (2003) (0)
Policy-Value Alignment and Robustness in Search-based Multi-Agent Learning (2023) (0)
Intelligent Agents in Distributed Systems (Panel). (1995) (0)
Hill-climbing Search Local versus Global Search (0)
Counting Solution Clusters Using Belief Propagation (2008) (0)
M ay 2 01 4 On the Erdős Discrepancy Problem * (2014) (0)
Analysis of Random Noise and Random WalkAlgorithms for Satis ability (2000) (0)
Structure Amplification on Multi-layer Stochastic Block Models (2021) (0)
Discussion of " Exploiting Relevance through Model-Based Reasoning " by Roni Khardon and Dan Roth (0)
Boosting Reasoning Technology Through Randomization, Structure Discovery, and Hybrid Strategies (2003) (0)
Approximate Inference for Clusters in Solution Spaces (2010) (0)
Report on NSF Workshop on Symbolic Computation for Constraint Satisfaction November 14 , 2008 (2008) (0)
Incomplete Algorithms [ draft v 2 ] (0)
Principled Analysis and Synthesis of Agent Systems Using Tools from Statistical Physics (2003) (0)
Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning (2022) (0)
Sampling and Soundness: Can We Have Both? (2007) (0)
Device for automatically limiting recipient of message (1995) (0)
The Future of AI: Reaping the Benefits While Avoiding Pitfalls (2016) (0)
Techniques de filtrage de messages (1995) (0)
Curriculum-Driven Multi-Agent Learning and the Role of Implicit Communication in Teamwork (2021) (0)
2 Short-term Research Priorities 2 . 1 Optimizing AI ’ s Economic Impact (0)
Unsatisfying Walks : Solving False QBFs with Local Search (2006) (0)
Best Paper (2015) (0)
Planning CNFs with Small DPLL Proofs (2005) (0)
Zeitenwende - Turn of Eras (2021) (0)
Langmuir-Blodgett Films of a Functionalized Molecule with Cross-Sectional Mismatch Between Head and Tail (2004) (0)
The Natural Communities Algorithm for Tracking the Evolution of Large Networks (2004) (0)
Bottleneck behavior in CNF formulas (2005) (0)
Agent realization device (1995) (0)
Graph Value Iteration (2022) (0)
Planning as Satis abilityHenry (1992) (0)
Tepper School of Business 7-2007 Counting CSP Solutions Using Generalized XOR Constraints (2015) (0)
News filtering techniques (1995) (0)
irical luatio (1999) (0)
Discrete Integration by Decoding Binary Codes (2013) (0)
1.2 SATISFIABILITY AND HARD-PROBLEM INSTANCES....... iv (2003) (0)
Combinatorics Seminar on the Number of Edges in Colour-critical Graphs and Hypergraphs'' 4:00 Pm in Skiles 269 (2013) (0)
1.2 SATISFIABILITY AND HARD-PROBLEM INSTANCES....... iv (2003) (0)
nowledge Compilation Horn Approximations (1999) (0)
A 20-Year Roadmap for AI Research (2020) (0)
Problem Structure � Backdoor Size � and Search Performance in Unsatis able CNFs A Case Study (2004) (0)

This paper list is powered by the following services:

Other Resources About Bart Selman

What Schools Are Affiliated With Bart Selman?

Bart Selman is affiliated with the following schools:

Bart Selman's Academic­Influence.com Rankings

Bart Selman's Degrees

Similar Degrees You Can Earn

Why Is Bart Selman Influential?

Bart Selman's Published Works

Published Works

Other Resources About Bart Selman

What Schools Are Affiliated With Bart Selman?

Bart Selman's AcademicInfluence.com Rankings