Bart Selman

According to our database1, Bart Selman authored at least 187 papers between 1988 and 2018.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2012, "For contributions to artificial intelligence with applications to automated reasoning and planning.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Watch-n-Patch: Unsupervised Learning of Actions and Relations.
IEEE Trans. Pattern Anal. Mach. Intell., 2018

Understanding Batch Normalization.
CoRR, 2018

2017
XOR-Sampling for Network Design with Correlated Stochastic Events.
CoRR, 2017

XOR-Sampling for Network Design with Correlated Stochastic Events.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Solving Marginal MAP Problems with NP Oracles and Parity Constraints.
CoRR, 2016

Watch-n-Patch: Unsupervised Learning of Actions and Relations.
CoRR, 2016

Solving Marginal MAP Problems with NP Oracles and Parity Constraints.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Watch-Bot: Unsupervised learning for reminding humans of forgotten actions.
Proceedings of the 2016 IEEE International Conference on Robotics and Automation, 2016

Variable Elimination in the Fourier Domain.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Variable Elimination in Fourier Domain.
CoRR, 2015

Watch-Bot: Unsupervised Learning for Reminding Humans of Forgotten Actions.
CoRR, 2015

Letter to the Editor: Research Priorities for Robust and Beneficial Artificial Intelligence: An Open Letter.
AI Magazine, 2015

Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem: Application to Materials Discovery.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem.
Proceedings of the Computational Sustainability, 2015

Pattern Decomposition with Complex Combinatorial Constraints: Application to Materials Discovery.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Pattern Decomposition with Complex Combinatorial Constraints: Application to Materials Discovery.
CoRR, 2014

On the Erdos Discrepancy Problem.
CoRR, 2014

Synthesizing manipulation sequences for under-specified tasks using unrolled Markov Random Fields.
Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

Low-density Parity Constraints for Hashing-Based Discrete Integration.
Proceedings of the 31th International Conference on Machine Learning, 2014

A Human Computation Framework for Boosting Combinatorial Solvers.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

On the Erdős Discrepancy Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Uncovering Hidden Structure through Parallel Problem Decomposition.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Designing Fast Absorbing Markov Chains.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Challenges in Materials Discovery - Synthetic Generator and Real Datasets.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Learning policies for battery usage optimization in electric vehicles.
Machine Learning, 2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization
CoRR, 2013

Algorithm Portfolio Design: Theory vs. Practice
CoRR, 2013

A Bayesian Approach to Tackling Hard Computational Problems
CoRR, 2013

Learning Sequences of Controllers for Complex Manipulation Tasks.
CoRR, 2013

Optimization With Parity Constraints: From Binary Codes to Discrete Integration.
CoRR, 2013

Optimization With Parity Constraints: From Binary Codes to Discrete Integration.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Embed and Project: Discrete Sampling with Universal Hashing.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Double-Wheel Graphs Are Graceful.
Proceedings of the IJCAI 2013, 2013

Crowdsourcing Backdoor Identification for Combinatorial Optimization.
Proceedings of the IJCAI 2013, 2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Uniform Solution Sampling Using a Constraint Solver As an Oracle
CoRR, 2012

Survey Propagation Revisited
CoRR, 2012

Understanding Sampling Style Adversarial Search Methods
CoRR, 2012

Playing games against nature: optimal policies for renewable resource allocation
CoRR, 2012

Uniform Solution Sampling Using a Constraint Solver As an Oracle.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

SMT-Aided Combinatorial Materials Discovery.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Learning Policies for Battery Usage Optimization in Electric Vehicles.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Density Propagation and Improved Bounds on the Partition Function.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Unstructured human activity detection from RGBD images.
Proceedings of the IEEE International Conference on Robotics and Automation, 2012

Probabilistic planning with non-linear utility functions and worst-case guarantees.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

From Streamlined Combinatorial Search to Efficient Constructive Procedures.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Human Activity Detection from RGBD Images
CoRR, 2011

Leveraging belief propagation, backtrack search, and statistics for model counting.
Annals OR, 2011

S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition.
Artif. Intell., 2011

Applying UCT to Boolean Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Accelerated Adaptive Markov Chain for Partition Function Computation.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

A Flat Histogram Method for Computing the Density of States of Combinatorial Problems.
Proceedings of the IJCAI 2011, 2011

Risk-Sensitive Policies for Sustainable Renewable Resource Allocation.
Proceedings of the IJCAI 2011, 2011

A message passing approach to multiagent gaussian inference for dynamic processes.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Trade-Offs in Sampling-Based Adversarial Planning.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

Monte-Carlo Style UCT Search for Boolean Satisfiability.
Proceedings of the AI*IA 2011: Artificial Intelligence Around Man and Beyond, 2011

Human Activity Detection from RGBD Images.
Proceedings of the Plan, Activity, and Intent Recognition, 2011

2010
Special issue on learning and intelligent optimization.
Ann. Math. Artif. Intell., 2010

Understanding Sampling Style Adversarial Search Methods.
Proceedings of the UAI 2010, 2010

Playing games against nature: optimal policies for renewable resource allocation.
Proceedings of the UAI 2010, 2010

An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Computing the Density of States of Boolean Formulas.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

On Adversarial Search Spaces and Sampling-Based Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Approximate Inference for Clusters in Solution Spaces.
Proceedings of the Abstraction, 2010

2009
Incomplete Algorithms.
Proceedings of the Handbook of Satisfiability, 2009

Model Counting.
Proceedings of the Handbook of Satisfiability, 2009

Relaxed DPLL Search for MaxSAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Message-passing and local heuristics as decimation strategies for satisfiability.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT.
Proceedings of the IJCAI 2009, 2009

2008
Satisfiability Solvers.
Proceedings of the Handbook of Knowledge Representation, 2008

Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007
Bayes-Nash equilibria for mth price auctions with multiple closing times.
SIGecom Exchanges, 2007

Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Logical Methods in Computer Science, 2007

The state of SAT.
Discrete Applied Mathematics, 2007

Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
CoRR, 2007

Survey Propagation Revisited.
Proceedings of the UAI 2007, 2007

Sampling and Soundness: Can We Have Both?
Proceedings of the First International Workshop Workshop "New forms of reasoning for the Semantic Web: scalable, 2007

Short XORs for Model Counting: From Theory to Practice.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents.
Proceedings of the IJCAI 2007, 2007

SAT Encodings of State-Space Reachability Problems in Numeric Domains.
Proceedings of the IJCAI 2007, 2007

From Sampling to Model Counting.
Proceedings of the IJCAI 2007, 2007

ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

Optimal Multi-Agent Scheduling with Constraint Programming.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Counting CSP Solutions Using Generalized XOR Constraints.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

Integration of Learning and Reasoning Techniques.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Constraint Programming for Distributed Planning and Scheduling.
Proceedings of the Distributed Plan and Schedule Management, 2006

Model Counting: A New Strategy for Obtaining Good Bounds.
Proceedings of the Proceedings, 2006

2005
Regular Random k-SAT: Properties of Balanced Formulas.
J. Autom. Reasoning, 2005

Statistical Regimes Across Constrainedness Regions.
Constraints, 2005

Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell., 2005

A New Approach to Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

The Achilles' Heel of QBF.
Proceedings of the Proceedings, 2005

Autonomous trading agent design in the presence of tradeoffs.
Proceedings of the 7th International Conference on Electronic Commerce, 2005

2004
From Spin Glasses to Hard Satisfiable Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

From Spin Glasses to Hard Satisfiable Formulas.
Proceedings of the SAT 2004, 2004

Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Statistical Regimes Across Constrainedness Regions.
Proceedings of the Principles and Practice of Constraint Programming, 2004

A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Towards Efficient Sampling: Exploiting Random Walk Strategies.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Natural communities in large linked networks.
Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24, 2003

Backdoors To Typical Case Complexity.
Proceedings of the IJCAI-03, 2003

Sampling Combinatorial Spaces Using Biased Random Walks.
Proceedings of the IJCAI-03, 2003

Grid-based SensorDCSP.
Proceedings of the IJCAI-03, 2003

Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search.
Proceedings of the Principles and Practice of Constraint Programming, 2003

A principled study of the design tradeoffs for autonomous trading agents.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

2002
Accelerating Random Walks.
Proceedings of the Principles and Practice of Constraint Programming, 2002

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

2001
Editorial.
Theor. Comput. Sci., 2001

Preface: Volume 9.
Electronic Notes in Discrete Mathematics, 2001

Balance and Filtering in Structured Satisfiable Problems (Preliminary Report).
Electronic Notes in Discrete Mathematics, 2001

A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report).
Electronic Notes in Discrete Mathematics, 2001

Algorithm portfolios.
Artif. Intell., 2001

A Bayesian Approach to Tackling Hard Computational Problems.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

Balance and Filtering in Structured Satisfiable Problems.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

Formal Models of Heavy-Tailed Behavior in Combinatorial Search.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems.
J. Autom. Reasoning, 2000

Hybrid Search Strategies for Heterogeneous Search Spaces.
International Journal on Artificial Intelligence Tools, 2000

Compute-intensive methods in artificial intelligence.
Ann. Math. Artif. Intell., 2000

The AIPS-98 Planning Competition.
AI Magazine, 2000

Satisfiability Testing: Recent Developments and Challenge Problems.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Learning Declarative Control Rules for Constraint-BAsed Planning.
Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

Analysis of Random Noise and Random Walk Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Generating Satisfiable Problem Instances.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition.
Random Struct. Algorithms, 1999

Unifying SAT-based and Graph-based Planning.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Search Strategies for Hybrid Search Spaces.
Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999

On the Fine Structure of Large Search Spaces.
Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999

Control Knowledge in Planning: Benefits and Tradeoffs.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999

1998
The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework.
Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 1998

Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems.
Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 1998

Boosting Combinatorial Search Through Randomization.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Referral Web: Combining Social Networks and Collaborative Filtering.
Commun. ACM, 1997

The Hidden Web.
AI Magazine, 1997

Algorithm Portfolio Design: Theory vs. Practice.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Ten Challenges in Propositional Reasoning and Search.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Heavy-Tailed Distributions in Combinatorial Search.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

Evidence for Invariants in Local Search.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

Problem Structure in the Presence of Perturbations.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Knowledge Compilation and Theory Approximation.
J. ACM, 1996

Computational Challenges in Artificial Intelligence.
ACM Comput. Surv., 1996

Generating Hard Satisfiability Problems.
Artif. Intell., 1996

Support Set Selection for Abductive and Default Reasoning.
Artif. Intell., 1996

Critical Behavior in the Computational Cost of Satisfiability Testing.
Artif. Intell., 1996

Encoding Plans in Propositional Logic.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

A general stochastic approach to solving problems with hard and soft constraints.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Challenge Problems for Artificial Intelligence (Panel Statements).
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

Agent Amplified Communication.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

Pushing the Envelope: Planning, Propositional Logic and Stochastic Search.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Horn Approximations of Empirical Data.
Artif. Intell., 1995

Stochastic Search and Phase Transitions: AI Meets Physics.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

The Comparative Linguistics of Knowledge Representation.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Systematic Versus Stochastic Constraint Satisfaction.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Intelligent Agents in Distributed Systems (Panel).
Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995

1994
Bottom-Up Design of Software Agents.
Commun. ACM, 1994

Near-Optimal Plans, Tractability, and Reactivity.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Domain-Specific Complexity Tradeoffs.
ECAI, 1994

Noise Strategies for Improving Local Search.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

An Experiment in the Design of Software Agents.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

An Empirical Evaluation of Knowledge Compilation by Theory Approximation.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
The Complexity of Path-Based Defeasible Inheritance.
Artif. Intell., 1993

Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

Non-Systematic Search Methods for Model Finding.
Proceedings of the Fifth International Conference on Tools with Artificial Intelligence, 1993

Local search strategies for satisfiability testing.
Proceedings of the Cliques, 1993

An Empirical Study of Greedy Local Search for Satisfiability Testing.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

Reasoning With Characteristic Models.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Forming Concepts for Fast Inference.
Proceedings of the Foundation of Knowledge Representation and Reasoning [the book grew out of an ECAI-92 workshop], 1992

Planning as Satisfiability.
ECAI, 1992

A New Method for Solving Hard Satisfiability Problems.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

Hard and Easy Distributions of SAT Problems.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

Forming Concepts for Fast Inference.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Hard Problems for Simple Default Logics.
Artif. Intell., 1991

A General Framework for Knowledge Compilation.
Proceedings of the Processing Declarative Knowledge, 1991

Knowledge Compilation using Horn Approximations.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Model-Preference Default Theories.
Artif. Intell., 1990

Abductive and Default Reasoning: A Computational Core.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989
Connectionist systems for natural language understanding.
Artif. Intell. Rev., 1989

Hard Problems for Simple Default Logics.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

The Tractability of Path-Based Inheritance.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988
The Complexity of Model-Preference Default Theories.
Proceedings of the Non-Monotonic Reasoning, 1988


  Loading...