Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!newsgate.duke.edu!news.mathworks.com!newsfeed.internetmci.com!uwm.edu!news.cse.psu.edu!rutgers!venus.sun.com!ames!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, A Principled Approach Towards ...
Message-ID: <1996Jun10.200603.12890@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 40
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Mon, 10 Jun 1996 20:06:03 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce the publication of the following article:

Bhansali, S., Kramer, G.A. and Hoar, T.J. (1996)
  "A Principled Approach Towards Symbolic Geometric Constraint Satisfaction", 
   Volume 4, pages 419-443.

   Available in HTML, Postscript (933K) and compressed Postscript (325K).
   An online appendix (example plan fragment) is also a available (7K).
   For quick access via your WWW browser, use this URL:
     http://www.cs.washington.edu/research/jair/abstracts/bhansali96a.html
   More detailed instructions are below.

   Abstract: An important problem in geometric reasoning is to find the
   configuration of a collection of geometric bodies so as to satisfy a
   set of given constraints. Recently, it has been suggested that this
   problem can be solved efficiently by symbolically reasoning about
   geometry. This approach, called degrees of freedom analysis, employs a
   set of specialized routines called plan fragments that specify how to
   change the configuration of a set of bodies to satisfy a new
   constraint while preserving existing constraints. A potential
   drawback, which limits the scalability of this approach, is concerned
   with the difficulty of writing plan fragments.  In this paper we
   address this limitation by showing how these plan fragments can be
   automatically synthesized using first principles about geometric
   bodies, actions, and topology.

The article is available via:
   
 -- comp.ai.jair.papers (also see comp.ai.jair.announce)

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html
    For direct access to this article and related files try:
       http://www.cs.washington.edu/research/jair/abstracts/bhansali96a.html

 -- Anonymous FTP from either of the two sites below.

    Carnegie-Mellon University (USA):
	ftp://p.gp.cs.cmu.edu/usr/jair/pub/volume4/bhansali96a.ps
    The University of Genoa (Italy):
	ftp://ftp.mrg.dist.unige.it/pub/jair/pub/volume4/bhansali96a.ps

    The compressed PostScript file is named bhansali96a.ps.Z (325K)
    An online appendix is also available, named bhansali96a-appendix.txt (7K).

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND and our automailer will respond. To
    get the Postscript file, use the message body GET volume4/bhansali96a.ps 
    (Note: Your mailer might find this file too large to handle.) 
    To obtain the online appendix, use the body GET volume4/bhansali96a-appendix.txt
    Only one can file be requested in each message.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, visit our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.



