Skip to main content
SpringerLink
Log in

The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021)

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

Abstract

This paper introduces the full versions of the non-clausal connection provers nanoCoP for first-order classical logic, nanoCoP-i for first-order intuitionistic logic and nanoCoP-M for several first-order multimodal logics. The enhancements added to the core provers include several techniques to improve performance and usability, such as a strategy scheduling and the output of a detailed non-clausal connection proof for all covered logics. Experimental evaluations for all provers show the effectiveness of the integrated optimizations.

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 EPUB and 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

Notes

  1. 1.

    Provers available under the GNU General Public License at http://leancop.de/nanocop/, http://leancop.de/nanocop-i/, and http://leancop.de/nanocop-m/.

  2. 2.

    ECLiPSe Prolog 5.x is available at https://eclipseclp.org/Distribution/Builds/. Newer versions of ECLiPSe Prolog are missing important features (e.g. the possibility to switch on a global occurs check) and have a significantly lower performance.

References

  1. Beckert, B., Posegga, J.: leanTAP: lean tableau-based deduction. J. Autom. Reason. 15(3), 339–358 (1995)

    Article  Google Scholar 

  2. Benzmüller, C., Otten, J., Raths, T.: Implementing and evaluating provers for first-order modal logics. In: De Raedt, L., et al. (eds.) 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 163–168. IOS Press, Amsterdam (2012)

    Google Scholar 

  3. Bibel, W.: Matings in matrices. Commun. ACM 26(11), 844–852 (1983)

    Article  MathSciNet  Google Scholar 

  4. Bibel, W.: Automated Theorem Proving. Artificial Intelligence, 2nd edn. F. Vieweg und Sohn, Wiesbaden (1987)

    Book  Google Scholar 

  5. Bibel, W., Otten, J.: From Schütte’s formal systems to modern automated deduction. In: Kahle, R., Rathjen, M. (eds.) The Legacy of Kurt Schütte, pp. 217–251. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-49424-7_13

    Chapter  Google Scholar 

  6. Ebner, G.: Herbrand constructivization for automated intuitionistic theorem proving. In: Cerrito, S., Popescu, A. (eds.) TABLEAUX 2019. LNCS (LNAI), vol. 11714, pp. 355–373. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29026-9_20

    Chapter  MATH  Google Scholar 

  7. Ebner, G., Hetzl, S., Reis, G., Riener, M., Wolfsteiner, S., Zivota, S.: System description: GAPT 2.0. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 293–301. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40229-1_20

    Chapter  Google Scholar 

  8. Gentzen, G.: Untersuchungen über das Logische Schließen. Math. Z. 39(176–210), 405–431 (1935)

    Article  MathSciNet  Google Scholar 

  9. Kaliszyk, C., Urban, J.: FEMaLeCoP: fairly efficient machine learning connection prover. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 88–96. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48899-7_7

    Chapter  Google Scholar 

  10. Letz, R., Stenz, G.: Model elimination and connection tableau procedures. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 2015–2112. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  11. Libal, T., Pascucci, M.: Automated reasoning in normative detachment structures with ideal conditions. In: Seventeenth International Conference on Artificial Intelligence and Law, ICAIL 2019, pp. 63–72. Association for Computing Machinery, New York (2019)

    Google Scholar 

  12. Libal, T., Steen, A.: The NAI suite - drafting and reasoning over legal texts. In: Araszkiewicz, M., Rodríguez-Doncel, V. (eds.) 32nd International Conference on Legal Knowledge and Information Systems (JURIX 2019). Frontiers in Artificial Intelligence and Applications, vol. 322, pp. 243–246. IOS Press, Amsterdam (2019)

    Google Scholar 

  13. Olšák, M., Kaliszyk, C., Urban, J.: Property invariant embedding for automated reasoning. In: Giacomo, G.D., et al. (eds.) ECAI 2020. Frontiers in Artificial Intelligence and Applications, vol. 325, pp. 1395–1402. IOS Press, Amsterdam (2020)

    Google Scholar 

  14. Otten, J.: ileanTAP: an intuitionistic theorem prover. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 307–312. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0027422

    Chapter  Google Scholar 

  15. Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 245–261. Springer, Heidelberg (2005). https://doi.org/10.1007/11554554_19

    Chapter  Google Scholar 

  16. Otten, J.: leanCoP 2.0 and ileanCoP 1.2: high performance lean theorem proving in classical and intuitionistic logic (system descriptions). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 283–291. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-71070-7_23

    Chapter  Google Scholar 

  17. Otten, J.: Restricting backtracking in connection calculi. AI Commun. 23(2–3), 159–182 (2010)

    Article  MathSciNet  Google Scholar 

  18. Otten, J.: A non-clausal connection calculus. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS (LNAI), vol. 6793, pp. 226–241. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22119-4_18

    Chapter  Google Scholar 

  19. Otten, J.: MleanCoP: a connection prover for first-order modal logic. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 269–276. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08587-6_20

    Chapter  Google Scholar 

  20. Otten, J.: nanoCoP: a non-clausal connection prover. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 302–312. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40229-1_21

    Chapter  Google Scholar 

  21. Otten, J.: nanoCoP: natural non-clausal theorem proving. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, Sister Conference Best Paper Track. pp. 4924–4928. IJCAI (2017)

    Google Scholar 

  22. Otten, J.: Non-clausal connection calculi for non-classical logics. In: Schmidt, R.A., Nalon, C. (eds.) TABLEAUX 2017. LNCS (LNAI), vol. 10501, pp. 209–227. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66902-1_13

    Chapter  Google Scholar 

  23. Otten, J., Bibel, W.: leanCoP: lean connection-based theorem proving. J. Symb. Comput. 36(1–2), 139–161 (2003)

    Article  MathSciNet  Google Scholar 

  24. Otten, J., Bibel, W.: Advances in connection-based automated theorem proving. In: Hinchey, M.G., Bowen, J.P., Olderog, E.-R. (eds.) Provably Correct Systems. NMSSE, pp. 211–241. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-48628-4_9

    Chapter  Google Scholar 

  25. Raths, T., Otten, J.: The QMLTP problem library for first-order modal logics. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 454–461. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31365-3_35

    Chapter  Google Scholar 

  26. Raths, T., Otten, J., Kreitz, C.: The ILTP problem library for intuitionistic logic. J. Autom. Reason. 38, 261–271 (2007)

    Article  MathSciNet  Google Scholar 

  27. Schulz, S., Cruanes, S., Vukmirović, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 495–507. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-29436-6_29

    Chapter  Google Scholar 

  28. Steen, A., Benzmüller, C.: The higher-order prover Leo-III. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 108–116. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94205-6_8

    Chapter  Google Scholar 

  29. Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reason. 59(4), 483–502 (2017)

    Article  Google Scholar 

  30. Waaler, A.: Connections in nonclassical logics. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1487–1578. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  31. Wallen, L.A.: Automated Deduction in Nonclassical Logics. MIT Press, Cambridge (1990)

    Google Scholar 

  32. Zombori, Z., Urban, J., Brown, C.E.: Prolog technology reinforcement learning prover. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 489–507. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51054-1_33

    Chapter  Google Scholar 

Download references

Acknowledgements

The author would like to thank Wolfgang Bibel for his helpful feedback.

Author information

Authors and Affiliations

  1. Department of Informatics, University of Oslo, Oslo, Norway

    Jens Otten

Authors
  1. Jens Otten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jens Otten .

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Anupam Das

  2. University of Genoa, Genoa, Italy

    Sara Negri

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Otten, J. (2021). The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics. In: Das, A., Negri, S. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2021. Lecture Notes in Computer Science(), vol 12842. Springer, Cham. https://doi.org/10.1007/978-3-030-86059-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86059-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86058-5

  • Online ISBN: 978-3-030-86059-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation