资 源 简 介
This project provides an architecture and implementation of the evaluation of logic programs with bounded predicate arities which guarantees to be in polynomial space complexity bound.
The implementation utilizes current ASP solvers (in this case, dlv) and Prolog systems (in this case, XSB) as the back-end solver components in the evaluation steps.
The implementation was done as part of the work leading to the Master Thesis titled: "Evaluation of Answer Set Programs with Bounded Predicate Arities", carried out by Mushthofa under the supervision of Thomas Eiter and Wolfgang Faber at the Faculty of Informatics, TU Wien on 2009.
We provide here the full source code of the implementation, the full text of the thesis, as well as some test instances used to generate experiment data in the thesis. An implementation of a Meta-interpreter which was part of the preliminary works leading to the methods used in the thesis is provided as well.
Publicatio
