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
Your top-rated shield against malware and online scams | Avast Free Antivirus
Our antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of s(ASP)!