Papers / Data / Code
The following files are available via anonymous ftp from research.att.com in directory /dist/ai.
For additional papers, contact kautz@research.att.com or selman@cs.cornell.edu.
- Satisfiability package
- Bart Selman.
- Walksat code
- Bart Selman, Henry Kautz, and Bram Cohen.
- GSAT code
- Bart Selman and Henry Kautz.
- GSAT User's Guide
- Henry Kautz and Bart Selman.
- Challenge Problems for Propositional Reasoning and Search.
- Bart Selman, Henry Kautz, and David McAllester, Proc. IJCAI-97.
- Pushing the Envelope: Planning, Propositional Reasoning, and Stochastic Search
- Henry Kautz and Bart Selman, Proc. AAAI-96.
- Challenge Problems for Artificial Intelligence
- Bart Selman, Rodney Brooks, TomDean, Eric Horvitz, Tom Mitchell, and Nils Nilsson. 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, 1995 AAAI Spring Symposium.
- 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.
- Local Search Strategies for Satisfiability Testing
- Bart Selman and Henry Kautz, DIMACS Series in Discrete Mathematics. (to appear)
- Knowledge Compilation and Theory Approximation
- Bart Selman and Henry Kautz, J. of the ACM
- Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems
- Bart Selman and Henry Kautz, Proc. IJCAI-93.
- Horn Approximations of Empirical Data
- Henry Kautz, Michael Kearns, and Bart Selman. Artificial Intelligence.
- 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.
- Near-Optimal Plans, Tractability, and Reactivity
- Bart Selman, Proc. KR-94
- Bridging the Gap Between Theory and Applications in Knowledge Representation Research
- Henry Kautz, Slides from invited talk at ECAI-92.
- Planning as Satisfiability
- Henry Kautz and Bart Selman, Proceedings ECAI-92.
- The complexity of path-based defeasible inheritance
- Bart Selman and Hector Levesque, Artificial Intelligence.
- Hard and Easy Distribution of SAT Problems
- David Mitchell, Bart Selman, and Hector Levesque, Proc. AAAI-92.
- A New Method for Solving Hard Satisfiability Problems
- Bart Selman, Hector Levesque, and David Mitchell. Proc. AAAI-92.
- Forming Concepts for Fast Inference
- Henry Kautz and Bart Selman, Proc. AAAI-92.
- Tractable Default Reasoning
- Bart Selman, PhD Thesis, 1991.
- 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, Proc. AAAI-91.
- Integrating Metric and Qualitative Temporal Reasoning
- Henry Kautz and Peter Ladin, Proc. AAAI-91.