Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers

Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, pbmodels converts ground logic programs to propositional theories with weight atoms so that stable models correspond to models. Our approach is similar to that used by assat and cmodels. However, unlike these two systems, pbmodels does not compile the weight atoms away. Preliminary experimental results on the performance of pbmodels are promising.

• Type: Conference
• Year: 2005
• Where: LPNMR
• Authors: Lengning Liu, Miroslaw Truszczynski
• Keywords: Logic Programs, LPNMR 2005, Stable Models, Weight Atoms