Download
s(ASP) is an implementation of the stable model semantics of logic programming. Unlike similar systems, it does not employ any form of grounding. This allows s(ASP) to execute programs that are not finitely groundable, including those which make use of lists and terms. Work on s(ASP) is supported by the National Science Foundation under Grant No. 1423419.
Details of how s(ASP) works can be found in the following paper:
Marple, Kyle, Elmer Salazar, and Gopal Gupta. "Computing Stable Models of Normal
Logic Programs Without Grounding." arXiv preprint arXiv:1709.00501 (2017)
(https://arxiv.org/abs/1709.00501).
Features
- Ungrounded Stable Model Semantics
Categories
InterpretersLicense
GNU General Public License version 3.0 (GPLv3)Follow s(ASP)
Other Useful Business Software
Crowdtesting That Delivers | Testeum
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of s(ASP)!