Volume 9 Masthead

Published: 1998-08-01

Articles

The Computational Complexity of Probabilistic Planning

M. L. Littman, J. Goldsmith, M. Mundhenk

1-36

PDF PS PS.Z

The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference

O. Ledeniov, S. Markovitch

37-97

PDF PS PS.Z

Computational Aspects of Reordering Plans

C. Backstrom

99-137

PDF PS PS.Z

Adaptive Parallel Iterative Deepening Search

D. J. Cook, R. C. Varnell

139-165

PDF PS HTML

Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians

A. Ruiz, P. E. Lopez-de-Teruel, M. C. Garrido

167-217

PDF PS PS.Z

The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem

B. Vandegriend, J. Culberson

219-245

PDF PS Data

An Empirical Approach to Temporal Reference Resolution

J. M. Wiebe, T. P. O'Hara, Thorsten Ohrstrom-Sandgren, K. J. McKeever

247-293

PDF PS HTML

The Ariadne's Clew Algorithm

E. Mazer, J. M. Ahuactzin, P. Bessiere

295-316

PDF PS HTML PS.Z

AntNet: Distributed Stigmergetic Control for Communications Networks

G. Di Caro, M. Dorigo

317-365

PDF PS PS.Z

The Automatic Inference of State Invariants in TIM

M. Fox, D. Long

367-421

PDF PS

Complexity of Prioritized Default Logics

J. Rintanen

423-461

PDF PS PS.Z

A Temporal Description Logic for Reasoning about Actions and Plans

A. Artale, E. Franconi

463-506

PDF PS PS.Z