Skip to main content

Declarative Problem Solving Using Answer Set Semantics

  • Conference paper
Logic Programming (ICLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4079))

Included in the following conference series:

  • 467 Accesses

Abstract

My dissertation will make the case that answer set semantics can form the basis of powerful, logical NP problem solving tools. The argument is made in two steps. Firstly a logical programming language, AnsProlog CE is proposed and an efficient, parallel implementation is described. This language is then used to solve a variety of diverse real world problems, demonstrating the power and flexibility of this approach.

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

Access this chapter

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

References

  1. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proceedings of (ICLP 1988), pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  2. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Decision Support System for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Leone, N., Eiter, T., Faber, W., et al.: Boosting information integration: The infomix system. In: Proceedings of (SEBD 2005), pp. 55–66 (2005)

    Google Scholar 

  5. Hietalahti, M., Massacci, F., Niemelä, I.: Des: A challenge problem for nonmonotonic reasoning systems. In: Proceedings of (NMR 2000) (2000)

    Google Scholar 

  6. Borchert, P., Anger, C., Schaub, T., Truszczyński, M.: Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 3–7. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brain, M. (2006). Declarative Problem Solving Using Answer Set Semantics. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_48

Download citation

  • DOI: https://doi.org/10.1007/11799573_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

  • Online ISBN: 978-3-540-36636-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics