Skip to main content
SpringerLink
Log in
Book cover

Correct Reasoning pp 87–101Cite as

Here and There among Logics for Logic Programming

  • Chapter

  • 1117 Accesses

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

Abstract

We explore the range of propositional logics suitable for logic programs under the stable semantics, starting with the logic of here-and-there as a primary representative. It will be shown, however, that there are other potential logics in the range. Still, all such logics are based on essentially the same semantics, so their differences are largely due to choice of the underlying language. Our representation suggests a more tolerant answer to the question ‘What is the Logic of Logic Programming?’, as well as some further expressive opportunities in using logic programs as a general knowledge representation formalism.

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. Anderson, A.R., Belnap Jr., N.D.: Entailment: The Logic of Relevance and Necessity. Princeton University Press, Princeton (1975)

    MATH  Google Scholar 

  2. Arieli, O., Avron, A.: Reasoning with logical bilattices. Journal of Logic, Language, and Information 5, 25–63 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Belnap Jr., N.D.: A useful four-valued logic. In: Dunn, M., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 8–41. D. Reidel (1977)

    Google Scholar 

  4. Bochman, A.: Biconsequence relations: A four-valued formalism of reasoning with inconsistency and incompleteness. Notre Dame Journal of Formal Logic 39(1), 47–73 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bochman, A.: A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion. Journal of Logic Programming 35, 151–170 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bochman, A.: A logical foundation for logic programming II: Semantics of general logic programs. Journal of Logic Programming 35, 171–194 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bochman, A.: A causal logic of logic programming. In: Dubois, D., Welty, C., Williams, M.-A. (eds.) Proc. Ninth Conference on Principles of Knowledge Representation and Reasoning, KR 2004, pp. 427–437. Whistler (2004)

    Google Scholar 

  8. Bochman, A.: Explanatory Nonmonotonic Reasoning. World Scientific (2005)

    Google Scholar 

  9. Bochman, A.: Logic in nonmonotonic reasoning. In: Brewka, G., Marek, V.W., Truszczynski, M. (eds.) Nonmonotonic Reasoning. Essays Celebrating its 30th Anniversary, pp. 25–61. College Publ. (2011)

    Google Scholar 

  10. Bochman, A., Lifschitz, V.: Yet another characterization of strong equivalence. In: Hermenegildo, M., Schaub, T. (eds.) Technical Communications of the 26th Int’l. Conference on Logic Programming (ICLP 2010). Leibniz International Proceedings in Informatics (LIPIcs), vol. 7, pp. 281–290. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2011)

    Google Scholar 

  11. Cabalar, P., Ferraris, P.: Propositional theories are strongly equivalent to logic programs. TPLP 7(6), 745–759 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Cabalar, P., Pearce, D., Valverde, A.: Reducing Propositional Theories in Equilibrium Logic to Logic Programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 4–17. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. de Jongh, D.H.J., Hendriks, L.: Characterization of strongly equivalent logic programs in intermediate logics. Theory Pract. Log. Program. 3, 259–270 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  15. Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 369–389 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lloyd, J., Topor, R.: Making Prolog more expressive. Journal of Logic Programming 3, 225–240 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS (LNAI), vol. 1216, pp. 57–70. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Pearce, D.: Equilibrium logic. Ann. Math. Artif. Intell. 47(1-2), 3–41 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Holon Institute of Technology, Israel

    Alexander Bochman

Authors
  1. Alexander Bochman
    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

Bochman, A. (2012). Here and There among Logics for Logic Programming. 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_7

Download citation

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

  • 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