aspps - An Implementation of Answer-Set Programming with Propositional Schemata

Authors:
Deborah East;Miroslaw Truszczynski
Affiliations:
-;-
Venue:
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2001

Citing 2
Cited 2

Extending the Smodels system with cardinality and weight constraints

Logic-based artificial intelligence
Propositional Satisfiability in Answer-Set Programming

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence

The aspps System

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Pruning Operators for Disjunctive Logic Programming Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.