2009 | ||
---|---|---|
109 | EE | Lukas Kroc, Ashish Sabharwal, Bart Selman: Message-passing and local heuristics as decimation strategies for satisfiability. SAC 2009: 1408-1414 |
2008 | ||
108 | EE | Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008: 127-141 |
107 | EE | Lukas Kroc, Ashish Sabharwal, Bart Selman: Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. NIPS 2008: 873-880 |
2007 | ||
106 | Willem Jan van Hoeve, Carla P. Gomes, Bart Selman, Michele Lombardi: Optimal Multi-Agent Scheduling with Constraint Programming. AAAI 2007: 1813-1818 | |
105 | Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman: Counting CSP Solutions Using Generalized XOR Constraints. AAAI 2007: 204-209 | |
104 | EE | Yunsong Guo, Bart Selman: ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming. ICTAI (2) 2007: 226-229 |
103 | EE | Ioannis A. Vetsikas, Nicholas R. Jennings, Bart Selman: Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. IJCAI 2007: 1543-1550 |
102 | EE | Jörg Hoffmann, Carla P. Gomes, Bart Selman, Henry A. Kautz: SAT Encodings of State-Space Reachability Problems in Numeric Domains. IJCAI 2007: 1918-1923 |
101 | EE | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: From Sampling to Model Counting. IJCAI 2007: 2293-2299 |
100 | EE | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Sampling and Soundness: Can We Have Both? New Forms of Reasoning for the Semantic Web 2007 |
99 | EE | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Short XORs for Model Counting: From Theory to Practice. SAT 2007: 100-106 |
98 | EE | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in<br> SAT-Based Planning CoRR abs/cs/0701184: (2007) |
97 | EE | Henry A. Kautz, Bart Selman: The state of SAT. Discrete Applied Mathematics 155(12): 1514-1524 (2007) |
96 | EE | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. Logical Methods in Computer Science 3(1): (2007) |
95 | EE | Ioannis A. Vetsikas, Bart Selman: Bayes-Nash equilibria for mth price auctions with multiple closing times. SIGecom Exchanges 6(2): 27-36 (2007) |
2006 | ||
94 | Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting: A New Strategy for Obtaining Good Bounds. AAAI 2006 | |
93 | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. ICAPS 2006: 284-293 | |
92 | EE | Bart Selman: Integration of Learning and Reasoning Techniques. ILP 2006: 25 |
91 | EE | Carla P. Gomes, Ashish Sabharwal, Bart Selman: Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. NIPS 2006: 481-488 |
90 | EE | Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. SAT 2006: 382-395 |
2005 | ||
89 | Carlos Ansótegui, Carla P. Gomes, Bart Selman: The Achilles' Heel of QBF. AAAI 2005: 275-281 | |
88 | EE | Ioannis A. Vetsikas, Bart Selman: Autonomous trading agent design in the presence of tradeoffs. ICEC 2005: 293-299 |
87 | EE | Wei Wei, Bart Selman: A New Approach to Model Counting. SAT 2005: 324-339 |
86 | EE | Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls: Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1-2): 117-147 (2005) |
85 | EE | Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. Constraints 10(4): 317-337 (2005) |
84 | EE | Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman: Regular Random k-SAT: Properties of Balanced Formulas. J. Autom. Reasoning 35(1-3): 181-200 (2005) |
2004 | ||
83 | Wei Wei, Jordan Erenrich, Bart Selman: Towards Efficient Sampling: Exploiting Random Walk Strategies. AAAI 2004: 670-676 | |
82 | EE | Ioannis A. Vetsikas, Bart Selman: A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents. AAMAS 2004: 1286-1287 |
81 | EE | Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. CP 2004: 32-46 |
80 | EE | Bart Selman: Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. CP 2004: 9-12 |
79 | EE | Haixia Jia, Cristopher Moore, Bart Selman: From Spin Glasses to Hard Satisfiable Formulas. SAT 2004 |
78 | EE | Haixia Jia, Cristopher Moore, Bart Selman: From Spin Glasses to Hard Satisfiable Formulas. SAT (Selected Papers 2004: 199-210 |
2003 | ||
77 | EE | Ioannis A. Vetsikas, Bart Selman: A principled study of the design tradeoffs for autonomous trading agents. AAMAS 2003: 473-480 |
76 | EE | Henry A. Kautz, Bart Selman: Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. CP 2003: 1-18 |
75 | Ryan Williams, Carla P. Gomes, Bart Selman: Backdoors To Typical Case Complexity. IJCAI 2003: 1173-1178 | |
74 | Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls: Grid-based SensorDCSP. IJCAI 2003: 1359-1361 | |
73 | Jordan Erenrich, Bart Selman: Sampling Combinatorial Spaces Using Biased Random Walks. IJCAI 2003: 1376-1380 | |
72 | EE | John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman: Natural communities in large linked networks. KDD 2003: 541-546 |
2002 | ||
71 | Henry A. Kautz, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Bart Selman: Dynamic Restart Policies. AAAI/IAAI 2002: 674-681 | |
70 | EE | Wei Wei, Bart Selman: Accelerating Random Walks. CP 2002: 216-232 |
2001 | ||
69 | EE | Hubie Chen, Carla P. Gomes, Bart Selman: Formal Models of Heavy-Tailed Behavior in Combinatorial Search. CP 2001: 408-421 |
68 | 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 | |
67 | EE | 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 |
66 | EE | Carla P. Gomes, Bart Selman: Algorithm portfolios. Artif. Intell. 126(1-2): 43-62 (2001) |
65 | EE | Henry A. Kautz, Bart Selman: Preface: Volume 9. Electronic Notes in Discrete Mathematics 9: 1 (2001) |
64 | EE | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel: Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Electronic Notes in Discrete Mathematics 9: 2-18 (2001) |
63 | EE | Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering: A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). Electronic Notes in Discrete Mathematics 9: 376-391 (2001) |
62 | EE | Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina: Editorial. Theor. Comput. Sci. 265(1-2): 1 (2001) |
2000 | ||
61 | Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman: Generating Satisfiable Problem Instances. AAAI/IAAI 2000: 256-261 | |
60 | EE | Bhaskar Krishnamachari, Xi Xie, Bart Selman, Stephen B. Wicker: Analysis of Random Noise and Random Walk Algorithms. CP 2000: 278-290 |
59 | Yi-Cheng Huang, Bart Selman, Henry A. Kautz: Learning Declarative Control Rules for Constraint-BAsed Planning. ICML 2000: 415-422 | |
58 | EE | Bart Selman: Satisfiability Testing: Recent Developments and Challenge Problems. LICS 2000: 178 |
57 | 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) | |
56 | Bart Selman: Compute-intensive methods in artificial intelligence. Ann. Math. Artif. Intell. 28(1-4): 35-38 (2000) | |
55 | Carla P. Gomes, Bart Selman: Hybrid Search Strategies for Heterogeneous Search Spaces. International Journal on Artificial Intelligence Tools 9(1): 45-57 (2000) | |
54 | 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) | |
1999 | ||
53 | Yi-Cheng Huang, Bart Selman, Henry A. Kautz: Control Knowledge in Planning: Benefits and Tradeoffs. AAAI/IAAI 1999: 511-517 | |
52 | EE | Carla P. Gomes, Bart Selman: On the Fine Structure of Large Search Spaces. ICTAI 1999: 197-201 |
51 | EE | Carla P. Gomes, Bart Selman: Search Strategies for Hybrid Search Spaces. ICTAI 1999: 359-364 |
50 | Henry A. Kautz, Bart Selman: Unifying SAT-based and Graph-based Planning. IJCAI 1999: 318-325 | |
49 | 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 Struct. Algorithms 15(3-4): 414-435 (1999) | |
1998 | ||
48 | Carla P. Gomes, Bart Selman, Henry A. Kautz: Boosting Combinatorial Search Through Randomization. AAAI/IAAI 1998: 431-437 | |
47 | Henry A. Kautz, Bart Selman: The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. AIPS 1998: 181-189 | |
46 | 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 | |
1997 | ||
45 | Carla P. Gomes, Bart Selman: Problem Structure in the Presence of Perturbations. AAAI/IAAI 1997: 221-226 | |
44 | David A. McAllester, Bart Selman, Henry A. Kautz: Evidence for Invariants in Local Search. AAAI/IAAI 1997: 321-326 | |
43 | Carla P. Gomes, Bart Selman, Nuno Crato: Heavy-Tailed Distributions in Combinatorial Search. CP 1997: 121-135 | |
42 | Bart Selman, Henry A. Kautz, David A. McAllester: Ten Challenges in Propositional Reasoning and Search. IJCAI (1) 1997: 50-54 | |
41 | EE | Carla P. Gomes, Bart Selman: Algorithm Portfolio Design: Theory vs. Practice. UAI 1997: 190-197 |
40 | Henry A. Kautz, Bart Selman, Mehul A. Shah: The Hidden Web. AI Magazine 18(2): 27-36 (1997) | |
39 | Henry A. Kautz, Bart Selman, Mehul A. Shah: Referral Web: Combining Social Networks and Collaborative Filtering. Commun. ACM 40(3): 63-65 (1997) | |
1996 | ||
38 | Henry A. Kautz, Bart Selman, Al Milewski: Agent Amplified Communication. AAAI/IAAI, Vol. 1 1996: 3-9 | |
37 | Henry A. Kautz, Bart Selman: Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. AAAI/IAAI, Vol. 2 1996: 1194-1201 | |
36 | 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 | |
35 | Henry A. Kautz, David A. McAllester, Bart Selman: Encoding Plans in Propositional Logic. KR 1996: 374-384 | |
34 | Bart Selman: Computational Challenges in Artificial Intelligence. ACM Comput. Surv. 28(4es): 10 (1996) | |
33 | EE | Bart Selman, David G. Mitchell, Hector J. Levesque: Generating Hard Satisfiability Problems. Artif. Intell. 81(1-2): 17-29 (1996) |
32 | EE | Bart Selman, Scott Kirkpatrick: Critical Behavior in the Computational Cost of Satisfiability Testing. Artif. Intell. 81(1-2): 273-295 (1996) |
31 | EE | Bart Selman, Hector J. Levesque: Support Set Selection for Abductive and Default Reasoning. Artif. Intell. 82(1-2): 259-272 (1996) |
30 | EE | Bart Selman, Henry A. Kautz: Knowledge Compilation and Theory Approximation. J. ACM 43(2): 193-224 (1996) |
1995 | ||
29 | Joann J. Ordille, Oswald Drobnik, Michael R. Genesereth, Y. Lashkari, Bart Selman: Intelligent Agents in Distributed Systems (Panel). ICDCS 1995: 342 | |
28 | Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang: Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032 | |
27 | Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, Bart Selman: The Comparative Linguistics of Knowledge Representation. IJCAI (1) 1995: 862-869 | |
26 | Bart Selman: Stochastic Search and Phase Transitions: AI Meets Physics. IJCAI (1) 1995: 998-1002 | |
25 | EE | Henry A. Kautz, Michael J. Kearns, Bart Selman: Horn Approximations of Empirical Data. Artif. Intell. 74(1): 129-145 (1995) |
1994 | ||
24 | Henry A. Kautz, Bart Selman: An Empirical Evaluation of Knowledge Compilation by Theory Approximation. AAAI 1994: 155-161 | |
23 | Bart Selman, Henry A. Kautz, Bram Cohen: Noise Strategies for Improving Local Search. AAAI 1994: 337-343 | |
22 | 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 | |
21 | Bart Selman: Domain-Specific Complexity Tradeoffs. ECAI 1994: 416-420 | |
20 | Bart Selman: Near-Optimal Plans, Tractability, and Reactivity. KR 1994: 521-529 | |
19 | Henry A. Kautz, Bart Selman, Michael H. Coen: Bottom-Up Design of Software Agents. Commun. ACM 37(7): 143-146 (1994) | |
1993 | ||
18 | Henry A. Kautz, Michael J. Kearns, Bart Selman: Reasoning With Characteristic Models. AAAI 1993: 34-39 | |
17 | Bart Selman, Henry A. Kautz: An Empirical Study of Greedy Local Search for Satisfiability Testing. AAAI 1993: 46-51 | |
16 | Bart Selman: Non-Systematic Search Methods for Model Finding. ICTAI 1993: 9 | |
15 | Bart Selman, Henry A. Kautz: Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. IJCAI 1993: 290-295 | |
14 | Bart Selman, Hector J. Levesque: The Complexity of Path-Based Defeasible Inheritance. Artif. Intell. 62(2): 303-339 (1993) | |
1992 | ||
13 | Bart Selman, Hector J. Levesque, David G. Mitchell: A New Method for Solving Hard Satisfiability Problems. AAAI 1992: 440-446 | |
12 | David G. Mitchell, Bart Selman, Hector J. Levesque: Hard and Easy Distributions of SAT Problems. AAAI 1992: 459-465 | |
11 | Henry A. Kautz, Bart Selman: Forming Concepts for Fast Inference. AAAI 1992: 786-793 | |
10 | Henry A. Kautz, Bart Selman: Planning as Satisfiability. ECAI 1992: 359-363 | |
9 | Henry A. Kautz, Bart Selman: Forming Concepts for Fast Inference. ECAI Workshop on Knowledge Representation and Reasoning 1992: 200-215 | |
1991 | ||
8 | Bart Selman, Henry A. Kautz: Knowledge Compilation using Horn Approximations. AAAI 1991: 904-909 | |
7 | Henry A. Kautz, Bart Selman: A General Framework for Knowledge Compilation. PDK 1991: 287-300 | |
6 | Henry A. Kautz, Bart Selman: Hard Problems for Simple Default Logics. Artif. Intell. 49(1-3): 243-279 (1991) | |
1990 | ||
5 | Bart Selman, Hector J. Levesque: Abductive and Default Reasoning: A Computational Core. AAAI 1990: 343-348 | |
4 | Bart Selman, Henry A. Kautz: Model-Preference Default Theories. Artif. Intell. 45(3): 287-322 (1990) | |
1989 | ||
3 | Bart Selman, Hector J. Levesque: The Tractability of Path-Based Inheritance. IJCAI 1989: 1140-1145 | |
2 | Henry A. Kautz, Bart Selman: Hard Problems for Simple Default Logics. KR 1989: 189-197 | |
1988 | ||
1 | Bart Selman, Henry A. Kautz: The Complexity of Model-Preference Default Theories. NMR 1988: 115-130 |