TY - JOUR
T1 - Aspps - An implementation of answer-set programming with propositional schemata
AU - East, Deborah
AU - Truszczyński, Mirosław
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84867761452&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867761452&partnerID=8YFLogxK
U2 - 10.1007/3-540-45402-0_31
DO - 10.1007/3-540-45402-0_31
M3 - Article
AN - SCOPUS:84867761452
SN - 0302-9743
VL - 2173
SP - 402
EP - 405
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -