Skip to main content
SpringerLink
Log in
Book cover

Correct Reasoning pp 24–39Cite as

A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7265))

Abstract

In this paper we propose an extension of Answer Set Programming (ASP) by non-Herbrand functions, i.e. functions over non-Herbrand domains. Introducing support for such functions allows for an economic and natural representation of certain kinds of knowledge that are comparatively cumbersome to represent in ASP. The key difference between our approach and other techniques for the support of non-Herbrand functions is that our extension is more “conservative” from a knowledge representation perspective. In fact, we purposefully designed the new language so that (1) the representation of relations is fully retained; (2) the representation of knowledge using non-Herbrand functions follows in a natural way from the typical ASP strategies; (3) the semantics is an extension of the the semantics of ASP from [9], allowing for a comparatively simple incorporation of various extensions of ASP such as weak constraints, probabilistic constructs and consistency-restoring rules.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balduccini, M., Gelfond, M.: Diagnostic reasoning with A-Prolog. Journal of Theory and Practice of Logic Programming (TPLP) 3(4-5), 425–461 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  3. Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Journal of Theory and Practice of Logic Programming (TPLP) 9(1), 57–144 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baselice, S., Bonatti, P.A.: A Decidable Subclass of Finitary Programs. Journal of Theory and Practice of Logic Programming (TPLP) 10(4-6), 481–496 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buccafurri, F., Leone, N., Rullo, P.: Adding Weak Constraints to Disjunctive Datalog. In: Proceedings of the 1997 Joint Conference on Declarative Programming APPIA-GULP-PRODE (1997)

    Google Scholar 

  6. Cabalar, P.: Functional Answer Set Programming. Journal of Theory and Practice of Logic Programming (TPLP) 11, 203–234 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Enhancing ASP by Functions: Decidable Classes and Implementation Techniques. In: Proceedings of the Twenty-Fourth Conference on Artificial Intelligence, pp. 1666–1670 (2010)

    Google Scholar 

  8. Gebser, M., Ostrowski, M., Schaub, T.: Constraint Answer Set Solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235–249. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)

    Article  MATH  Google Scholar 

  10. Lifschitz, V.: Logic Programs with Intensional Functions (Preliminary Report). In: ICLP11 Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2011 (July 2011)

    Google Scholar 

  11. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP 1994), pp. 23–38 (1994)

    Google Scholar 

  12. Lin, F., Wang, Y.: Answer Set Programming with Functions. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 454–465 (2008)

    Google Scholar 

  13. Marek, V.W., Truszczynski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Berlin (1999)

    Chapter  Google Scholar 

  14. Syrjänen, T.: Omega-Restricted Logic Programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267–279. Springer, Heidelberg (2001)

    Google Scholar 

  15. Wang, Y., You, J.-H., Yuan, L.-Y., Zhang, M.: Weight Constraint Programs with Functions. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 329–341. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kodak Research Laboratories, Eastman Kodak Company, Rochester, NY, 14650-2102, USA

    Marcello Balduccini

Authors
  1. Marcello Balduccini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Natural Science, Sabanci University, Orhanli, 34956, Tuzla, Istanbul, Turkey

    Esra Erdem

  2. School of Computing, Informatics and Decision Systems Engineering, Arizona State University, P.O. Box 878809, 85287, Tempe, AZ, USA

    Joohyung Lee

  3. Department of Computer Science, University of Kentucky, 329 Rose Street, 40506, Lexington, KY, USA

    Yuliya Lierler

  4. Department of Artificial Intelligence, Politechnical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain

    David Pearce

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Balduccini, M. (2012). A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30743-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30742-3

  • Online ISBN: 978-3-642-30743-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation