List of contents of
Artificial Intelligence
Volume 69 (1994)
- j-aij-69-1
- Alberto Segre and Charles Elkan:
A high-performance explanation-based learning algorithm.
Pages 1-50.
- j-aij-69-51
- Feng Zhao:
Extracting and representing qualitative behaviors of complex systems in phase space.
Pages 51-92.
- j-aij-69-93
- Alan M. Frisch and Peter Haddawy:
Anytime deduction for probabilistic logic.
Pages 93-122.
- j-aij-69-123
- Giorgio Satta and Oliviero Stock:
Bidirectional context-free grammar parsing for natural language processing.
Pages 123-164.
- j-aij-69-165
- Tom Bylander:
The computational complexity of propositional STRIPS planning.
Pages 165-204.
- j-aij-69-205
- Shie-Jue Lee and David A. Plaisted:
Problem solving by searching for models with a theorem prover.
Pages 205-233.
- j-aij-69-235
- Subbarao Kambhampati:
Multi-contributor causal structures for planning: a formalization and evaluation.
Pages 235-278.
- j-aij-69-279
- Hussein Almuallim and Thomas G. Dietterich:
Learning Boolean concepts in the presence of many irrelevant features.
Pages 279-305.
- j-aij-69-307
- Simon Kasif and Arthur L. Delcher:
Local consistency in parallel constraint satisfaction networks.
Pages 307-327.
- j-aij-69-329
- Georg Gottlob and Zhang Mingyi:
Cumulative default logic: finite characterization, algorithms, and complexity.
Pages 329-345.
- j-aij-69-347
- Christos H. Papadimitriou and Martha Sideri:
Default theories that always have extensions.
Pages 347-357.
- j-aij-69-359
- Tad Hogg and Colin P. Williams:
The hardest constraint problems: a double phase transition.
Pages 359-377.
- j-aij-69-379
- G. Neelakantan Kartha:
Two counterexamples related to Baker's approach to the frame problem.
Pages 379-391.
- j-aij-69-393
- Gunther Sablon, Luc De Raedt, and Maurice Bruynooghe:
Iterative versionspaces.
Pages 393-409.
29-Jul-97 16:44