
Each entry in this table of contents provides links to an individual article and its appendices (if any).
Kambhampati, S. (2000) "Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan", Volume 12, pages 1-34.Barber, F. (2000) "Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts", Volume 12, pages 35-86.
Neal, R.M. (2000) "On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note)", Volume 12, pages 87-91.
Xu, K. and Li, W. (2000) "Exact Phase Transitions in Random Constraint Satisfaction Problems", Volume 12, pages 93-103.
Kaminka, G.A. and Tambe, M. (2000) "Robust Agent Teams via Socially-Attentive Monitoring", Volume 12, pages 105-147.
Baxter, J. (2000) "A Model of Inductive Bias Learning", Volume 12, pages 149-198.
Tobies, S. (2000) "The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics", Volume 12, pages 199-217.
Becker, A., Bar-Yehuda, R. and Geiger, D. (2000) "Randomized Algorithms for the Loop Cutset Problem", Volume 12, pages 219-234.
Singer, J., Gent, I.P. and Smaill, A. (2000) "Backbone Fragility and the Local Search Cost Peak", Volume 12, pages 235-270.
Nebel, B. (2000) "On the Compilability and Expressive Power of Propositional Planning Formalisms", Volume 12, pages 271-315.
Halpern, J.Y. (2000) "Axiomatizing Causal Reasoning", Volume 12, pages 317-337.
Koehler, J. and Hoffmann, J. (2000) "On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm", Volume 12, pages 338-386.
Walker, M.A. (2000) "An Application of Reinforcement Learning to Dialogue Strategy Selection in a Spoken Dialogue System for Email", Volume 12, pages 387-416.
© Copyright 2000, AI Access Foundation