Pbmodels: software to compute stable models by pseudoboolean solvers

Authors:
Lengning Liu;Mirosław Truszczyński
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY;Department of Computer Science, University of Kentucky, Lexington, KY
Venue:
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Year:
2005

Citing 5
Cited 8

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Extending and implementing the stable model semantics

Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
Properties of programs with monotone and convex constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Solving linear pseudo-Boolean constraint problems with local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Logic programs with monotone abstract constraint atoms*

Theory and Practice of Logic Programming
On the relation among answer set solvers

Annals of Mathematics and Artificial Intelligence
A First Order Forward Chaining Approach for Answer Set Computing

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Properties and applications of programs with monotone and convex constraints

Journal of Artificial Intelligence Research
Answer sets for logic programs with arbitrary abstract constraint atoms

Journal of Artificial Intelligence Research
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Testing and debugging techniques for answer set solver development

Theory and Practice of Logic Programming
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Quantified Score

Hi-index	0.00

Visualization

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.