JAIR 1997

19 papers

A Complete Classification of Tractability in RCC-5 Peter Jonsson, Thomas Drakengren

A Model Approximation Scheme for Planning in Partially Observable Stochastic Domains Nevin Lianwen Zhang, Wenju Liu

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty Dorothy L. Mammen, Tad Hogg

A Uniform Framework for Concept Definitions in Description Logics Giuseppe De Giacomo, Maurizio Lenzerini

Analysis of Three-Dimensional Protein Images Laurence Leherte, Janice I. Glasgow, Kim Baxter, Evan W. Steeg, Suzanne Fortier

Bidirectional Heuristic Search Reconsidered Hermann Kaindl, Gerhard Kainz

Connectionist Theory Refinement: Genetically Searching the Space of Network Topologies David W. Opitz, Jude W. Shavlik

Defining Relative Likelihood in Partially-Ordered Structures Joseph Y. Halpern

Dynamic Non-Bayesian Decision Making Dov Monderer, Moshe Tennenholtz

Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time Thomas Drakengren, Peter Jonsson

Flaw Selection Strategies for Partial-Order Planning Martha E. Pollack, David Joslin, Massimo Paolucci

Identifying Hierarchical Structure in Sequences: A Linear-Time Algorithm Craig G. Nevill-Manning, Ian H. Witten

Improved Heterogeneous Distance Functions D. Randall Wilson, Tony R. Martinez

Lifeworld Analysis Philip E. Agre, Ian Horswill

Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference Adnan Darwiche, Gregory M. Provan

SCREEN: Learning a Flat Syntactic and Semantic Spoken Language Analysis Using Artificial Neural Networks Stefan Wermter, Volker Weber

Storing and Indexing Plan Derivations Through Explanation-Based Analysis of Retrieval Failures Laurie H. Ihrig, Subbarao Kambhampati

Towards Flexible Teamwork Milind Tambe

When Gravity Fails: Local Search Topology Jeremy Frank, Peter C. Cheeseman, John C. Stutz