Journal of Artificial Intelligence Research (JAIR), Volume 12

Volume 12, 2000

• Subbarao Kambhampati:
  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan. 1-34
  
• Federico Barber:
  Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts. 35-86
  
• Radford M. Neal:
  On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note). 87-91
  
• Ke Xu, Wei Li:
  Exact Phase Transitions in Random Constraint Satisfaction Problems. 93-103
  
• Gal A. Kaminka, Milind Tambe:
  Robust Agent Teams via Socially-Attentive Monitoring. 105-147
  
• Jonathan Baxter:
  A Model of Inductive Bias Learning. 149-198
  
• Stephan Tobies:
  The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics. 199-217
  
• Ann Becker, Reuven Bar-Yehuda, Dan Geiger:
  Randomized Algorithms for the Loop Cutset Problem. 219-234
  
• Josh Singer, Ian P. Gent, Alan Smaill:
  Backbone Fragility and the Local Search Cost Peak. 235-270
  
• Bernhard Nebel:
  On the Compilability and Expressive Power of Propositional Planning Formalisms. 271-315
  
• Joseph Y. Halpern:
  Axiomatizing Causal Reasoning. 317-337
  
• Jana Koehler, Jörg Hoffmann:
  On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm. 338-386
  
• Marilyn A. Walker:
  An Application of Reinforcement Learning to Dialogue Strategy Selection in a Spoken Dialogue System for Email. 387-416