Editorial Board
A high-performance explanation-based learning algorithm
Extracting and representing qualitative behaviors of complex systems in phase space
Anytime deduction for probabilistic logic
Bidirectional context-free grammar parsing for natural language processing
The computational complexity of propositional STRIPS planning
Problem solving by searching for models with a theorem prover
Multi-contributor causal structures for planning: a formalization and evaluation
Learning Boolean concepts in the presence of many irrelevant features
Local consistency in parallel constraint satisfaction networks
Cumulative default logic: Finite characterization, algorithms, and complexity
Default theories that always have extensions
The hardest constraint problems: A double phase transition
Two counterexamples related to Baker's approach to the frame problem
Iterative versionspaces
Forthcoming papers
Author index—Volume 69 (1994)