JAIR Volume 10 (1999)
Michael Wellman, Editor in Chief
480 pp., references, index, illus., $85.00 softcover, ISBN 978-1-55860-663-0
[Add to Cart] [View Cart]
Contents
Order of Magnitude Comparisons of Distance / 1-38
E. Davis
Solving Highly Constrained Search Problems with Quantum Computers / 39-66
T. Hogg
A Counterexample to Theorems of Cox and Fine / 67-85
J. Y. Halpern
Efficient Implementation of the Plan Graph in STAN / 87-115
D. Long and M. Fox
Modeling Belief in Dynamic Systems, Part II: Revision and Update / 117-167
N. Friedman and J. Y. Halpern
Cooperation between Top-Down and Bottom-Up Theorem Provers / 169-198
D. Fuchs and M. Fuchs
Probabilistic Deduction with Conditional Constraints over Basic Events / 199-241
T. Lukasiewicz
Learning to Order Things / 243-270
W. W. Cohen, R. E. Schapire, and Y. Singer
Issues in Stacked Generalization / 271-289
K. M. Ting and I. H. Witten
Variational Probabilistic Inference and the QMR-DT Network / 291-322
T. S. Jaakkola and M. I. Jordan
Constructing Conditional Plans by a Theorem-Prover / 323-352
J. Rintanen
Squeaky Wheel Optimization / 353-373
D. E. Joslin and D. P. Clements
Efficient Heuristic Hypothesis Ranking / 375-397
S. Chien, A. Stechert, and D. Mutz
Extensible Knowledge Representation: the Case of Description Reasoners / 399-434
A. Borgida
Variational Cumulant Expansions for Intractable Distributions / 435-455
D. Barber and P. van de Laar
The Good Old Davis-Putnam Procedure Helps Counting Models / 457-477
E. Birnbaum and E. L. Lozinskii