lpsms is an answer-set programming system which computes stable models of logic programs.  It consists of:
 


parstab requires PVM to use, and is a work in progress.

Courtesy of Tommi Syrj<E4>nen <tommi.syrjanen@hut.fi>, lpsms also includes lparse, which grounds human-readable logic programs, converting them into a format acceptable to simplify, stratify, etc. The latest version of lparse is available from the smodels web site
at http://saturn.tcs.hut.fi/Software/smodels/lparse/.

The lpsms suite of programs can be downloaded from: lpsms


ACKNOWLEDGEMENT

Activities discussed on this site are partially supported by the National Science Foundation. Any opinions, findings, and conclusions or recommendations expressed here  are those of the author(s) and do not necessarily reflect the views of the National Science Foundation



Back to TOP