Prioritized Logic Programs (PLPs) [Sakama and Inoue, 2000] introduce
explicit representation of priorities to logic programs.
They realize various types of (prioritized) commonsense reasoning in
artificial intelligence including preference abduction
[Inoue and Sakama, 1999].
Recently, the authors realize a sound and complete procedure
for computing preferred answer sets of a PLP [Wakaki et al, 2003].
The procedure uses techniques of answer set programming (ASP),
and also extends the original PLP by accommodating dynamic preferences
in the language.
The PLP procedure is implemented on top of the ASP solver
DLV using C++, and
is now running under the Linux/Windows operating systems as ``the PLP system''.
The system is available at the URL:
which provides binaries of the current release and
the instruction on how to use the system. Some examples are also found there.
Keywords: prioritized logic programming, answer set programming