Papers by Bart Selman

See also recent CV.
Probabilistic Planning With Non-linear Utility Functions and Worst Case Guarantees.: Ermon, Stefano; Gomes, Carla; Selman, Bart; and Vladimirsky, Alexander.; Proc. 11th Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-12), Valencia, Spain, 2012.
SMT-Aided Combinatorial Materials Discovery.: Ermon, Stefano; LeBras, Ronan; Gomes, Carla; Selman, Bart; and van Dover.; Proc. 15th Int. Conf. on Theory and Appl. of Satisfiability Testing (SAT-12), 2012.
Uniform Solution Sampling Using a Constraint Solver As an Oracle.: Ermon, Stefano; Gomes, Carla; and Selman, Bart.; Proc. of the 28th Conf. on Uncertainty in Artificial Intelligence (UAI 2012), 2012.
Learning Policies For Battery Usage Optimization in Electric Vehicles.: Ermon, Stefano; Xue, Yexiang; Gomes, Carla; and Selman, Bart.; Proc. of the European Conf. on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD-12), 2012.
Unstructured human activity detection from RGBD images.: Sung, Jaeyong; Ponce, Colin; Selman, Bart; and Saxena, Ashutosh.; Proc. of IEEE Intl. Conf. on Robotics and Automation (ICRA-12)}, 2012.
A message passing approach to multiagent Gaussian inference for dynamic processes.: Ermon, Stefano; Gomes, Carla; and Selman Bart.; Proc. 10th Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-11), Taipei, Tawan, 2011.
Risk-Sensitive Policies for Sustainable Renewable Resource Allocation.: Ermon, Stefano; Conrad, Jon; Gomes, Carla; and Selman Bart.; Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI-11)}, Barcelona, Spain, 2011.
Accelerated Adaptive Markov Chain for Partition Function Computation.: Ermon, Stefano; Gomes, Carla; Sabharwal, Ashish; and Selman, Bart.; Proc. 25th Annual Conf. on Neural Information Processing Systems (NIPS-11), 2011.
A Flat Histogram Method for Computing the Density of States of Combinatorial Problems.: Ermon, Stefano; Gomes, Carla; and Selman Bart.; Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI-11), Barcelona, Spain, 2011.
Applying UCT to Boolean Satisfiability.: Previti, Alessandro; Ramanujan, Raghuram; Schaerf; Marco; and Bart Selman.; Proc.\ 14th Int.\ Conf. on Theory and Appl. of Satisfiability Testing (SAT-11), 2011.
Trade-Offs in Sampling-Based Adversarial Planning.: Ramanujan, Raghuram and Selman, Bart.; Proc. of 21st Intl. Conf. on Automated Planning and Scheduling (ICAPS-11), 2011. (Honorable mention, Best student paper award.)
Computing the Density of States of Boolean Formulas.: Ermon, Stefano; Gomes, Carla; and Selman Bart.; Proc. 16th Intl. Conf. on Principles and Practice of Constraint Programming (CP 2010), 2010. (Best student paper award.)
Playing Games Against Nature: Optimal Policies for Renewable Resource Allocation,: Ermon, Stefano; Conrad, Jon; Gomes, Carla; and Selman, Bart.; Proc. of the 26th Conf. on Uncertainty in Artificial Intelligence (UAI 2010), 2010.
Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation.: Ermon, Stefano; Gomes, Carla; and Selman Bart.; Proc. 9th Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-10), Toronto, Canada, 2010.
Understanding Sampling Style Adversarial Search Methods.: Ramanujan, Raghuram; Sabharwal, Ashish; and Selman, Bart.; Proc. of the 26th Conf. on Uncertainty in Artificial Intelligence (UAI 2010), 2010.
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.: Kroc, Lucas; Sabharwal, Ashish; and Selman, Bart.; Proc. 13th Int. Conf. on Theory and Appl. of Satisfiability Testing (SAT-10), 2010.
On Adversarial Search Spaces and Sampling-Based Planning.: Ramanujan, Raghuram; Sabharwal, Ashish; and Selman, Bart.; Proc. of 20th Intl. Conf. on Automated Planning and Scheduling (ICAPS-10), Toronto, Canada, 2010.
Integrating Systematic and Local Search Paradigms.: Kroc, Lucas; Sabharwal, Ashish; Gomes, Carla; and Selman, Bart.; Proc. of the 21st Intl. Joint Conf. on Artificial Intelligence (IJCAI-09), 2009.
Relaxed DPLL Search for MaxSAT.: Kroc, Lucas; Sabharwal, Ashish; Gomes, Carla; and Selman, Bart.; Proc.\ 12th Int.\ Conf. on Theory and Appl. of Satisfiability Testing (SAT-09), 2009.
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting.: Kroc, Lukas; Sabharwal, Ashish; and Selman, Bart.; Proc. of the 5th Intl. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'08), 2008.
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation.: Kroc, Lukas; Sabharwal, Ashish; and Selman, Bart. Survey Propagation Revisited.; Proc. of the 20th Annual Conf. on Neural Information Processing Systems (NIPS-08), 2008.
Counting CSP Solutions Using Generalized XOR Constraints.: Gomes, Carla; van Hoeve, Willem; Sabharwal, Ashish; Selman, Bart.; Proc. of the 22nd National Conf. on Artificial Intelligence (AAAI-07), 2007.
From Sampling to Model Counting.: Gomes, Carla; Hoffmann, Joerg; Sabharwal, Ashish; Selman, Bart.; Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI-07), 2007.
SAT Encodings of State-Space Reachability Problems in Numeric Domains.: Hoffmann, Jorg; Gomes, Carla; Selman, Bart; Kautz, Henry.; Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI-07), 2007.
Short XORs for Model Counting: From Theory to Practice.: Gomes, Carla; Hoffmann, Jorg; Sabharwal, Ashish; and Selman, Bart.; Proc. of the 9th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT 07), 2007.
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming.: Guo, Yunsong and Selman, Bart.; Proc. of 19th IEEE Intl. Conf. on Tools with Artificial Intelligence (ICTAI 2007), 2007.
Survey Propagation Revisited.: Kroc, Lukas; Sabharwal, Ashish; and Selman, Bart.; Proc. 23rd Conf. on Uncertainty and Artificial Intelligence (UAI-07), 2007.
Optimal Multi-Agent Scheduling with Constraint Programming.: van Hoeve, Willem; Gomes, Carla; Selman, Bart; Lombardi, Michele.; Proc. of 22nd. National Conf. on Artificial Intelligence, AAAI-07, 2007.
Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents.: Vetsikas, Ioannis; Jennings, Nicholas; and Selman, Bart.; Proc. of the 20th Intl. Joint Conf. on Artificial Intelligence (IJCAI-07), 2007.
Model Counting: A New Strategy for Obtaining Good Bounds.: Gomes, Carla P.; Sabharwal, Ashish; and Selman, Bart.; Proc. of 21st Natl. Conf. on Artificial Intelligence (AAAI-06)}, 2006. Best paper Award.
Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints.: Gomes, Carla P.; Sabharwal, Ashish; and Selman, Bart.; Proc. of the 20th Annual Conf. on Neural Information Processing Systems (NIPS-06), 2006.
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in Sat-Based Planning.: Hoffmann, Jorg; Gomes, Carla; and Selman, Bart.; Proc. of Intl. Conf. on Automated Planning and Scheduling (ICAPS-06), UK, 2006.
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.: Sabharwal, Ashish; Anstegui, Carlos; Gomes, Carla P.; Hart, Justin W.; and Selman, Bart.; Proc. of the 9th Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT 06), 2006.
Integration of Learning and Reasoning Techniques.: Selman, Bart.; Proc. of the 16th Intl. Conf. on Inductive Logic Programming. (ILP-2006), 2006.
Autonomous trading agent design in the presence of tradeoffs.: Vetsikas, Ioannis and Selman, Bart.; Proc. 4th Intl. Conf. on Entertainment Computing (ICEC-05), Japan, 2005.
From spin glasses to hard satisfiability formulas.: Haixia Jia; Cris Moore; and Bart Selman.; Proc. 7th Int. Conf. on Theory and Appl. of Satisfiability Testing (SAT-04), Vancouver, BC, 2004.
Equilibria for Design Tradeoffs in Autonomous Trading Agents.: Vetsikas, Ioannis and Selman, Bart.; Proc. 3rd Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-03), New York, NY, 2003.
On the connections between backdoors, restarts, and heavy-tails in combinatorial search.: Williams, R.; Gomes, C.; and Selman B.; Proc. of the Sixth Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT03), 2003.
Ten challenges redux: propositional reasoning and search.: Kautz, Henry and Selman, Bart.; Proc. 9th Intl. Conf. on Constr. Program. (CP-03), Cork, 2003.
Leveraging belief propagation, backtrack search, and statistics for model counting.: Kroc, Lukas; Sabharwal, Ashish; and Selman, Bart.; Annals of Operations Research, 184(1), 209--231, 2011.
The State of SAT: Henry Kautz and Bart Selman; Discrete Applied Mathematics. Vol. 155(12): 1514-1524, 2007.
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.: Hoffmann, Joerg; Gomes, Carla; and Selman, Bart.; Logical Methods in Computer Science. Vol. 3(1), 2007.
Statistical Regimes Across Constrainedness Regions.: Gomes, Carla; Fernandez, Cesar;Selman, Bart; and Bessiere, Christian.; Constraints. Vol. 10(4), 2005 pp. 317-337.
Sensor networks and distributed CSP: Communication, Computation and Complexity.: Bejar R.; Domshlak C.; Fernandez C.; Gomes C.; Krishnamachariand B.; Selman B.; and Valls M.; Artificial Intelligence Journal. Vol. 161(1/2), 2005, 117-147.
Regular Random k-SAT: Properties of Balanced Formulas.: Boufkhad, Yancine; DuBoois, Olivier; Interian, Yannet; and Selman, Bart.; Journal of Automated Reasoning. Vol. 35, nos. 1-3 (2005), pp. 181-200.
Can get satisfaction: Carla P. Gomes and Bart Selman; Nature Vol. 435, June 9, 2005, 751--752. News & Views article, accompanying Achlioptas, Naor, and Peres.
The Achilles' Heel of QBF: Carlos Ansotegui, Carla Gomes, and Bart Selman.; Proc. AAAI-05.
Regular Random k-SAT: Properties of balanced formulas: Yacine Boufkhad, Olivier Dubois, Yannet Interian, and Bart Selman.; Journal of Automated Reasoning, 2005.
A New Approach to Model Counting: Wei Wei and Bart Selman.; Proc. SAT-05.
Planning CNFs with small DPLL proofs: Technical report version.
Statistical Regimes Across Constrainedness Regions: Carla P. Gomes, Cesar Fernandez, Bart Selman, and Chistian Bessiere Proc. 10th Intl. Conf. on Principles and Practice of Constraint Programming (CP-04). Toronto, Ont., 2004. Distinguished Paper Award.
Towards Efficient Sampling: Exploiting Random Walk Strategies: Wei Wei, Jordan Erenrich, and Bart Selman; Proc. AAAI-04. San Jose, CA, 2004. We introduce algorithm SampleSat to sample approximately uniformly from the set of satisfying truth assignments of a Boolean formula. Talk.
Tracking evolving communities in large linked networks: John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman; Proc. Natl. Acad. of Sci. (PNAS), Febr., 2004. NSF overview article.
Natural communities in large linked networks: John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman; Proc. KDD, August, 2003.
Backdoors To Typical Case Complexity: Ryan Williams, Carla Gomes, and Bart Selman; Proc. IJCAI-03 Acapulco, Mexico, 2003. We introduce the notion of a "backdoor" variable of a SAT problem instance to explain some of the remarkable efficiency of current SAT solvers on very large instances. The bottom line is that many real-world instances reduce to a tractable form once a small group of variables (the "backdoor") is set correctly. Heuristics and restarts in current solvers are effective at identifying such variables. Talk. Note: the latest results on this line of research were presented at AAAS-05 (Washington, DC).
Introductory remarks for Nils Nilsson's Research Excellence award presentation at IJCAI-03.: Animation derived from Nils's teleoreactive environment.
Communication and computation in distributed CSP algorithms.: Cesar Fernandez, Ramon Bejar, Bhaskar Krishnamachari, Carla Gomes, and Bart Selman.; In Distributed Sensor Networks, A Multiagent Perspective. V. Lesser, C.L. Ortiz, Jr., and M. Tambe (Eds.) Kluwer Academic Publishers, 2003.
A principled study of the design tradeoffs for autonomous trading agents.: Ioannis A. Vetsikas and Bart Selman.; Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, Melbourne, 2003. Describes ``Whitebear'' trading agent, winner of the Trading Agent competition '02 (TAC-02).; See for TAC overview.
Satisfied with Physics: Gomes, Carla and Selman, Bart.; Science, Vol. 297, Aug. 2, 2002, 784--785. (Perspectives article.) Accompanying Mezard, Parisi, and Zecchina.
Accelerating Random Walks.: Wei, Wei and Selman, Bart.; Proceedings of 8th Intl. Conference on the Principles and Practice of Constraint Programming (CP-2002), 2002.
Dynamic Restart Policies.: Kautz, Henry, Horvitz, Eric, Ruan, Yongshao, Gomes, Carla, and Selman, Bart.; Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02) Edmonton, Alberta, Canada, 2002, 674--682.
Hill Climbing Search.: Gomes, Carla; and Selman Bart.; Nature Encyclopedia of Cognition, Nature Publ., 2002.
Algorithm Portfolios: Gomes, Carla and Selman, Bart.; Artificial Intelligence, Vol. 126 (2001) 43--62.
Formal Models of Heavy-tailed Behavior in Combinatorial Search: Chen, Hubie; Gomes, Carla; and Selman, Bart.; Proceedings of 7th Intl. Conference on the Principles and Practice of Constraint Programming (CP-2001), Lecture Notes in Computer Science, Vol. 2239, Springer-Verlag, 2001, 408--422.
A Bayesian Approach to Tackling Hard Computational Problems.: Horvitz, Eric; Ruan, Yonshao; Gomes, Carla; Kautz, Henry; Selman, Bart; and Chickering, Mark.; Proceedings 17th Conf. on Uncertainty and Artificial Intelligence (UAI-2001), Seattle, 2001.
Balance and Filtering in Structured Satisfiable Problems.: Kautz, Henry; Ruan, Yongshoa; Achlioptas, Dimitris; Gomes, Carla; Selman, Bart; and Stickel, Mark.; Proceedings of the 17th International Conference on Artificial Intelligence (IJCAI-2001), Seattle, 2001.
Statistical Physics and Computational Complexity.: Kirkpatrick, Scott and Selman, Bart.; In More is different --- Fifty years of condensed matter physics. Essays in honor of Nobel Laureate Philip W. Anderson, Princeton Series in Physics, edited by N. Ong and R. Bhatt, 2001, 331--339.
Compute-Intensive Methods in Artificial Intelligence: Selman, Bart.; Annals of Mathematics and Artificial Intelligence, Vol. 28 (2000), 35--41.
Learning Declarative Control Rules for Constraint-Based Planning: Huang, Yi-Cheng; Selman, Bart; and Kautz, Henry.; Proc. ICML-00, 2000.
Heavy-tailed phenomena in satisfiability and constraint satisfaction problems: Gomes, Carla; Selman, Bart; Crato, Nuno; and Kautz, Henry.; J. of Automated Reasoning, Vol. 24(1/2), 2000, 67-100.
Generating Satisfiable Instances.: Achlioptas, Dimitris; Gomes, Carla; Kautz, Henry; and Selman, Bart.; Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), Austin, TX, 2000.
Analysis of Random Walk and Random Noise Algorithms for Satisfiability Testing.: Krishnamachari, Bhaskar; Xie, Xi; Selman, Bart; and Wicker, Stephen.; Proceedings of 6th Intl. Conference on the Principles and Practice of Constraint Programming (CP-2000). Lecture Notes in Computer Science, Vol. 1894, Springer-Verlag, 2000.
Determining computational complexity from characteristic `phase transitions'.: Monasson, Remi; Zecchina, Riccardo; Kirkpatrick, Scott; Selman, Bart; and Troyansky, Lidror.; Nature, Vol. 400(8), 1999, 133--137. Accompanied by Nature news article Solving problems in finite time by Philip Anderson.
2+P-SAT: Relation of typical-case complexity to the nature of the phase transition: Monasson, Remi; Zecchina, Riccardo; Kirkpatrick, Scott; Selman, Bart; and Troyansky, Lidror.; Random Structures, 1999, 414--435.
Heavy-tailed Distributions in Computational Methods.: Gomes, Carla P. and Selman, Bart.; Proceedings Application of Heavy Tailed Distribution in Economics, Engineering and Statistics (TAILS-99), Washington, DC, 1999.
Control knowledge in planning: benefits and tradeoffs.: Huang, Yi-Cheng; Selman, Bart; and Kautz, Henry.; Proc. of the 16th Natl. Conf. on Artificial Intelligence (AAAI-99), 1999.
Unifying SAT-based and graph-based planners.: Kautz, Henry and Selman, Bart.; Proc. of the 15th Intl. Joint Conf. on Artificial Intelligence (IJCAI-99).
Greedy local search: Selman, Bart.; In {\em MIT Encyclopedia of the Cognitive Sciences (MITECS)}, Robert A.\ Wilson and Frank C.\ Keil (Eds.) Cambridge: MIT Press, 1999, 357--359.
Boosting Combinatorial Search Through Randomization: Carla P. Gomes, Bart Selman, and Henry Kautz.; Proc. AAAI-98 , Madison, WI, July 1998.
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems.: Carla P. Gomes, Bart Selman, Ken McAloon, and Carol Tretkoff; Proc. AIPS-98, Pittsburgh, PA, June 1998.
The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework.
Figs. are in separate .pdf: Henry Kautz and Bart Selman.; Proc. AIPS-98, Pittsburgh, PA, June 1998.
Problem Structure in the Presence of Perturbations.: Carla P. Gomes and Bart Selman.; Proc. AAAI-97, Providence, RI., 1997.
Algorithm Portfolio Design: Theory vs. Practice.: Carla P. Gomes and Bart Selman.; Proc. of the Thirteenth Conference On Uncertainty in Artificial Intelligence (UAI-97), Providence, RI, 1997./
Stochastic Search: Bart Selman.; Appears in the MIT Encyclopedia of Cognitive Science, forthcoming.
Ten Challenges in Propositional Reasoning and Search: Bart Selman, Henry Kautz, and David McAllester.; Proc. IJCAI-97, Nagoya, Aichi, Japan, 1997.
Exploiting Variable Dependency in Local Search.: Henry Kautz, David McAllester, and Bart Selman. (draft); Abstract appears in Abstracts of the Poster Sessions of IJCAI-97, Nagoya, Japan, 1997.
The Hidden Web: Henry Kautz, Bart Selman, and Mehul Shah.; The AI Magazine, vol. 18, no. 2, Summer 1997, pages 27 - 36.
Evidence for Invariants in Local Search.: David McAllester, Bart Selman, and Henry Kautz.; Proc. AAAI-97, Providence, RI, 1997.
ReferralWeb: Combining Social Networks and Collaborative Filtering.: Henry Kautz, Bart Selman, and Mehul Shah.; Comm. ACM, vol. 30 no. 3, March 1997.
Local Search Strategies for Satisfiability Testing: Bart Selman and Henry Kautz,; DIMACS Series in Discrete Mathematics. (to appear)
Encoding Plans in Propositional Logic.: Henry Kautz, David McAllester, and Bart Selman.; Proc. KR-96.
Generating Hard Satisfiability Problems.: Selman, Bart; Mitchell, David; and Levesque, Hector.; Artificial Intelligence, Vol. 81, 1996, 17--29.
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search.: Henry Kautz and Bart Selman,; Proc. AAAI-96.
The Comparative Linguistics of Knowledge Representation.: Goran Gogic, Henry Kautz, Christos Papadimitriou, and Bart Selman,; Proc. IJCAI-95.
Agent Amplified Communication.: Henry Kautz and Bart Selman,; Proc. AAAI-96 (earlier version, AAAI-95 Spring Symposium).
Knowledge Compilation and Theory Approximation.: Bart Selman and Henry Kautzr,; Journal of the ACM, 43(2):193-224, March 1996.
Critical Behavior in the Computational Cost of Satisfiability Testing: Bart Selman and Scott Kirkpatrick,; Artificial Intelligence, 81:273-295, 1996.
Solving Problems with Hard and Soft Constraints Using A Stochastic Algorithm for MAX-SAT: Yueyun Jiang, Henry Kautz, and Bart Selman,; 1st International Joint Workshop on Artificial Intelligence and Operations Research, 1995.
Horn Approximations of Empirical Data.: Henry Kautz, Michael Kearns, and Bart Selman.; Draft (near-final) version. Final version appears in Artificial Intelligence, 74/1 (pp. 129-145) 30 March 1995.
Critical Behavior in the Satisfiability of Random Boolean Expressions.: Scott Kirkpatrick and Bart Selman, Science, Vol. 264, 1994, 1297--1301.
With Science News article by Barry Cipra entitled "Pinning down the Treacherous Border in Logical Statements".
Noise Strategies for Improving Local Search.: Bart Selman and Henry Kautz, Proc. AAAI-94.
An Experiment in the Design of Software Agents.: Henry Kautz, Bart Selman, Michael Coen, Steven Ketchpel, and Chris Ramming,; Proc. AAAI-94.
An Empirical Evaluation of Knowledge Compilation.: Henry Kautz and Bart Selman,; Proc. AAAI-94. (Extended version).
GSAT User's Guide.: Henry Kautz and Bart Selman.
Local Search Strategies for Satisfiability Testing.: Bart Selman and Henry Kautz, Draft.
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems.: Bart Selman and Henry Kautz,; Proc. IJCAI-93.
Reasoning With Characteristic Models.: Henry Kautz, Michael Kearn, Bart Selman,; Proc. AAAI-93.
An Empirical Study of Greedy Local Search for Satisfiability Testing.: Bart Selman and Henry Kautz,; Proc. AAAI-93.
Planning as Satisfiability.: Henry Kautz and Bart Selman,; Proceedings ECAI-92.
Forming Concepts for Fast Inferencer.: Henry Kautz and Bart Selman,; Proceedings AAAI-92.
A General Framework for Knowledge Compilation.: Henry Kautz and Bart Selman,; PDK-91, WOCFAI-91.
Knowledge Compilation Using Horn Approximations.: Bart Selman and Henry Kautz,; Proceedings AAAI-91.
Hard and Easy Distribution of SAT Problems.: David Mitchell, Bart Selman, and Hector Levesque,; Proceedings AAAI-92.
A New Method for Solving Hard Satisfiability Problems.: Bart Selman, Hector Levesque and David Mitchell,; Proceedings AAAI-92.; Back to my personal home page page.

selman@cs.cornell.edu