Aspps - An implementation of answer-set programming with propositional schemata

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish
Pages (from-to)402-405
Number of pages4
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2173
DOIs
StatePublished - 2001

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Aspps - An implementation of answer-set programming with propositional schemata'. Together they form a unique fingerprint.

Cite this