Abstract
Abstract 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.KeywordsLogic ProgramReasoning TaskSecurity InterestExtend Logic ProgramDynamic PreferenceThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
