Skip to main content
Journal Article

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2173 402-405
DOI: 10.1007/3-540-45402-0_31
7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

East, D., & Truszczyński, M. (2001). Aspps - An implementation of answer-set programming with propositional schemata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2173, 402–405. https://doi.org/10.1007/3-540-45402-0_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free