Prioritized Logic Programs (PLPs) [7] introduce explicit representation of priorities to logic programs. They realize various types of (prioritized) commonsense reasoning in artificial intelligence including preference abduction [5]. Recently, the authors realize a sound and complete procedure for computing preferred answer sets of a PLP [8]. The procedure uses techniques of answer set programming (ASP) [6], 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 [3] using C++, and is now running under the Linux/Windows operating systems as "the PLP system". The system is available at the URL: http://www.ailab.se.shibaura-it.ac.jp/comppas.html, which provides binaries of the current release and the instruction on how to use the system. Some examples are also found there.
CITATION STYLE
Wakaki, T., Inoue, K., Sakama, C., & Nitta, K. (2004). The PLP system. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3229, pp. 706–709). Springer Verlag. https://doi.org/10.1007/978-3-540-30227-8_62
Mendeley helps you to discover research relevant for your work.