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