An Smodels System with Limited Lookahead Computation

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.

• Type: Conference
• Year: 2007
• Where: LPNMR
• Authors: Gayathri Namasivayam, Miroslaw Truszczynski
• Keywords: Answer-set Programming Solver, Lookahead Computations, LPNMR 2007, Programs Smodels− Outperforms