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

Project Activity

See All Activity >

Categories

Interpreters

License

GNU General Public License version 3.0 (GPLv3)

Follow s(ASP)

s(ASP) Web Site

Other Useful Business Software
Intranet Software To Connect Your Employees | Interact Icon
Intranet Software To Connect Your Employees | Interact

Intranet software built for communicators. Connect your enterprise. Drive engagement. Provide a better employee experience.

Join the revolution in workplace communication with an AI-powered intranet.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of s(ASP)!

Additional Project Details

Languages

English

Intended Audience

Developers

User Interface

Console/Terminal, Command-line

Programming Language

Prolog

Related Categories

Prolog Interpreters

Registered

2015-09-15