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]. © 2002 Springer-Verlag.
Cite
CITATION STYLE
East, D., & Truszczyński, M. (2002). The aspps system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 533–536). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
