AAAI-97 Workshop
Building Resource-Bounded Reasoning Systems
To be held at the
Fourteenth National Conference on Artificial Intelligence
July 27, 1997
Providence, Rhode Island
Limited computational resources are a primary concern in almost every
AI application. Since the mid 1980's, there has been a growing
interest in the development of computational methods that offer a
tradeoff between resource consumption and quality of results.
Examples of active research areas in this emerging field include
anytime algorithms, flexible computation techniques, imprecise
computation, memory bounded search, and design-to-time scheduling.
Researchers have developed a large body of knowledge that covers the
construction, composition, and meta-level control of resource-bounded
reasoning systems. The purpose of this workshop is to foster
collaboration among researchers who share an interest in applications
of resource-bounded reasoning is such areas as heuristic search,
constraint satisfaction, probabilistic inference, planning and
scheduling, signal interpretation, medical diagnosis and treatment,
vision, graphics, and intelligent information gathering. What is
common to all these problems is that it is not feasible
(computationally) or desirable (economically) to compute the optimal
answer.
With a primary focus on applications, the workshop will cover
empirical results, case studies, or evaluation of
systems, prototypes or algorithms. Topics of interest include:
- Types of computational tradeoffs in reasoning and search
- Representation and measurement of computational tradeoffs
- Capturing the dependency of performance on problem instance "hardness"
- Embedding flexible computation components in large systems
- Run-time assessment and prediction of solution quality
- Run-time allocation of computational resources
- Characterizing the overall performance of resource-bounded reasoning
systems
Most of this one day workshop will be dedicated to panel and group
discussions of fundamental questions. The particular sessions will be
determined based on participants' interests. We will also try to
accommodate one invited speaker and a small number of paper presentations.
Prospective participants are invited to submit an abstract (5 pages or
less) and/or statements of interest by March 11, 1997. Papers should
be submitted via electronic mail (ASCII or Postscript format) to
shlomo@cs.umass.edu. Researchers working on a particular application
are encouraged to describe the motivation for using resource-bounded
reasoning, the approach to the problem, the mechanisms developed to
monitor and control computational resources, and the benefits and
limitation of the particular model. Applicants are also invited to
propose topics for panels that would be appropriate for the workshop.
SEND SUBMISSIONS AND INQUIRIES TO:
Shlomo Zilberstein
Computer Science Department
LGRC, Box 34610
University of Massachusetts
Amherst, MA 01003-4610
413-545-4189 Fax: 413-545-1249
shlomo@cs.umass.edu
- Submission deadline: March 11, 1997
- Notification date: April 1, 1997
- Final date for camera-ready copies: April 22, 1997
- Louis Hoebel (co-chair), Rome Laboratory,
hoebel@ai.rl.af.mil
- Shlomo Zilberstein (co-chair), University of Massachusetts,
shlomo@cs.umass.edu
- Francois Charpillet, CRIN and INRIA Lorraine,
charp@loria.fr
- Thomas Dean, Brown University,
tld@cs.brown.edu
- Edmund Durfee, University of Michigan,
durfee@umich.edu
durfee@umich.edu
This section will include announcements to workshop participants.
shlomo@cs.umass.edu