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.
Contact: Mushthofa : unintendedchoice at gmail DOT com
Use Patent Claims
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.