Plingo: a system for probabilistic reasoning in answer set programming

HIGHLIGHTS

• What: For solving, the basic algorithm of plingo follows the approach of lpmln2asp by reducing probabilistic reasoning to clingo`s regular optimization and enumeration modes. To this exact method (represented by the upper blue arrows in Figure 1), plingo implements an approximation method (red arrows in Figure 1) based on the approach presented in Pajunen and Janhunen . For P-log, the authors evaluate two implementations, which the authors call plog-naive and plog-dco (Balaii, 2017). The aim of the third experiment is to compare plingo and lpmln2asp on the task of MPE inference.
• Who . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.