TY - GEN
T1 - Pbmodels - Software to compute stable models by pseudoboolean solvers
AU - Liu, Lengning
AU - Truszczyński, Mirosław
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33646049696
UR - https://www.scopus.com/pages/publications/33646049696#tab=citedBy
U2 - 10.1007/11546207_37
DO - 10.1007/11546207_37
M3 - Conference contribution
AN - SCOPUS:33646049696
SN - 3540285385
SN - 9783540285380
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 410
EP - 415
BT - Logic Programming and Nonmonotonic Reasoning - 8th International Conference, LPNMR 2005, Proceedings
T2 - 8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005
Y2 - 5 September 2005 through 8 September 2005
ER -