🚀 go-pugleaf

From: smolka@dfki-gate.dfki.uni-sb.de (Gert Smolka)
To: mod-ki@unido.informatik.uni-dortmund.de
Date: Sat, 11 May 91 13:23:43 +0200
Subject: <mod-ki 0703> Call: Symp. on Principles of Hybrid Reasoning
Keywords: Symposium, Reasoning, 

mod-ki message 0703
************************************************************************
Call for Participation
Symposium on Principles of Hybrid Reasoning
AAAI 1991 Fall Symposium Series
Nov 15-17, Asilomar, CA

One  of  the  most  promising  approaches  to  designing  more-efficient
automated reasoning systems is that of  integrating  multiple  reasoners
to  form  a  hybrid  reasoner.   By   exploiting   the   efficiency   of
special-purpose  reasoners  operating  on  specialized  representations,
hybrid  reasoners  can  outperform  homogeneous  systems.   The   common
challenge  faced  by  all  hybrid-system  designers  is  the  successful
integration of the system's components.

The focus of this symposium will be on architectures for integrating the
components of hybrid reasoners, and, in particular,  on  the  principles
that underlie such architectures. Though  it  seems  unlikely  that  all
hybrid reasoning systems can be explained by a common set of principles,
there are general architectural classes that can each  be  explained  by
common principles. The major goals  of  the  symposium  are  to  explore
principles that have been applied to hybrid reasoners, identify  general
classes to which they apply, and seek unifying themes among the  current
diversity of systems and theoretical models.

Systems of central  interest  are  deductive  systems  that  incorporate
special-purpose   reasoning   modules    operating    on    their    own
representation. Examples include:

 o Unification-based systems that incorporate special-purpose  reasoners
   in their unification algorithms (for example, systems that use sorted
   unification or E-unification);

 o Knowledge representation systems  that  mix  assertional  information
   with terminological information;

 o Deductive systems, including planners,  that  incorporate  constraint
   processing  mechanisms  (especially  constraint  logic  programming);

 o Systems such as theory resolution that  build  domain  theories  into
   reasoning algorithms; 

 o Parsers for feature-based grammars that  use  special  mechanisms  to
   handle constraints among features  or  to  perform  inheritance;  and

 o Deductive systems for modal logic  that  exploit  special  techniques
   for reasoning about the accessibility of possible worlds.

Further examples and discussion can be found in the report on  the  1988
Workshop on Principles of Hybrid Reasoning, which appears in  Volume 11,
Number 5 (special issue) of AI Magazine (January 1991).

In addition to the obvious candidates, we encourage the participation of

 o those   who   have   related   interests--including   interests    in
   non-deductive  systems--that  bear  on  the  central  themes  of  the
   symposium;

 o those whose work on building hybrid reasoners raises questions  about
   underlying principles, sheds light on  the  principles,  or  provides
   empirical results that must be accounted for; and

 o newcomers to the field, especially graduate students.

Prospective participants are encouraged to  contact  the  chair  of  the
program committee (preferably  by  email)  to  obtain  a  more  detailed
description of the symposium's goals and issues. Those wishing to attend
the symposium should  submit  a  statement  of  research  interests  and
accomplishments  (2  pages  maximum),   a   bibliography   of   selected
publications, and, optionally, a paper. Those wishing to  present  their
work for discussion should submit, in  addition,  an  extended  abstract
(4 pages maximum). Five copies of each  submission  should  be  sent  to
arrive by June 14 to:

   Alan Frisch
   Beckman Institute
   University of Illinois
   405 N. Mathews Ave.
   Urbana, IL  61801
   frisch@cs.uiuc.edu

Program Committee:  Alan Frisch (chair), Gert Smolka,
                    Lynn Andrea Stein, Richmond Thomason.
************************************************************************