Skip to main content

An Application of Clasp in the Study of Logics

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)

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

Abstract

We show how to use the Answer Set Programming (ASP) tool called clasp to prove that there exists a unique three-valued paraconsistent logic that satisfies the substitution property and is sound with respect to da Costa C ω logic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béziau, J.Y.: The paraconsistent logic Z. A possible solution to jaskowski’s problem. Logic and Logical Philosophy 15, 99–111 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carnielli, W.A., Marcos, J.: Limits for paraconsistent calculi. Notre Dame Journal of Formal Logic 40(3), 375–390 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. da Costa, N.C.A.: On the theory of inconsistent formal systems. PhD thesis, Curitiva: Editora UFPR, Brazil (1963) (in Portuguese)

    Google Scholar 

  4. da Costa, N.C.A., Béziau, J.-Y., Bueno, O.A.S.: Aspects of paraconsistent logic. Logic Journal of the IGPL 3(4), 597–614 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Galindo, M.J.O., Ramírez, J.R.A., Carballido, J.L.: Logical weak completions of paraconsistent logics. J. Log. Comput. 18(6), 913–940 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user’s guide to gringo, clasp, clingo, and iclingo, http://potassco.sourceforge.net

  7. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R., Bowen, K. (eds.) 5th Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  8. Mendelson, E.: Introduction to Mathematical Logic, 3rd edn. Wadsworth, Belmont (1987)

    Book  MATH  Google Scholar 

  9. Osorio, M., Carballido, J.L.: Brief study of G’3 logic. Journal of Applied Non-Classical Logic 18(4), 475–499 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Osorio, M., Navarro, J.A., Arrazola, J., Borja, V.: Logics with common weak completions. Journal of Logic and Computation 16(6), 867–890 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. van Dalen, D.: Logic and Structure, 2nd edn. Springer, Berlin (1980)

    Book  MATH  Google Scholar 

  12. Zepeda, C., Carballido, J.L., Marín, A., Osorio, M.: Answer set programming for studying logics. In: Special Session MICAI 2009, Puebla, México, pp. 153–158. IEEE Computer Society, Los Alamitos (2009), ISBN: 13 978-0-7695-3933-1

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Osorio, M., Carballido, J.L., Zepeda, C. (2011). An Application of Clasp in the Study of Logics. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics