Bart Selman
Bart Selman (born before 1983) is a Dutch-American computer scientist.
Selman studied physics at the TU Delft with a master’s degree in 1983 and computer science at the University of Toronto with a master’s degree in 1985 and a doctorate under Hector Levesque in 1991 (Tractable Default Reasoning). He was at ATT Laboratories and is a professor at Cornell University .
He deals with artificial intelligence , the connection between complexity theory and statistical physics, multi-agent systems , game theory, the SAT problem, computational sustainability (algorithmic studies on sustainability) and cognitive science.
He is a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI), the Association for Computing Machinery and, since 2003, the American Association for the Advancement of Science . In 2015 he received the John McCarthy Award . From 1999 to 2000 he was a Sloan Research Fellow .
Fonts (selection)
- with David G. Mitchell , Hector Levesque : A new method of solving hard satisfiability problems , 25th Conference Artificial Intelligence, AAAI 1992, pp. 440-446
- with D. Mitchell, H. Levesque: Hard and easy distribution of SAT problems , 25th Conference Artificial Intelligence, AAAI 1992, pp. 459-465
- with Henry Kautz : Planning as Satisfiability , ECAI 92, pp. 359–363
- with H. Kautz, B. Cohen: Local search strategies for satisfiability testing , in: Cliques, Coloring and Satisfiability, Volume 26, 1993, pp. 521-532
- with H. Kautz, B. Cohen: Noise strategies for improving local search , Conference Artificial Intelligence, AAAI 94, pp. 337-343
- with Scott Kirkpatrick : Critical behavior in the satisfiability of random boolean expressions , Science, Volume 264, 1994, pp. 1297-1300
- Stochastic Search and Phase Transitions: AI Meets Physics , IJCAI 1995
- with H. Kautz: Pushing the envelope: Planning, propositional logic, and stochastic search , Proceedings of the National Conference on Artificial Intelligence, AAAI 1996, pp. 1194-1201
- with H. Kautz, M. Shah: The hidden web , AI Magazine, Volume 18, 1997, p. 27
- with H. Kautz, M. Shah: Referral Web: combining social networks and collaborative filtering , Communications of the ACM, Volume 40, 1997, pp. 63-65
- with H. Kautz, David McAllester: Ten Challenges in Propositional Reasoning and Search. IJCAI-97
- with R. Monasson, R. Zeechina, Scott Kirkpatrick, L. Troyansky: Determining computational complexity from characteristic phase transitions , Nature, Volume 400, 1999, p. 133
- with H. Kautz: Unifying SAT-based and graph-based planning , IJCAI 99, pp. 318-325
- with Carla Gomes, Cesar Fernandez, Christian Bessiere: Statistical Regimes Across Constrainedness Regions , Proc. 10th Intl. Conf. on Principles and Practice of Constraint Programming (CP-04), Toronto, 2004.
- with Wei Wei, Jordan Erenrich: Towards Efficient Sampling: Exploiting Random Walk Strategies , Proc. AAAI-04. San Jose 2004.
- with John Hopcroft , Brian Kulis, Omar Khan: Tracking evolving communities in large linked networks , Proc. National Academy, Volume 101, 2004, pp. 5249-5253.
- with Ryan Williams, Carla Gomes: Backdoors To Typical Case Complexity , Proc. IJCAI-03 Acapulco, Mexico, 2003.
- with Cesar Fernandez, Ramon Bejar, Bhaskar Krishnamachari, Carla Gomes: Communication and computation in distributed CSP algorithms , In: V. Lesser, CL Ortiz, M. Tambe (eds.), Distributed Sensor Networks, A Multiagent Perspective. Kluwer Academic Publishers, 2003.
- with Ioannis A. Vetsikas: A principled study of the design tradeoffs for autonomous trading agents , Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, Melbourne, 2003
- with Carla Gomes: Satisfied with Physics , Science, Volume 297, 2002, pp. 784-785.
- with Wei Wei: Accelerating Random Walks , Proceedings of 8th International Conference on the Principles and Practice of Constraint Programming (CP-2002), 2002.
- with Henry Kautz , Eric Horvitz , Yongshao Ruan, Carla Gomes: Dynamic Restart Policies , Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02) Edmonton, Alberta, Canada, 2002, pp. 674-682.
- Model Counting: A New Strategy for Obtaining Good Bounds , Proceedings of the 21th National Conference on Artificial Intelligence, 2006
- with Stefano Ermon, Jon Conrad, Carla P. Gomes: Playing games against nature: optimal policies for renewable resource allocation, Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI 2010), Arxiv
- with Raghuram Ramanujan, Ashish Sabharwal: On Adversarial Search Spaces and Sampling-Based Planning, Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010)
Web links
Individual evidence
- ^ Whitebear Trading Agent, 2002 Trading Agent Competition winner
| personal data | |
|---|---|
| SURNAME | Selman, beard |
| BRIEF DESCRIPTION | Dutch-American computer scientist |
| DATE OF BIRTH | before 1983 |