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.
| Original language | English |
|---|---|
| Pages (from-to) | 402-405 |
| Number of pages | 4 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2173 |
| DOIs | |
| State | Published - 2001 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)