Bart Selman

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
127A message passing approach to multiagent gaussian inference for dynamic processes. Stefano Ermon, Carla P. Gomes, Bart Selman. AAMAS 2011, 1277-1278. Web SearchBibTeXDownload
126Monte-Carlo Style UCT Search for Boolean Satisfiability. Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman. AI*IA 2011, 177-188. Web SearchBibTeXDownload
125Leveraging belief propagation, backtrack search, and statistics for model counting. Lukas Kroc, Ashish Sabharwal, Bart Selman. Annals OR (184): 209-231 (2011). Web SearchBibTeXDownload
124S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition. Ashish Sabharwal, Bart Selman. Artif. Intell. (175): 935-937 (2011). Web SearchBibTeXDownload
123Human Activity Detection from RGBD Images. Jaeyong Sung, Colin Ponce, Bart Selman, Ashutosh Saxena. CoRR (abs/1107.0169) (2011). Web SearchBibTeXDownload
122Trade-Offs in Sampling-Based Adversarial Planning. Raghuram Ramanujan, Bart Selman. ICAPS 2011. Web SearchBibTeXDownload
121Risk-Sensitive Policies for Sustainable Renewable Resource Allocation. Stefano Ermon, Jon Conrad, Carla P. Gomes, Bart Selman. IJCAI 2011, 1942-1948. Web SearchBibTeXDownload
120A Flat Histogram Method for Computing the Density of States of Combinatorial Problems. Stefano Ermon, Carla P. Gomes, Bart Selman. IJCAI 2011, 2608-2613. Web SearchBibTeXDownload
119Applying UCT to Boolean Satisfiability. Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman. SAT 2011, 373-374. Web SearchBibTeXDownload
2010
118Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation. Stefano Ermon, Carla P. Gomes, Bart Selman. AAMAS 2010, 1419-1420. Web SearchBibTeXDownload
117Special issue on learning and intelligent optimization. Roberto Battiti, Bart Selman, Thomas Stützle. Ann. Math. Artif. Intell. (60): 1-2 (2010). Web SearchBibTeXDownload
116Computing the Density of States of Boolean Formulas. Stefano Ermon, Carla P. Gomes, Bart Selman. CP 2010, 38-52. Web SearchBibTeXDownload
115On Adversarial Search Spaces and Sampling-Based Planning. Raghuram Ramanujan, Ashish Sabharwal, Bart Selman. ICAPS 2010, 242-245. Web SearchBibTeXDownload
114An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. Lukas Kroc, Ashish Sabharwal, Bart Selman. SAT 2010, 346-351. Web SearchBibTeXDownload
113Understanding Sampling Style Adversarial Search Methods. Raghuram Ramanujan, Ashish Sabharwal, Bart Selman. UAI 2010, 474-483. Web SearchBibTeXDownload
112Playing games against nature: optimal policies for renewable resource allocation. Stefano Ermon, Jon Conrad, Carla Gomes, Bart Selman. UAI 2010, 168-176. Web SearchBibTeXDownload
2009
111Incomplete Algorithms. Henry A. Kautz, Ashish Sabharwal, Bart Selman. Handbook of Satisfiability 2009, 185-203. Web SearchBibTeXDownload
110Model Counting. Carla P. Gomes, Ashish Sabharwal, Bart Selman. Handbook of Satisfiability 2009, 633-654. Web SearchBibTeXDownload
109Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. Lukas Kroc, Ashish Sabharwal, Carla P. Gomes, Bart Selman. IJCAI 2009, 544-551. Web SearchBibTeXDownload
108Message-passing and local heuristics as decimation strategies for satisfiability. Lukas Kroc, Ashish Sabharwal, Bart Selman. SAC 2009, 1408-1414. Web SearchBibTeXDownload
107Relaxed DPLL Search for MaxSAT. Lukas Kroc, Ashish Sabharwal, Bart Selman. SAT 2009, 447-452. Web SearchBibTeXDownload
2008
106Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. Lukas Kroc, Ashish Sabharwal, Bart Selman. CPAIOR 2008, 127-141. Web SearchBibTeXDownload
105Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. Lukas Kroc, Ashish Sabharwal, Bart Selman. NIPS 2008, 873-880. Web SearchBibTeXDownload
2007
104Counting CSP Solutions Using Generalized XOR Constraints. Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman. AAAI 2007, 204-209. Web SearchBibTeX
103Optimal Multi-Agent Scheduling with Constraint Programming. Willem Jan van Hoeve, Carla P. Gomes, Bart Selman, Michele Lombardi. AAAI 2007, 1813-1818. Web SearchBibTeX
102Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in<br> SAT-Based Planning. Jörg Hoffmann, Carla P. Gomes, Bart Selman. CoRR (abs/cs/0701184) (2007). Web SearchBibTeXDownload
101The state of SAT. Henry A. Kautz, Bart Selman. Discrete Applied Mathematics (155): 1514-1524 (2007). Web SearchBibTeXDownload
100ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming. Yunsong Guo, Bart Selman. ICTAI (2) 2007, 226-229. Web SearchBibTeXDownload
99Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. Ioannis A. Vetsikas, Nicholas R. Jennings, Bart Selman. IJCAI 2007, 1543-1550. Web SearchBibTeXDownload
98From Sampling to Model Counting. Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman. IJCAI 2007, 2293-2299. Web SearchBibTeXDownload
97SAT Encodings of State-Space Reachability Problems in Numeric Domains. Jörg Hoffmann, Carla P. Gomes, Bart Selman, Henry A. Kautz. IJCAI 2007, 1918-1923. Web SearchBibTeXDownload
96Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. Jörg Hoffmann, Carla P. Gomes, Bart Selman. Logical Methods in Computer Science (3) (2007). Web SearchBibTeXDownload
95Sampling and Soundness: Can We Have Both?. Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman. New Forms of Reasoning for the Semantic Web 2007. Web SearchBibTeXDownload
94Short XORs for Model Counting: From Theory to Practice. Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman. SAT 2007, 100-106. Web SearchBibTeXDownload
93Bayes-Nash equilibria for mth price auctions with multiple closing times. Ioannis A. Vetsikas, Bart Selman. SIGecom Exchanges (6): 27-36 (2007). Web SearchBibTeXDownload
92Survey Propagation Revisited. Lukas Kroc, Ashish Sabharwal, Bart Selman. UAI 2007, 217-226. Web SearchBibTeXDownload
2006
91Model Counting: A New Strategy for Obtaining Good Bounds. Carla P. Gomes, Ashish Sabharwal, Bart Selman. AAAI 2006. Web SearchBibTeX
90Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. Jörg Hoffmann, Carla P. Gomes, Bart Selman. ICAPS 2006, 284-293. Web SearchBibTeX
89Integration of Learning and Reasoning Techniques. Bart Selman. ILP 2006, 25. Web SearchBibTeXDownload
88Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. Carla P. Gomes, Ashish Sabharwal, Bart Selman. NIPS 2006, 481-488. Web SearchBibTeXDownload
87QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman. SAT 2006, 382-395. Web SearchBibTeXDownload
2005
86The Achilles' Heel of QBF. Carlos Ansótegui, Carla P. Gomes, Bart Selman. AAAI 2005, 275-281. Web SearchBibTeX
85Sensor 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. (161): 117-147 (2005). Web SearchBibTeXDownload
84Statistical Regimes Across Constrainedness Regions. Carla P. Gomes, Cčsar Fernández, Bart Selman, Christian Bessičre. Constraints (10): 317-337 (2005). Web SearchBibTeXDownload
83Autonomous trading agent design in the presence of tradeoffs. Ioannis A. Vetsikas, Bart Selman. ICEC 2005, 293-299. Web SearchBibTeXDownload
82Regular Random k-SAT: Properties of Balanced Formulas. Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman. J. Autom. Reasoning (35): 181-200 (2005). Web SearchBibTeXDownload
81A New Approach to Model Counting. Wei Wei, Bart Selman. SAT 2005, 324-339. Web SearchBibTeXDownload
2004
80Towards Efficient Sampling: Exploiting Random Walk Strategies. Wei Wei, Jordan Erenrich, Bart Selman. AAAI 2004, 670-676. Web SearchBibTeX
79A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents. Ioannis A. Vetsikas, Bart Selman. AAMAS 2004, 1286-1287. Web SearchBibTeXDownload
78Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. Bart Selman. CP 2004, 9-12. Web SearchBibTeXDownload
77Statistical Regimes Across Constrainedness Regions. Carla P. Gomes, Cčsar Fernández, Bart Selman, Christian Bessičre. CP 2004, 32-46. Web SearchBibTeXDownload
76From Spin Glasses to Hard Satisfiable Formulas. Haixia Jia, Cristopher Moore, Bart Selman. SAT 2004. Web SearchBibTeXDownload
2003
75A principled study of the design tradeoffs for autonomous trading agents. Ioannis A. Vetsikas, Bart Selman. AAMAS 2003, 473-480. Web SearchBibTeXDownload
74Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. Henry A. Kautz, Bart Selman. CP 2003, 1-18. Web SearchBibTeXDownload
73Grid-based SensorDCSP. Ramón Béjar, Carmel Domshlak, Cčsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls. IJCAI 2003, 1359-1361. Web SearchBibTeX
72Sampling Combinatorial Spaces Using Biased Random Walks. Jordan Erenrich, Bart Selman. IJCAI 2003, 1376-1380. Web SearchBibTeX
71Backdoors To Typical Case Complexity. Ryan Williams, Carla P. Gomes, Bart Selman. IJCAI 2003, 1173-1178. Web SearchBibTeX
70Natural communities in large linked networks. John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman. KDD 2003, 541-546. Web SearchBibTeXDownload
2002
69Dynamic Restart Policies. Henry A. Kautz, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Bart Selman. AAAI/IAAI 2002, 674-681. Web SearchBibTeX
68Accelerating Random Walks. Wei Wei, Bart Selman. CP 2002, 216-232. Web SearchBibTeXDownload
2001
67Algorithm portfolios. Carla P. Gomes, Bart Selman. Artif. Intell. (126): 43-62 (2001). Web SearchBibTeXDownload
66Formal Models of Heavy-Tailed Behavior in Combinatorial Search. Hubie Chen, Carla P. Gomes, Bart Selman. CP 2001, 408-421. Web SearchBibTeXDownload
65A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering. Electronic Notes in Discrete Mathematics (9): 376-391 (2001). Web SearchBibTeXDownload
64Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel. Electronic Notes in Discrete Mathematics (9): 2-18 (2001). Web SearchBibTeXDownload
63Preface: Volume 9. Henry A. Kautz, Bart Selman. Electronic Notes in Discrete Mathematics (9): 1 (2001). Web SearchBibTeXDownload
62Balance and Filtering in Structured Satisfiable Problems. Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel. IJCAI 2001, 351-358. Web SearchBibTeX
61A Bayesian Approach to Tackling Hard Computational Problems. Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering. UAI 2001, 235-244. Web SearchBibTeXDownload
2000
60Generating Satisfiable Problem Instances. Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman. AAAI/IAAI 2000, 256-261. Web SearchBibTeX
59The AIPS-98 Planning Competition. Derek Long, Henry A. Kautz, Bart Selman, Blai Bonet, Hector Geffner, Jana Koehler, Michael Brenner, Jörg Hoffmann, Frank Rittinger, Corin R. Anderson, Daniel S. Weld, David E. Smith, Maria Fox. AI Magazine (21): 13-33 (2000). Web SearchBibTeXDownload
58Compute-intensive methods in artificial intelligence. Bart Selman. Ann. Math. Artif. Intell. (28): 35-38 (2000). Web SearchBibTeXDownload
57Analysis of Random Noise and Random Walk Algorithms. Bhaskar Krishnamachari, Xi Xie, Bart Selman, Stephen B. Wicker. CP 2000, 278-290. Web SearchBibTeXDownload
56Learning Declarative Control Rules for Constraint-BAsed Planning. Yi-Cheng Huang, Bart Selman, Henry A. Kautz. ICML 2000, 415-422. Web SearchBibTeX
55Hybrid Search Strategies for Heterogeneous Search Spaces. Carla P. Gomes, Bart Selman. International Journal on Artificial Intelligence Tools (9): 45-57 (2000). Web SearchBibTeX
54Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. Kautz. J. Autom. Reasoning (24): 67-100 (2000). Web SearchBibTeXDownload
53Satisfiability Testing: Recent Developments and Challenge Problems. Bart Selman. LICS 2000, 178. Web SearchBibTeXDownload
1999
52Control Knowledge in Planning: Benefits and Tradeoffs. Yi-Cheng Huang, Bart Selman, Henry A. Kautz. AAAI/IAAI 1999, 511-517. Web SearchBibTeX
51On the Fine Structure of Large Search Spaces. Carla P. Gomes, Bart Selman. ICTAI 1999, 197-201. Web SearchBibTeXDownload
50Search Strategies for Hybrid Search Spaces. Carla P. Gomes, Bart Selman. ICTAI 1999, 359-364. Web SearchBibTeXDownload
49Unifying SAT-based and Graph-based Planning. Henry A. Kautz, Bart Selman. IJCAI 1999, 318-325. Web SearchBibTeX
482+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 (15): 414-435 (1999). Web SearchBibTeX
1998
47Boosting Combinatorial Search Through Randomization. Carla P. Gomes, Bart Selman, Henry A. Kautz. AAAI/IAAI 1998, 431-437. Web SearchBibTeX
46Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tretkoff. AIPS 1998, 208-213. Web SearchBibTeX
45The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. Henry A. Kautz, Bart Selman. AIPS 1998, 181-189. Web SearchBibTeX
1997
44Evidence for Invariants in Local Search. David A. McAllester, Bart Selman, Henry A. Kautz. AAAI/IAAI 1997, 321-326. Web SearchBibTeX
43Problem Structure in the Presence of Perturbations. Carla P. Gomes, Bart Selman. AAAI/IAAI 1997, 221-226. Web SearchBibTeX
42The Hidden Web. Henry A. Kautz, Bart Selman, Mehul A. Shah. AI Magazine (18): 27-36 (1997). Cited by 258Web SearchBibTeXDownload
41Referral Web: Combining Social Networks and Collaborative Filtering. Henry A. Kautz, Bart Selman, Mehul A. Shah. Commun. ACM (40): 63-65 (1997). Cited by 556Web SearchBibTeXDownload
40Heavy-Tailed Distributions in Combinatorial Search. Carla P. Gomes, Bart Selman, Nuno Crato. CP 1997, 121-135. Web SearchBibTeXDownload
39Ten Challenges in Propositional Reasoning and Search. Bart Selman, Henry A. Kautz, David A. McAllester. IJCAI (1) 1997, 50-54. Web SearchBibTeX
38Algorithm Portfolio Design: Theory vs. Practice. Carla P. Gomes, Bart Selman. UAI 1997, 190-197. Web SearchBibTeXDownload
1996
37Agent Amplified Communication. Henry A. Kautz, Bart Selman, Al Milewski. AAAI/IAAI, Vol. 1 1996, 3-9. Web SearchBibTeX
36Challenge Problems for Artificial Intelligence (Panel Statements). Bart Selman, Rodney A. Brooks, Thomas Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson. AAAI/IAAI, Vol. 2 1996, 1340-1345. Web SearchBibTeX
35Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. Henry A. Kautz, Bart Selman. AAAI/IAAI, Vol. 2 1996, 1194-1201. Web SearchBibTeX
34Computational Challenges in Artificial Intelligence. Bart Selman. ACM Comput. Surv. (28): 10 (1996). Web SearchBibTeXDownload
33Support Set Selection for Abductive and Default Reasoning. Bart Selman, Hector J. Levesque. Artif. Intell. (82): 259-272 (1996). Web SearchBibTeXDownload
32Generating Hard Satisfiability Problems. Bart Selman, David G. Mitchell, Hector J. Levesque. Artif. Intell. (81): 17-29 (1996). Web SearchBibTeXDownload
31Critical Behavior in the Computational Cost of Satisfiability Testing. Bart Selman, Scott Kirkpatrick. Artif. Intell. (81): 273-295 (1996). Web SearchBibTeXDownload
30Knowledge Compilation and Theory Approximation. Bart Selman, Henry A. Kautz. J. ACM (43): 193-224 (1996). Web SearchBibTeXDownload
29Encoding Plans in Propositional Logic. Henry A. Kautz, David A. McAllester, Bart Selman. KR 1996, 374-384. Web SearchBibTeX
1995
28Horn Approximations of Empirical Data. Henry A. Kautz, Michael J. Kearns, Bart Selman. Artif. Intell. (74): 129-145 (1995). Web SearchBibTeXDownload
27Intelligent Agents in Distributed Systems (Panel). Joann J. Ordille, Oswald Drobnik, Michael R. Genesereth, Y. Lashkari, Bart Selman. ICDCS 1995, 342. Web SearchBibTeX
26Systematic Versus Stochastic Constraint Satisfaction. Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang. IJCAI 1995, 2027-2032. Web SearchBibTeX
25The Comparative Linguistics of Knowledge Representation. Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, Bart Selman. IJCAI (1) 1995, 862-869. Web SearchBibTeX
24Stochastic Search and Phase Transitions: AI Meets Physics. Bart Selman. IJCAI (1) 1995, 998-1002. Web SearchBibTeX
1994
23An Empirical Evaluation of Knowledge Compilation by Theory Approximation. Henry A. Kautz, Bart Selman. AAAI 1994, 155-161. Web SearchBibTeX
22An Experiment in the Design of Software Agents. Henry A. Kautz, Bart Selman, Michael H. Coen, Steven P. Ketchpel, Chris Ramming. AAAI 1994, 438-443. Web SearchBibTeX
21Noise Strategies for Improving Local Search. Bart Selman, Henry A. Kautz, Bram Cohen. AAAI 1994, 337-343. Web SearchBibTeX
20Bottom-Up Design of Software Agents. Henry A. Kautz, Bart Selman, Michael H. Coen. Commun. ACM (37): 143-146 (1994). Web SearchBibTeXDownload
19Domain-Specific Complexity Tradeoffs. Bart Selman. ECAI 1994, 416-420. Web SearchBibTeX
18Near-Optimal Plans, Tractability, and Reactivity. Bart Selman. KR 1994, 521-529. Web SearchBibTeX
1993
17An Empirical Study of Greedy Local Search for Satisfiability Testing. Bart Selman, Henry A. Kautz. AAAI 1993, 46-51. Web SearchBibTeX
16Reasoning With Characteristic Models. Henry A. Kautz, Michael J. Kearns, Bart Selman. AAAI 1993, 34-39. Web SearchBibTeX
15The Complexity of Path-Based Defeasible Inheritance. Bart Selman, Hector J. Levesque. Artif. Intell. (62): 303-339 (1993). Web SearchBibTeXDownload
14Non-Systematic Search Methods for Model Finding. Bart Selman. ICTAI 1993, 9. Web SearchBibTeX
13Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. Bart Selman, Henry A. Kautz. IJCAI 1993, 290-295. Web SearchBibTeX
1992
12Forming Concepts for Fast Inference. Henry A. Kautz, Bart Selman. AAAI 1992, 786-793. Web SearchBibTeX
11Hard and Easy Distributions of SAT Problems. David G. Mitchell, Bart Selman, Hector J. Levesque. AAAI 1992, 459-465. Web SearchBibTeX
10A New Method for Solving Hard Satisfiability Problems. Bart Selman, Hector J. Levesque, David G. Mitchell. AAAI 1992, 440-446. Web SearchBibTeX
9Planning as Satisfiability. Henry A. Kautz, Bart Selman. ECAI 1992, 359-363. Web SearchBibTeX
1991
8Knowledge Compilation using Horn Approximations. Bart Selman, Henry A. Kautz. AAAI 1991, 904-909. Web SearchBibTeX
7Hard Problems for Simple Default Logics. Henry A. Kautz, Bart Selman. Artif. Intell. (49): 243-279 (1991). Web SearchBibTeXDownload
6A General Framework for Knowledge Compilation. Henry A. Kautz, Bart Selman. PDK 1991, 287-300. Web SearchBibTeXDownload
1990
5Abductive and Default Reasoning: A Computational Core. Bart Selman, Hector J. Levesque. AAAI 1990, 343-348. Web SearchBibTeX
4Model-Preference Default Theories. Bart Selman, Henry A. Kautz. Artif. Intell. (45): 287-322 (1990). Web SearchBibTeXDownload
1989
3The Tractability of Path-Based Inheritance. Bart Selman, Hector J. Levesque. IJCAI 1989, 1140-1145. Web SearchBibTeX
2Hard Problems for Simple Default Logics. Henry A. Kautz, Bart Selman. KR 1989, 189-197. Web SearchBibTeX
1988
1The Complexity of Model-Preference Default Theories. Bart Selman, Henry A. Kautz. NMR 1988, 115-130. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ AAAI-08 – IAAI-08 Organizing and Program Committees - Retrieved 2011-03-23 - details
2. ^ AAAI-07 / IAAI-07 Conference Officials - Retrieved 2011-04-08 - details
3. ^ AAAI-06 Conference Officials and Committee - Retrieved 2010-11-02 - details
4. ^ AAAI-08: Tutorial Forum - Retrieved 2011-03-23 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research