JAIR Volume 12 (2000)
Michael Wellman, Editor in Chief
420 pp., references, index, illus., $85.00 softcover, ISBN 978-1-55860-806-1
[Add to Cart] [View Cart]
Contents
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan / 1-34
S. Kambhampati
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts / 35-86
F. Barber
On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note) / 87-91
R. M. Neal
Exact Phase Transitions in Random Constraint Satisfaction Problems / 93-103
K. Xu and W. Li
Robust Agent Teams via Socially-Attentive Monitoring / 105-147
G. A. Kaminka and M. Tambe
A Model of Inductive Bias Learning / 149-198
J. Baxter
The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics / 199-217
S. Tobies
Randomized Algorithms for the Loop Cutset Problem / 219-234
A. Becker, R. Bar-Yehuda, and D. Geiger
Backbone Fragility and the Local Search Cost Peak / 235-270
J. Singer, I. P. Gent, and A. Smaill
On the Compilability and Expressive Power of Propositional Planning Formalisms / 271-315
B. Nebel
Axiomatizing Causal Reasoning / 317-337
J. Y. Halpern
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm / 338-386
J. Koehler and J. Hoffmann
An Application of Reinforcement Learning to Dialogue Strategy Selection in a Spoken Dialogue System for Email / 387-416
M. A. Walker