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].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. East and M. Truszczyński. aspps — an implementation of answer-set programming with propositional schemata. In Proceedings of Logic Programming and Nonmonotonic Reasoning Conference, LPNMR 2001, LNAI 2173, pages 402–405, Springer Verlag, 2001.
D. East and M. Truszczyński. Propositional satisfiability in answer-set programming. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence, KI’2001, LNAI 2174, pages 138–153, Springer Verlag, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
East, D., Truszczyński, M. (2002). The aspps System. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_49
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive