The influential Nonlin hierarchical partial order planning system,
developed by Austin Tate (http://www.aiai.ed.ac.uk/~bat/bat.html) in the
1970s and onwards in the University of Edinburgh is now available and
working again.
Nonlin was originally written in Pop2, then converted to Pop-11
in the 1980s.
However Nonlin stopped working several years ago because Pop-11 evolved
as a language -- described here
http://www.cs.bham.ac.uk/research/poplog/primer/index.html
Austin recently decided to make it run in current versions of Pop-11 and
now it works in both Unix/Linux Poplog and Windows poplog -- both
available from here:
http://www.cs.bham.ac.uk/research/poplog/freepoplog.html
http://www.poplog.org
Nonlin is available in browsable form in this directory
http://www.cs.bham.ac.uk/research/poplog/nonlin/
which also includes a downloadable zip file (about 750 Kbytes)
containing the package and instructions.
It is hoped that later the original 1975 technical report can be scanned
in and made avaiable as a PDF file.
Nonlin now has its own home page
http://www.aiai.ed.ac.uk/project/nonlin/
Both directories include a Readme.txt file that includes instructions
and also a review of Nonlin and other influential planning systems.
Subject: Rao's "Reminiscences of Influential Papers in Planning"
From: Subbarao Kambhampati
Date: Tue, 26 Nov 2002 11:53:08 -0700
Paper: Austin Tate: Generating Project Networks. IJCAI 1977: 888-893
Further information, including sample problem domain definitions using
the nonlin task formalism (TF) can be found in these directories:
http://www.cs.bham.ac.uk/research/poplog/nonlin/nonlin
http://www.cs.bham.ac.uk/research/poplog/nonlin/nonlin/tf/
Further information can be found by giving
nonlin+planner
to http://www.google.com
Aaron
====
Aaron Sloman, ( http://www.cs.bham.ac.uk/~axs/ )
School of Computer Science, The University of Birmingham, B15 2TT, UK
EMAIL A.Sloman AT cs.bham.ac.uk (ReadATas@please !)
PAPERS: http://www.cs.bham.ac.uk/research/cogaff/ (And free book on Philosophy of AI)
FREE TOOLS: http://www.cs.bham.ac.uk/research/poplog/freepoplog.html
|