aspps --- an implementation of answer-set programming with propositional schemata
| dc.creator | Truszczynski, Deborah East. Miroslaw | |
| dc.date | 2001-07-19 | |
| dc.date.accessioned | 2026-07-07T03:17:22Z | |
| dc.date.available | 2026-07-07T03:17:22Z | |
| dc.description | 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. | |
| dc.description | 4 pages; Proceedings of LPNMR 2001 (Springer Verlag) | |
| dc.identifier | https://arxiv.org/abs/cs/0107029 | |
| dc.identifier | http://arxiv.org/abs/cs/0107029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30700 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1;I.2.4;D.I.6 | |
| dc.title | aspps --- an implementation of answer-set programming with propositional schemata | |
| dc.type | text |