Bart Selman
Bart Selman,
an American computer scientist with Dutch roots, and professor at Cornell University, previously AI researcher at AT&T Bell Laboratories. His research interests include computational sustainability, efficient reasoning procedures, SAT solvers, planning, knowledge representation, and connections between computer science and statistical physics [2]. He holds a B.Sc. in physics from Delft University of Technology in 1983, and a M.Sc. and Ph.D. in CS both from University of Toronto in 1985 and 1991 respectively. Along with Raghuram Ramanujan and Ashish Sabharwal, Bart Selman researched and published on properties of adversarial search spaces that play a key role in the success or failure of UCT and similar sampling-based approaches [3].
Selected Publications
1990 ...
- Bart Selman (1991). Tractable Default Reasoning. Ph.D. thesis, University of Toronto, advisor: Hector Levesque, ps
- Bart Selman, Hector Levesque, David G. Mitchell (1992). A New Method for Solving Hard Satisfiability Problems. AAAI 1992, pdf
- David G. Mitchell, Bart Selman, Hector Levesque (1992). Hard and Easy Distributions of SAT Problems. AAAI 1992, pdf
- Bart Selman (1995). Stochastic Search and Phase Transitions: AI Meets Physics. IJCAI-95, pdf
- Henry Kautz, Bart Selman (1996). Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. AAAI 1996, pdf
- Bart Selman, Henry Kautz, David McAllester (1997). Ten Challenges in Propositional Reasoning and Search. IJCAI-97, pdf
2000 ...
- Bart Selman (2000). Compute-intensive Methods in Artificial Intelligence. Annals of Mathematics and Artificial Intelligence, Vol. 28, Nos. 1-4, pdf
- Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière (2004). Statistical Regimes Across Constrainedness Regions. CP 2004, pdf
- Carla P. Gomes, Ashish Sabharwal, Bart Selman (2006). Model Counting: A New Strategy for Obtaining Good Bounds. AAAI 2006, pdf, slides as pdf
- Lukas Kroc, Ashish Sabharwal, Bart Selman (2008, 2011). Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008, Annals of Operations Research, Vol. 184
2010 ...
- Raghuram Ramanujan, Ashish Sabharwal, Bart Selman (2010). On Adversarial Search Spaces and Sampling-Based Planning. ICAPS 2010 [6]
- Raghuram Ramanujan, Bart Selman (2011). Trade-Offs in Sampling-Based Adversarial Planning. ICAPS 2011, best paper, VideoLecture
- Stefano Ermon, Jon Conrad, Carla P. Gomes, Bart Selman (2012). Playing games against nature: optimal policies for renewable resource allocation. arXiv:1203.3478
- Raghuram Ramanujan, Ashish Sabharwal, Bart Selman (2012). Understanding Sampling Style Adversarial Search Methods. arXiv:1203.4011
External Links
- Bart Selman's Home Page
- Bart Selman's older Home Page
- Bart Selman - Annual report 1997
- Bart Selman from Wikipedia
- Bart Selman | LinkedIn
- Bart Selman - Google Scholar Citations
- Bill Gates Visit Oct 2014: NSF Expeditions in Computing: Computational Sustainability, ICS, October 2014
- Bart Selman wins IJCAI John McCarthy Research Award, ICS, April 02, 2015
- Jonathan Gomes Selman explores the power of computer science by Patricia Waldron, Boyce Thompson Institute, August 17, 2015
- Artificial Intelligence Just Mastered Go, But One Game Still Gives AI Trouble by Carl Engelking, The Crux, January 27, 2016 » AlphaGo, Poker, Jonathan Schaeffer
References
- ↑ Bart Selman | LinkedIn
- ↑ Bart Selman's Home Page - Bio
- ↑ Raghuram Ramanujan, Ashish Sabharwal, Bart Selman (2010). On Adversarial Search Spaces and Sampling-Based Planning. ICAPS 2010
- ↑ dblp: Bart Selman
- ↑ Papers by Bart Selman
- ↑ Search traps in MCTS and chess by Daniel Shawul, CCC, December 25, 2017
