The aspps system is an answer-set programming system based on the extended logic of propositional schemata 2, which allows variables but not function symbols in the language. We denote this logic PS+. A theory in the logic PS+ is a pair (D,P), where D is a set of ground atoms (only constant symbols as arguments) representing an instance of a problem (input data), and P is a set of PS+-clauses representing a program (an abstraction of a problem). The meaning of a PS+-theory T = (D,P) is given by a family of PS+-models 2.
%0 Book Section
%1 East02
%A East, Deborah
%A Truszczyński, Mirosłlaw
%D 2002
%J Logics in Artificial Intelligence
%K answer-set-programming, aspps, logic-of-propositional-schemata
%P 533--536
%R 10.1007/3-540-45757-7\_49
%T The aspps System
%U http://dx.doi.org/10.1007/3-540-45757-7\_49
%X The aspps system is an answer-set programming system based on the extended logic of propositional schemata 2, which allows variables but not function symbols in the language. We denote this logic PS+. A theory in the logic PS+ is a pair (D,P), where D is a set of ground atoms (only constant symbols as arguments) representing an instance of a problem (input data), and P is a set of PS+-clauses representing a program (an abstraction of a problem). The meaning of a PS+-theory T = (D,P) is given by a family of PS+-models 2.
@incollection{East02,
abstract = {{The aspps system is an answer-set programming system based on the extended logic of propositional schemata [2], which allows variables but not function symbols in the language. We denote this logic PS+. A theory in the logic PS+ is a pair (D,P), where D is a set of ground atoms (only constant symbols as arguments) representing an instance of a problem (input data), and P is a set of PS+-clauses representing a program (an abstraction of a problem). The meaning of a PS+-theory T = (D,P) is given by a family of PS+-models [2].}},
added-at = {2011-05-04T16:04:17.000+0200},
author = {East, Deborah and Truszczy\'{n}ski, Miros{\l}law},
biburl = {https://www.bibsonomy.org/bibtex/26fcb8f5fdd2c88429b7a1ea4e7dfdcd1/baisemain},
citeulike-article-id = {5221316},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-45757-7\_49},
citeulike-linkout-1 = {http://www.springerlink.com/content/5c3dhwda78ev5mw3},
doi = {10.1007/3-540-45757-7\_49},
interhash = {90a103b46780d43b3a465072718a3365},
intrahash = {6fcb8f5fdd2c88429b7a1ea4e7dfdcd1},
journal = {Logics in Artificial Intelligence},
keywords = {answer-set-programming, aspps, logic-of-propositional-schemata},
pages = {533--536},
posted-at = {2009-07-21 21:57:49},
priority = {2},
timestamp = {2011-05-04T16:04:34.000+0200},
title = {{The aspps System}},
url = {http://dx.doi.org/10.1007/3-540-45757-7\_49},
year = 2002
}