2005 | OriginalPaper | Buchkapitel
Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers
verfasst von : Lengning Liu, Mirosław Truszczyński
Erschienen in: Logic Programming and Nonmonotonic Reasoning
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.