| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Bart Selman Ioannis A. Vetsikas , Bart Selman: A principled study of the design tradeoffs for autonomous trading agents. AAMAS 2003 : 473-480 Henry A. Kautz , Bart Selman: Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. CP 2003 : 1-18 Ryan Williams , Carla P. Gomes , Bart Selman: Backdoors To Typical Case Complexity. IJCAI 2003 : 1173-1178 Ramón Béjar , Carmel Domshlak , Cèsar Fernàndez , Carla P. Gomes , Bart Selman, M. Valls : Grid-based SensorDCSP. IJCAI 2003 : 1359-1361 Jordan Erenrich , Bart Selman: Sampling Combinatorial Spaces Using Biased Random Walks. IJCAI 2003 : 1376-1380 John E. Hopcroft , Omar Khan , Brian Kulis , Bart Selman: Natural communities in large linked networks. KDD 2003 : 541-546 Henry A. Kautz , Eric Horvitz , Yongshao Ruan , Carla P. Gomes , Bart Selman: Dynamic Restart Policies. AAAI/IAAI 2002 : 674-681 Wei Wei , Bart Selman: Accelerating Random Walks. CP 2002 : 216-232 Hubie Chen , Carla P. Gomes , Bart Selman: Formal Models of Heavy-Tailed Behavior in Combinatorial Search. CP 2001 : 408-421 Henry A. Kautz , Yongshao Ruan , Dimitris Achlioptas , Carla P. Gomes , Bart Selman, Mark E. Stickel : Balance and Filtering in Structured Satisfiable Problems. IJCAI 2001 : 351-358 Eric Horvitz , Yongshao Ruan , Carla P. Gomes , Henry A. Kautz , Bart Selman, David Maxwell Chickering : A Bayesian Approach to Tackling Hard Computational Problems. UAI 2001 : 235-244 Carla P. Gomes , Bart Selman: Algorithm portfolios. Artif. Intell. 126 (1-2): 43-62 (2001) Olivier Dubois , Rémi Monasson , Bart Selman, Riccardo Zecchina : Editorial. Theor. Comput. Sci. 265 (1-2): 1 (2001) Dimitris Achlioptas , Carla P. Gomes , Henry A. Kautz , Bart Selman: Generating Satisfiable Problem Instances. AAAI/IAAI 2000 : 256-261 Bhaskar Krishnamachari , Xi Xie , Bart Selman, Stephen B. Wicker : Analysis of Random Noise and Random Walk Algorithms. CP 2000 : 278-290 Yi-Cheng Huang , Bart Selman, Henry A. Kautz : Learning Declarative Control Rules for Constraint-BAsed Planning. ICML 2000 : 415-422 Bart Selman: Satisfiability Testing: Recent Developments and Challenge Problems. LICS 2000 : 178 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 : The AIPS-98 Planning Competition. AI Magazine 21 (2): 13-33 (2000) Bart Selman: Compute-intensive methods in artificial intelligence. Ann. Math. Artif. Intell. 28 (1-4): 35-38 (2000) Carla P. Gomes , Bart Selman: Hybrid Search Strategies for Heterogeneous Search Spaces. International Journal on Artificial Intelligence Tools 9 (1): 45-57 (2000) Carla P. Gomes , Bart Selman, Nuno Crato , Henry A. Kautz : Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. J. Autom. Reasoning 24 (1/2): 67-100 (2000) Yi-Cheng Huang , Bart Selman, Henry A. Kautz : Control Knowledge in Planning: Benefits and Tradeoffs. AAAI/IAAI 1999 : 511-517 Carla P. Gomes , Bart Selman: On the Fine Structure of Large Search Spaces. ICTAI 1999 : 197-201 Carla P. Gomes , Bart Selman: Search Strategies for Hybrid Search Spaces. ICTAI 1999 : 359-364 Henry A. Kautz , Bart Selman: Unifying SAT-based and Graph-based Planning. IJCAI 1999 : 318-325 Rémi Monasson , Riccardo Zecchina , Scott Kirkpatrick , Bart Selman, Lidror Troyansky : 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. Random Structures and Algorithms 15 (3-4): 414-435 (1999) Carla P. Gomes , Bart Selman, Henry A. Kautz : Boosting Combinatorial Search Through Randomization. AAAI/IAAI 1998 : 431-437 Henry A. Kautz , Bart Selman: The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. AIPS 1998 : 181-189 Carla P. Gomes , Bart Selman, Ken McAloon , Carol Tretkoff : Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. AIPS 1998 : 208-213 Carla P. Gomes , Bart Selman: Problem Structure in the Presence of Perturbations. AAAI/IAAI 1997 : 221-226 David A. McAllester , Bart Selman, Henry A. Kautz : Evidence for Invariants in Local Search. AAAI/IAAI 1997 : 321-326 Carla P. Gomes , Bart Selman, Nuno Crato : Heavy-Tailed Distributions in Combinatorial Search. CP 1997 : 121-135 Bart Selman, Henry A. Kautz , David A. McAllester : Ten Challenges in Propositional Reasoning and Search. IJCAI (1) 1997 : 50-54 Carla P. Gomes , Bart Selman: Algorithm Portfolio Design: Theory vs. Practice. UAI 1997 : 190-197 Henry A. Kautz , Bart Selman, Mehul A. Shah : The Hidden Web. AI Magazine 18 (2): 27-36 (1997) Henry A. Kautz , Bart Selman, Mehul A. Shah : Referral Web: Combining Social Networks and Collaborative Filtering. Commun. ACM 40 (3): 63-65 (1997) Henry A. Kautz , Bart Selman, Al Milewski : Agent Amplified Communication. AAAI/IAAI, Vol. 1 1996 : 3-9 Henry A. Kautz , Bart Selman: Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. AAAI/IAAI, Vol. 2 1996 : 1194-1201 Bart Selman, Rodney A. Brooks , Thomas Dean , Eric Horvitz , Tom M. Mitchell , Nils J. Nilsson : Challenge Problems for Artificial Intelligence (Panel Statements). AAAI/IAAI, Vol. 2 1996 : 1340-1345 Henry A. Kautz , David A. McAllester , Bart Selman: Encoding Plans in Propositional Logic. KR 1996 : 374-384 Bart Selman: Computational Challenges in Artificial Intelligence. ACM Comput. Surv. 28 (4es): 10 (1996) Bart Selman, David G. Mitchell , Hector J. Levesque : Generating Hard Satisfiability Problems. Artif. Intell. 81 (1-2): 17-29 (1996) Bart Selman, Scott Kirkpatrick : Critical Behavior in the Computational Cost of Satisfiability Testing. Artif. Intell. 81 (1-2): 273-295 (1996) Bart Selman, Hector J. Levesque : Support Set Selection for Abductive and Default Reasoning. Artif. Intell. 82 (1-2): 259-272 (1996) Bart Selman, Henry A. Kautz : Knowledge Compilation and Theory Approximation. J. ACM 43 (2): 193-224 (1996) Joann J. Ordille , Oswald Drobnik , Michael R. Genesereth , Y. Lashkari , Bart Selman: Intelligent Agents in Distributed Systems (Panel). ICDCS 1995 : 342 Eugene C. Freuder , Rina Dechter , Matthew L. Ginsberg , Bart Selman, Edward P. K. Tsang : Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995 : 2027-2032 Goran Gogic , Henry A. Kautz , Christos H. Papadimitriou , Bart Selman: The Comparative Linguistics of Knowledge Representation. IJCAI (1) 1995 : 862-869 Bart Selman: Stochastic Search and Phase Transitions: AI Meets Physics. IJCAI (1) 1995 : 998-1002 Henry A. Kautz , Michael J. Kearns , Bart Selman: Horn Approximations of Empirical Data. Artif. Intell. 74 (1): 129-145 (1995) Henry A. Kautz , Bart Selman: An Empirical Evaluation of Knowledge Compilation by Theory Approximation. AAAI 1994 : 155-161 Bart Selman, Henry A. Kautz , Bram Cohen : Noise Strategies for Improving Local Search. AAAI 1994 : 337-343 Henry A. Kautz , Bart Selman, Michael H. Coen , Steven P. Ketchpel , Chris Ramming : An Experiment in the Design of Software Agents. AAAI 1994 : 438-443 Bart Selman: Domain-Specific Complexity Tradeoffs. ECAI 1994 : 416-420 Bart Selman: Near-Optimal Plans, Tractability, and Reactivity. KR 1994 : 521-529 Henry A. Kautz , Bart Selman, Michael H. Coen : Bottom-Up Design of Software Agents. Commun. ACM 37 (7): 143-146 (1994) Henry A. Kautz , Michael J. Kearns , Bart Selman: Reasoning With Characteristic Models. AAAI 1993 : 34-39 Bart Selman, Henry A. Kautz : An Empirical Study of Greedy Local Search for Satisfiability Testing. AAAI 1993 : 46-51 Bart Selman: Non-Systematic Search Methods for Model Finding. ICTAI 1993 : 9 Bart Selman, Henry A. Kautz : Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. IJCAI 1993 : 290-295 Bart Selman, Hector J. Levesque : The Complexity of Path-Based Defeasible Inheritance. Artif. Intell. 62 (2): 303-339 (1993) Bart Selman, Hector J. Levesque , David G. Mitchell : A New Method for Solving Hard Satisfiability Problems. AAAI 1992 : 440-446 David G. Mitchell , Bart Selman, Hector J. Levesque : Hard and Easy Distributions of SAT Problems. AAAI 1992 : 459-465 Henry A. Kautz , Bart Selman: Forming Concepts for Fast Inference. AAAI 1992 : 786-793 Henry A. Kautz , Bart Selman: Planning as Satisfiability. ECAI 1992 : 359-363 Henry A. Kautz , Bart Selman: Forming Concepts for Fast Inference. ECAI Workshop on Knowledge Representation and Reasoning 1992 : 200-215 Bart Selman, Henry A. Kautz : Knowledge Compilation using Horn Approximations. AAAI 1991 : 904-909 Henry A. Kautz , Bart Selman: A General Framework for Knowledge Compilation. PDK 1991 : 287-300 Henry A. Kautz , Bart Selman: Hard Problems for Simple Default Logics. Artif. Intell. 49 (1-3): 243-279 (1991) Bart Selman, Hector J. Levesque : Abductive and Default Reasoning: A Computational Core. AAAI 1990 : 343-348 Bart Selman, Henry A. Kautz : Model-Preference Default Theories. Artif. Intell. 45 (3): 287-322 (1990) Bart Selman, Hector J. Levesque : The Tractability of Path-Based Inheritance. IJCAI 1989 : 1140-1145 Henry A. Kautz , Bart Selman: Hard Problems for Simple Default Logics. KR 1989 : 189-197 Bart Selman, Henry A. Kautz : The Complexity of Model-Preference Default Theories. NMR 1988 : 115-130 1 [ 61 ] [ 65 ] 2 [ 57 ] 3 [ 71 ] 4 [ 57 ] 5 [ 57 ] 6 [ 36 ] 7 [ 66 ] 8 [ 64 ] 9 [ 19 ] [ 22 ] 10 [ 23 ] 11 [ 43 ] [ 54 ] 12 [ 36 ] 13 [ 28 ] 14 [ 71 ] 15 [ 29 ] 16 [ 62 ] 17 [ 70 ] 18 [ 71 ] 19 [ 57 ] 20 [ 28 ] 21 [ 57 ] 22 [ 29 ] 23 [ 28 ] 24 [ 27 ] 25 [ 41 ] [ 43 ] [ 45 ] [ 46 ] [ 48 ] [ 51 ] [ 52 ] [ 54 ] [ 55 ] [ 61 ] [ 63 ] [ 64 ] [ 65 ] [ 66 ] [ 68 ] [ 71 ] [ 72 ] 26 [ 57 ] 27 [ 69 ] 28 [ 36 ] [ 64 ] [ 68 ] 29 [ 53 ] [ 59 ] 30 [ 1 ] [ 2 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 15 ] [ 17 ] [ 18 ] [ 19 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 27 ] [ 30 ] [ 35 ] [ 37 ] [ 38 ] [ 39 ] [ 40 ] [ 42 ] [ 44 ] [ 47 ] [ 48 ] [ 50 ] [ 53 ] [ 54 ] [ 57 ] [ 59 ] [ 61 ] [ 64 ] [ 65 ] [ 68 ] [ 73 ] 31 [ 18 ] [ 25 ] 32 [ 22 ] 33 [ 69 ] 34 [ 32 ] [ 49 ] 35 [ 57 ] 36 [ 60 ] 37 [ 69 ] 38 [ 29 ] 39 [ 3 ] [ 5 ] [ 12 ] [ 13 ] [ 14 ] [ 31 ] [ 33 ] 40 [ 57 ] 41 [ 35 ] [ 42 ] [ 44 ] 42 [ 46 ] 43 [ 38 ] 44 [ 12 ] [ 13 ] [ 33 ] 45 [ 36 ] 46 [ 49 ] [ 62 ] 47 [ 36 ] 48 [ 29 ] 49 [ 27 ] 50 [ 22 ] 51 [ 57 ] 52 [ 64 ] [ 65 ] [ 68 ] 53 [ 39 ] [ 40 ] 54 [ 57 ] 55 [ 65 ] 56 [ 46 ] 57 [ 49 ] 58 [ 28 ] 59 [ 71 ] 60 [ 74 ] 61 [ 67 ] 62 [ 57 ] 63 [ 60 ] 64 [ 72 ] 65 [ 60 ] 66 [ 49 ] [ 62 ]  ©2004 Association for Computing Machinery |
