|
Search the dblp DataBase
Bart Selman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bart Selman, Hector J. Levesque
Abductive and Default Reasoning: A Computational Core. [Citation Graph (2, 0)][DBLP] AAAI, 1990, pp:343-348 [Conf]
- Henry A. Kautz, Bart Selman
Hard Problems for Simple Default Logics. [Citation Graph (2, 0)][DBLP] Artif. Intell., 1991, v:49, n:1-3, pp:243-279 [Journal]
- Henry A. Kautz, Bart Selman, Al Milewski
Agent Amplified Communication. [Citation Graph (1, 0)][DBLP] AAAI/IAAI, Vol. 1, 1996, pp:3-9 [Conf]
- Bart Selman, Henry A. Kautz
Knowledge Compilation using Horn Approximations. [Citation Graph (1, 0)][DBLP] AAAI, 1991, pp:904-909 [Conf]
- Bart Selman, Hector J. Levesque, David G. Mitchell
A New Method for Solving Hard Satisfiability Problems. [Citation Graph (1, 0)][DBLP] AAAI, 1992, pp:440-446 [Conf]
- Henry A. Kautz, Michael J. Kearns, Bart Selman
Horn Approximations of Empirical Data. [Citation Graph (1, 0)][DBLP] Artif. Intell., 1995, v:74, n:1, pp:129-145 [Journal]
- Henry A. Kautz, Bart Selman, Mehul A. Shah
Referral Web: Combining Social Networks and Collaborative Filtering. [Citation Graph (1, 0)][DBLP] Commun. ACM, 1997, v:40, n:3, pp:63-65 [Journal]
- Ioannis A. Vetsikas, Bart Selman
Autonomous trading agent design in the presence of tradeoffs. [Citation Graph (0, 0)][DBLP] ICEC, 2005, pp:293-299 [Conf]
- Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman
Generating Satisfiable Problem Instances. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2000, pp:256-261 [Conf]
- Carlos Ansótegui, Carla P. Gomes, Bart Selman
The Achilles' Heel of QBF. [Citation Graph (0, 0)][DBLP] AAAI, 2005, pp:275-281 [Conf]
- Carla P. Gomes, Bart Selman
Problem Structure in the Presence of Perturbations. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1997, pp:221-226 [Conf]
- Carla P. Gomes, Bart Selman, Henry A. Kautz
Boosting Combinatorial Search Through Randomization. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1998, pp:431-437 [Conf]
- Carla P. Gomes, Ashish Sabharwal, Bart Selman
Model Counting: A New Strategy for Obtaining Good Bounds. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Yi-Cheng Huang, Bart Selman, Henry A. Kautz
Control Knowledge in Planning: Benefits and Tradeoffs. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1999, pp:511-517 [Conf]
- Henry A. Kautz, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Bart Selman
Dynamic Restart Policies. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2002, pp:674-681 [Conf]
- Henry A. Kautz, Michael J. Kearns, Bart Selman
Reasoning With Characteristic Models. [Citation Graph (0, 0)][DBLP] AAAI, 1993, pp:34-39 [Conf]
- Henry A. Kautz, Bart Selman
Forming Concepts for Fast Inference. [Citation Graph (0, 0)][DBLP] AAAI, 1992, pp:786-793 [Conf]
- Henry A. Kautz, Bart Selman
An Empirical Evaluation of Knowledge Compilation by Theory Approximation. [Citation Graph (0, 0)][DBLP] AAAI, 1994, pp:155-161 [Conf]
- Henry A. Kautz, Bart Selman
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 2, 1996, pp:1194-1201 [Conf]
- Henry A. Kautz, Bart Selman, Michael H. Coen, Steven P. Ketchpel, Chris Ramming
An Experiment in the Design of Software Agents. [Citation Graph (0, 0)][DBLP] AAAI, 1994, pp:438-443 [Conf]
- David A. McAllester, Bart Selman, Henry A. Kautz
Evidence for Invariants in Local Search. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1997, pp:321-326 [Conf]
- David G. Mitchell, Bart Selman, Hector J. Levesque
Hard and Easy Distributions of SAT Problems. [Citation Graph (0, 0)][DBLP] AAAI, 1992, pp:459-465 [Conf]
- Bart Selman, Rodney A. Brooks, Thomas Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson
Challenge Problems for Artificial Intelligence (Panel Statements). [Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 2, 1996, pp:1340-1345 [Conf]
- Bart Selman, Henry A. Kautz
An Empirical Study of Greedy Local Search for Satisfiability Testing. [Citation Graph (0, 0)][DBLP] AAAI, 1993, pp:46-51 [Conf]
- Bart Selman, Henry A. Kautz, Bram Cohen
Noise Strategies for Improving Local Search. [Citation Graph (0, 0)][DBLP] AAAI, 1994, pp:337-343 [Conf]
- Wei Wei, Jordan Erenrich, Bart Selman
Towards Efficient Sampling: Exploiting Random Walk Strategies. [Citation Graph (0, 0)][DBLP] AAAI, 2004, pp:670-676 [Conf]
- Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tretkoff
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. [Citation Graph (0, 0)][DBLP] AIPS, 1998, pp:208-213 [Conf]
- Henry A. Kautz, Bart Selman
The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. [Citation Graph (0, 0)][DBLP] AIPS, 1998, pp:181-189 [Conf]
- Ioannis A. Vetsikas, Bart Selman
A principled study of the design tradeoffs for autonomous trading agents. [Citation Graph (0, 0)][DBLP] AAMAS, 2003, pp:473-480 [Conf]
- Ioannis A. Vetsikas, Bart Selman
A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents. [Citation Graph (0, 0)][DBLP] AAMAS, 2004, pp:1286-1287 [Conf]
- Hubie Chen, Carla P. Gomes, Bart Selman
Formal Models of Heavy-Tailed Behavior in Combinatorial Search. [Citation Graph (0, 0)][DBLP] CP, 2001, pp:408-421 [Conf]
- Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière
Statistical Regimes Across Constrainedness Regions. [Citation Graph (0, 0)][DBLP] CP, 2004, pp:32-46 [Conf]
- Carla P. Gomes, Bart Selman, Nuno Crato
Heavy-Tailed Distributions in Combinatorial Search. [Citation Graph (0, 0)][DBLP] CP, 1997, pp:121-135 [Conf]
- Henry A. Kautz, Bart Selman
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. [Citation Graph (0, 0)][DBLP] CP, 2003, pp:1-18 [Conf]
- Bhaskar Krishnamachari, Xi Xie, Bart Selman, Stephen B. Wicker
Analysis of Random Noise and Random Walk Algorithms. [Citation Graph (0, 0)][DBLP] CP, 2000, pp:278-290 [Conf]
- Bart Selman
Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. [Citation Graph (0, 0)][DBLP] CP, 2004, pp:9-12 [Conf]
- Wei Wei, Bart Selman
Accelerating Random Walks. [Citation Graph (0, 0)][DBLP] CP, 2002, pp:216-232 [Conf]
- Henry A. Kautz, Bart Selman
Planning as Satisfiability. [Citation Graph (0, 0)][DBLP] ECAI, 1992, pp:359-363 [Conf]
- Henry A. Kautz, Bart Selman
Forming Concepts for Fast Inference. [Citation Graph (0, 0)][DBLP] ECAI Workshop on Knowledge Representation and Reasoning, 1992, pp:200-215 [Conf]
- Bart Selman
Domain-Specific Complexity Tradeoffs. [Citation Graph (0, 0)][DBLP] ECAI, 1994, pp:416-420 [Conf]
- Joann J. Ordille, Oswald Drobnik, Michael R. Genesereth, Y. Lashkari, Bart Selman
Intelligent Agents in Distributed Systems (Panel). [Citation Graph (0, 0)][DBLP] ICDCS, 1995, pp:342- [Conf]
- Yi-Cheng Huang, Bart Selman, Henry A. Kautz
Learning Declarative Control Rules for Constraint-BAsed Planning. [Citation Graph (0, 0)][DBLP] ICML, 2000, pp:415-422 [Conf]
- Carla P. Gomes, Bart Selman
On the Fine Structure of Large Search Spaces. [Citation Graph (0, 0)][DBLP] ICTAI, 1999, pp:197-201 [Conf]
- Carla P. Gomes, Bart Selman
Search Strategies for Hybrid Search Spaces. [Citation Graph (0, 0)][DBLP] ICTAI, 1999, pp:359-364 [Conf]
- Bart Selman
Non-Systematic Search Methods for Model Finding. [Citation Graph (0, 0)][DBLP] ICTAI, 1993, pp:9- [Conf]
- Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls
Grid-based SensorDCSP. [Citation Graph (0, 0)][DBLP] IJCAI, 2003, pp:1359-1361 [Conf]
- Jordan Erenrich, Bart Selman
Sampling Combinatorial Spaces Using Biased Random Walks. [Citation Graph (0, 0)][DBLP] IJCAI, 2003, pp:1376-1380 [Conf]
- Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang
Systematic Versus Stochastic Constraint Satisfaction. [Citation Graph (0, 0)][DBLP] IJCAI, 1995, pp:2027-2032 [Conf]
- Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, Bart Selman
The Comparative Linguistics of Knowledge Representation. [Citation Graph (0, 0)][DBLP] IJCAI (1), 1995, pp:862-869 [Conf]
- Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel
Balance and Filtering in Structured Satisfiable Problems. [Citation Graph (0, 0)][DBLP] IJCAI, 2001, pp:351-358 [Conf]
- Henry A. Kautz, Bart Selman
Unifying SAT-based and Graph-based Planning. [Citation Graph (0, 0)][DBLP] IJCAI, 1999, pp:318-325 [Conf]
- Bart Selman
Stochastic Search and Phase Transitions: AI Meets Physics. [Citation Graph (0, 0)][DBLP] IJCAI (1), 1995, pp:998-1002 [Conf]
- Bart Selman, Henry A. Kautz
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. [Citation Graph (0, 0)][DBLP] IJCAI, 1993, pp:290-295 [Conf]
- Bart Selman, Henry A. Kautz, David A. McAllester
Ten Challenges in Propositional Reasoning and Search. [Citation Graph (0, 0)][DBLP] IJCAI (1), 1997, pp:50-54 [Conf]
- Bart Selman, Hector J. Levesque
The Tractability of Path-Based Inheritance. [Citation Graph (0, 0)][DBLP] IJCAI, 1989, pp:1140-1145 [Conf]
- Ryan Williams, Carla P. Gomes, Bart Selman
Backdoors To Typical Case Complexity. [Citation Graph (0, 0)][DBLP] IJCAI, 2003, pp:1173-1178 [Conf]
- Jörg Hoffmann, Carla P. Gomes, Bart Selman, Henry A. Kautz
SAT Encodings of State-Space Reachability Problems in Numeric Domains. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:1918-1923 [Conf]
- Ioannis A. Vetsikas, Nicholas R. Jennings, Bart Selman
Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:1543-1550 [Conf]
- Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman
From Sampling to Model Counting. [Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:2293-2299 [Conf]
- John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman
Natural communities in large linked networks. [Citation Graph (0, 0)][DBLP] KDD, 2003, pp:541-546 [Conf]
- Henry A. Kautz, David A. McAllester, Bart Selman
Encoding Plans in Propositional Logic. [Citation Graph (0, 0)][DBLP] KR, 1996, pp:374-384 [Conf]
- Henry A. Kautz, Bart Selman
Hard Problems for Simple Default Logics. [Citation Graph (0, 0)][DBLP] KR, 1989, pp:189-197 [Conf]
- Bart Selman
Near-Optimal Plans, Tractability, and Reactivity. [Citation Graph (0, 0)][DBLP] KR, 1994, pp:521-529 [Conf]
- Bart Selman
Satisfiability Testing: Recent Developments and Challenge Problems. [Citation Graph (0, 0)][DBLP] LICS, 2000, pp:178- [Conf]
- Bart Selman, Henry A. Kautz
The Complexity of Model-Preference Default Theories. [Citation Graph (0, 0)][DBLP] NMR, 1988, pp:115-130 [Conf]
- Henry A. Kautz, Bart Selman
A General Framework for Knowledge Compilation. [Citation Graph (0, 0)][DBLP] PDK, 1991, pp:287-300 [Conf]
- Haixia Jia, Cristopher Moore, Bart Selman
From Spin Glasses to Hard Satisfiable Formulas. [Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf]
- Haixia Jia, Cristopher Moore, Bart Selman
From Spin Glasses to Hard Satisfiable Formulas. [Citation Graph (0, 0)][DBLP] SAT (Selected Papers, 2004, pp:199-210 [Conf]
- Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. [Citation Graph (0, 0)][DBLP] SAT, 2006, pp:382-395 [Conf]
- Wei Wei, Bart Selman
A New Approach to Model Counting. [Citation Graph (0, 0)][DBLP] SAT, 2005, pp:324-339 [Conf]
- Carla P. Gomes, Bart Selman
Algorithm Portfolio Design: Theory vs. Practice. [Citation Graph (0, 0)][DBLP] UAI, 1997, pp:190-197 [Conf]
- Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering
A Bayesian Approach to Tackling Hard Computational Problems. [Citation Graph (0, 0)][DBLP] UAI, 2001, pp:235-244 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2005, v:161, n:1-2, pp:117-147 [Journal]
- Carla P. Gomes, Bart Selman
Algorithm portfolios. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2001, v:126, n:1-2, pp:43-62 [Journal]
- Bart Selman, Henry A. Kautz
Model-Preference Default Theories. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1990, v:45, n:3, pp:287-322 [Journal]
- Bart Selman, Scott Kirkpatrick
Critical Behavior in the Computational Cost of Satisfiability Testing. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1996, v:81, n:1-2, pp:273-295 [Journal]
- Bart Selman, Hector J. Levesque
The Complexity of Path-Based Defeasible Inheritance. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1993, v:62, n:2, pp:303-339 [Journal]
- Bart Selman, Hector J. Levesque
Support Set Selection for Abductive and Default Reasoning. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1996, v:82, n:1-2, pp:259-272 [Journal]
- Bart Selman, David G. Mitchell, Hector J. Levesque
Generating Hard Satisfiability Problems. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1996, v:81, n:1-2, pp:17-29 [Journal]
- Henry A. Kautz, Bart Selman, Mehul A. Shah
The Hidden Web. [Citation Graph (0, 0)][DBLP] AI Magazine, 1997, v:18, n:2, pp:27-36 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] AI Magazine, 2000, v:21, n:2, pp:13-33 [Journal]
- Bart Selman
Compute-intensive methods in artificial intelligence. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2000, v:28, n:1-4, pp:35-38 [Journal]
- Henry A. Kautz, Bart Selman, Michael H. Coen
Bottom-Up Design of Software Agents. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1994, v:37, n:7, pp:143-146 [Journal]
- Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière
Statistical Regimes Across Constrainedness Regions. [Citation Graph (0, 0)][DBLP] Constraints, 2005, v:10, n:4, pp:317-337 [Journal]
- Bart Selman
Computational Challenges in Artificial Intelligence. [Citation Graph (0, 0)][DBLP] ACM Comput. Surv., 1996, v:28, n:4es, pp:10- [Journal]
- Carla P. Gomes, Bart Selman
Hybrid Search Strategies for Heterogeneous Search Spaces. [Citation Graph (0, 0)][DBLP] International Journal on Artificial Intelligence Tools, 2000, v:9, n:1, pp:45-57 [Journal]
- Bart Selman, Henry A. Kautz
Knowledge Compilation and Theory Approximation. [Citation Graph (0, 0)][DBLP] J. ACM, 1996, v:43, n:2, pp:193-224 [Journal]
- Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. Kautz
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2000, v:24, n:1/2, pp:67-100 [Journal]
- Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
Regular Random k-SAT: Properties of Balanced Formulas. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2005, v:35, n:1-3, pp:181-200 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1999, v:15, n:3-4, pp:414-435 [Journal]
- Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina
Editorial. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:265, n:1-2, pp:1- [Journal]
- Willem Jan van Hoeve, Carla P. Gomes, Bart Selman, Michele Lombardi
Optimal Multi-Agent Scheduling with Constraint Programming. [Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:1813-1818 [Conf]
- Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman
Counting CSP Solutions Using Generalized XOR Constraints. [Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:204-209 [Conf]
- Jörg Hoffmann, Carla P. Gomes, Bart Selman
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. [Citation Graph (0, 0)][DBLP] ICAPS, 2006, pp:284-293 [Conf]
- Bart Selman
Integration of Learning and Reasoning Techniques. [Citation Graph (0, 0)][DBLP] ILP, 2006, pp:25- [Conf]
- Carla P. Gomes, Ashish Sabharwal, Bart Selman
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. [Citation Graph (0, 0)][DBLP] NIPS, 2006, pp:481-488 [Conf]
- Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman
Short XORs for Model Counting: From Theory to Practice. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:100-106 [Conf]
- Jörg Hoffmann, Carla P. Gomes, Bart Selman
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in<br> SAT-Based Planning [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Henry A. Kautz, Bart Selman
The state of SAT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:12, pp:1514-1524 [Journal]
On Adversarial Search Spaces and Sampling-Based Planning. [Citation Graph (, )][DBLP]
Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation. [Citation Graph (, )][DBLP]
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. [Citation Graph (, )][DBLP]
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming. [Citation Graph (, )][DBLP]
Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. [Citation Graph (, )][DBLP]
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. [Citation Graph (, )][DBLP]
Message-passing and local heuristics as decimation strategies for satisfiability. [Citation Graph (, )][DBLP]
Relaxed DPLL Search for MaxSAT. [Citation Graph (, )][DBLP]
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. [Citation Graph (, )][DBLP]
Sampling and Soundness: Can We Have Both? [Citation Graph (, )][DBLP]
Search in 0.026secs, Finished in 0.030secs
|