An Smodels system with limited lookahead computation

Authors:
Gayathri Namasivayam;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'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 4
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Extending and implementing the stable model semantics

Artificial Intelligence
Generalizing Boolean satisfiability I: background and survey of existing work

Journal of Artificial Intelligence Research
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an answer-set programming solver smodels derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels-outperforms smodels and demonstrate the computational potential of our approach.