Skip to main content

Presenting Basic Graph Logic

  • Conference paper
  • First Online:
Diagrammatic Representation and Inference (Diagrams 2021)

Abstract

In this paper, we present and exemplify the Basic Graph Logic (BGL), this is an initial formalism which can be extended to provide a diagrammatic representation within which Set Theory and, hence, the whole of mathematics can be diagrammatic developed. We present the syntax, semantics, and inference engine of BGL. We introduce and exemplify the BGL-inference rules by showing, throughout diagrammatic proofs, that the BGL-operators satisfy the analogous of the relation algebra axioms, i.e., BGL is build as a distributive complemented lattice with operators satisfying the involutive monoid axioms and the De Morgan’s Theorem K.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Andréka, H., Bredikhin, D.A.: The equational theory of union-free algebras of relations. Algebra Universalis 33, 516–532 (1995)

    Google Scholar 

  2. Curtis, S., Lowe, G.: Proofs with graphs. Sci. Comput. Program. 26, 197–216 (1996)

    Article  MathSciNet  Google Scholar 

  3. de Freitas, R., Veloso, P.A., Veloso, S.R., Viana, P.: On graph reasoning. Inf. Comput. 207, 1000–1014 (2009)

    Article  MathSciNet  Google Scholar 

  4. de Freitas, R., Veloso, P.A.S., Veloso, S.R.M., Viana, P.: A calculus for graphs with complement. In: Goel, A.K., Jamnik, M., Narayanan, N.H. (eds.) Diagrams 2010. LNCS (LNAI), vol. 6170, pp. 84–98. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14600-8_11

    Chapter  Google Scholar 

  5. Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30203-2_23

    Chapter  Google Scholar 

  6. Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 245–296 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leandro Suguitani .

Editor information

Editors and Affiliations

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

Cerioli, M.R., Suguitani, L., Viana, P. (2021). Presenting Basic Graph Logic. In: Basu, A., Stapleton, G., Linker, S., Legg, C., Manalo, E., Viana, P. (eds) Diagrammatic Representation and Inference. Diagrams 2021. Lecture Notes in Computer Science(), vol 12909. Springer, Cham. https://doi.org/10.1007/978-3-030-86062-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86062-2_12

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics