Skip to main content
SpringerLink
Log in

aspps — An Implementation of Answer-Set Programming with Propositional Schemata

  • Conference paper
  • First Online:
Logic Programming and Nonmotonic Reasoning (LPNMR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2173))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. AK R system dlv: Progress report, comparisons and benchmarks. In Proceeding of the Sixth International Conference on Knowledge Representation and Reasoning (KR’ 98), pages 406–417. Morgan Kaufmann, 1998. 402

    Google Scholar 

  2. D. East and M. Truszczyński. Propositional satisfiability in answer-set programming. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence, KI’2001. Lecture Notes in Artificial Intelligence, Springer Verlag, 2001. 402, 404

    Google Scholar 

  3. I. Niemelä and P. Simons. Extending the smodels system with cardinality and weight constraints. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer Academic Publishers, 2000. 402

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky Lexington, KY, 40506-0046, USA

    Deborah East & Mirosłlaw Truszczyński

Authors
  1. Deborah East
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mirosłlaw Truszczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Thomas Eiter

  2. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Wolfgang Faber

  3. Department of Computer Science Lexington, University of Kentucky, KY, 40506-0046, USA

    Miros law Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

East, D., Truszczyński, M. (2001). aspps — An Implementation of Answer-Set Programming with Propositional Schemata. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45402-0_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42593-9

  • Online ISBN: 978-3-540-45402-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation