Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!scramble.lm.com!news.math.psu.edu!news.cse.psu.edu!uwm.edu!newsfeed.internetmci.com!in2.uu.net!news.reference.com!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Practical Methods for Proving ...
Message-ID: <1996Apr23.193321.8404@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: Tue, 23 Apr 1996 19:33:21 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

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

Marchiori, E. (1996)
  "Practical Methods for Proving Termination of General Logic Programs", 
   Volume 4, pages 179-208.

   Available in Postscript (331K) and compressed Postscript (154K).
   For quick access via your WWW browser, use this URL:
     http://www.cs.washington.edu/research/jair/abstracts/marchiori96a.html
   More detailed instructions are below.

   Abstract: Termination of logic programs with negated body atoms (here
   called general logic programs) is an important topic. One reason is
   that many computational mechanisms used to process negated atoms, like
   Clark's negation as failure and Chan's constructive negation, are
   based on termination conditions.  This paper introduces a methodology
   for proving termination of general logic programs w.r.t. the Prolog
   selection rule.  The idea is to distinguish parts of the program
   depending on whether or not their termination depends on the selection
   rule. To this end, the notions of low-, weakly up-, and up-acceptable
   program are introduced.  We use these notions to develop a methodology
   for proving termination of general logic programs, and show how
   interesting problems in non-monotonic reasoning can be formalized and
   implemented by means of terminating general logic programs.

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/marchiori96a.html

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

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

    The compressed PostScript file is named marchiori96a.ps.Z (154K)

 -- 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/marchiori96a.ps 
    (Note: Your mailer might find this file too large to handle.) 
    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.



