🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: aus.computers.ai
Article #963

CFP:PRICAI96 WS on Inducing Complex Representations

#963
From: Aditya Ghose
Date: Mon, 04 Mar 1996 00:00
118 lines
5011 bytes
CALL FOR PAPERS/PARTICIPATION

Workshop on INDUCING COMPLEX REPRESENTATIONS

August 26, 1996, Cairns, Queensland, Australia

held in conjunction with the The Fourth Pacific Rim 
International Conference on Artificial Intelligence (PRICAI-96)

FOCUS:

The past few years have witnessed the development of several 
complex inductive paradigms where the underlying knowledge 
representation is more complex than that of the conventional 
propositional concept-learning systems and hence potentially 
more useful in real-life applications. Much of this activity 
has focussed on the induction of logic programs or Horn 
clause theories, giving rise to the area of Inductive Logic 
Programming (ILP). More recently, there has been growing 
interest in the problem of inducing theories in a variety of 
distinct but related formalisms. These include 
constraint-based representations, including constraint logic 
programs (this is often referred to as the problem of 
Inductive Constraint Logic Programming or ICLP), nonmonotonic 
theories, spatial representations and diagrammatic 
representations, to name but a few. This workshop seeks to 
bring together researchers from all of these areas, to identify 
commonalities in the methods utilized and to encourage 
cross-fertilization of ideas.

Specifically, the areas of interest for this workshop include, 
but are not limited to:

* Inductive Logic Programming. Much of the research on inducing 
complex representations has been motivated by and is based on 
results from the ILP area. New ILP results are thus of interest 
to this workshop, specially results that may eventually apply 
to other inductive paradigms as well.

*Inductive Constraint Logic Programming.
Topics of interest include:
(1). Constraint induction: Much needs to be done in defining 
techniques for inducing constraints in the well-known constraint 
domains. Of interest as well is the issue of integrating 
domain-specific constraint induction methods to obtain techniques 
for inducing constraint logic programs which operate on multiple 
domains.
(2). Adaptation of ILP techniques to ICLP. 
(3). Definition of semantics for inducing constraint logic programs.
(4). Learnability results for knowledge represented in the form of 
constraint logic programs.
(5). Studies on the utility of constraint induction algorithms in
speedup learning for constraint solving. 
(6). Applications of constraint induction (e.g. robot
motion , spatial reasoning ) and reports of working ICLP systems.

* Inducing nonmonotonic representations. Frameworks for inducing 
non-monotonic representations need to be addressed. Recent studies 
have focussed on inducing logic programs with different notions of 
negation. Much remains to be done to clarify the role of frameworks 
for inducing non-monotonic logic programs and other  non-monotonic 
representations.

* Inducing spatial representations.  

* Inducing diagrammatic representations.

ORGANIZING COMMITTEE:

Koichi Furukawa (Keio University, Japan) Co-chair
Randy Goebel (University of Alberta, Canada) Co-chair
Fumio Mizoguchi (Science University of Tokyo, Japan) 
Srinivas Padmanabhuni (University of Alberta, Canada)
Aditya Ghose (University of Sydney, Australia)

SUBMISSION DETAILS:

Authors should submit either full papers (up to 12 pages) or 
extended abstracts (3 to 5 pages). Electronic submission in 
the form of postscript files is preferred.  In cases where 
this is impossible please send 4 copies to: 

Aditya K. Ghose
Knowledge Systems Group
Basser Department of Computer Science
University of Sydney
Sydney NSW 2006 Australia

Email: aditya@cs.su.oz.au

Persons wishing to participate but not present a paper should 
submit a brief statement of interest describing their focus 
and background.


IMPORTANT DATES:

     Deadline for submission: April 30, 1996 
     Notification of authors: May 31, 1996 
     Final version due: June 21, 1996 
     Workshop: August 26, 1996 


PROCEEDINGS:

The workshop will have an informal proceedings, to be made 
available to the participants at the event. If sufficiently 
many quality papers are submitted, it is anticipated that a 
collection of selected papers will be published as a book 
and/or in a journal. 

REGISTRATION:

The workshop registration fee is Aus. $ 60.00. Every workshop
participant must also be registered for the main conference. 
At least one author of each accepted paper must register for 
the workshop.
Technical Details
Message-ID: <4hdr5v$aqv@staff.cs.su.oz.au>
Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 1132b9,af033da21f776c0b,start
X-Google-Attributes: gid1132b9,public
From: aditya@cs.su.oz.au (Aditya Ghose)
Subject: CFP:PRICAI96 WS on Inducing Complex Representations
Date: 1996/03/04
Message-ID: <4hdr5v$aqv@staff.cs.su.oz.au>
X-Deja-AN: 141970889
distribution: aus
organization: Basser Dept of Computer Science, University of Sydney, Australia
newsgroups: aus.computers.ai