aspps --- an implementation of answer-set programming with propositional schemata
Deborah East. Miroslaw Truszczynski
TL;DR
This paper introduces aspps, a new answer-set programming system that processes PS+ theories by grounding and then computing models, enhancing the capabilities of answer-set programming with propositional schemata.
Contribution
The paper presents the design and implementation of aspps, a novel system integrating grounding and solving modules for answer-set programming with propositional schemata.
Findings
Successfully processes PS+ theories
Efficient grounding and model computation
Extends answer-set programming capabilities
Abstract
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to process PS+ theories. It consists of two basic modules. The first module, psgrnd, grounds an PS+ theory. The second module, referred to as aspps, is a solver. It computes models of ground PS+ theories.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems