Skip to main content
SpringerLink
Log in

Algorithm for Generating Finite Totally Ordered Monoids

  • Conference paper
  • First Online:
Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 611))

Abstract

The semantics of fuzzy logic is typically based on negative totally ordered monoids. This contribution describes an algorithm generating in a step-wise fashion all finite structures of this kind.

M. Petrík—supported by the Czech Science Foundation (GAČR) under Project 15-07724Y (Totally ordered monoids).

T. Vetterlein—supported by the Austrian Science Fund (FWF) under Project I 1923-N25 (New perspectives on residuated posets).

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 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. Aczél, J.: Quasigroups, nets and nomograms. Adv. Math. 1, 383–450 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bartušek, T.: Fuzzy operations on finite sets of truth values (in Czech). Master’s thesis, Czech Technical University, Prague (2001)

    Google Scholar 

  3. Bartušek, T., Navara, M.: Program for generating fuzzy logical operations and its use in mathematical proofs. Kybernetika 38, 235–244 (2002)

    MathSciNet  MATH  Google Scholar 

  4. Bělohlávek, R., Vychodil, V.: Residuated lattices of size \(\le \) 12. Order 27, 147–161 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blaschke, W., Bol, G.: Geometrie der Gewebe, topologische Fragen der Differentialgeometrie (in German). Springer, Berlin (1939)

    MATH  Google Scholar 

  6. De Baets, B., Mesiar, R.: Discrete triangular norms. In: Rodabaugh, S.E., Klement, E.P. (eds.) Topological and Algebraic Structures in Fuzzy Sets. Trends in Logic, vol. 20, pp. 389–400. Springer, Netherlands (2003)

    Chapter  Google Scholar 

  7. De Baets, B., Mesiar, R.: Triangular norms on product lattices. Fuzzy Sets Syst. 104, 61–75 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Esteva, F., Godo, L.: Monoidal t-norm based logic: towards a logic for left-continuous t-norms. Fuzzy Sets Syst. 124, 271–288 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Evans, K., Konikoff, M., Madden, J.J., Mathis, R., Whipple, G.: Totally ordered commutative monoids. Semigroup Forum 62, 249–278 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Grillet, P.A.: Semigroups. An Introduction to the Structure Theory. Marcel Dekker, New York (1995)

    MATH  Google Scholar 

  11. Howie, J.M.: An Introduction to Semigroup Theory. Academic Press, London (1976)

    MATH  Google Scholar 

  12. Petrík, M., Vetterlein, T.: Algorithm to generate the Archimedean, finite, negative tomonoids. In: Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems, pp. 42–47. Kitakyushu, December 2014

    Google Scholar 

  13. Petrík, M., Vetterlein, T.: Rees coextensions of finite, negative tomonoids. J. Log. Comput. (2015). doi:10.1093/logcom/exv047

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Engineering, Czech University of Life Sciences, Prague, Czech Republic

    Milan Petrík

  2. Institute of Computer Science, Academy of Sciences, Prague, Czech Republic

    Milan Petrík

  3. Department of Knowledge-Based Mathematical Systems, Johannes Kepler University, Linz, Austria

    Thomas Vetterlein

Authors
  1. Milan Petrík
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Vetterlein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Milan Petrík .

Editor information

Editors and Affiliations

  1. INESC-ID,Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal

    Joao Paulo Carvalho

  2. LIP 6, Université Pierre et Marie Curie, Paris, France

    Marie-Jeanne Lesot

  3. School of Industrial Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands

    Uzay Kaymak

  4. IDMEC,Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal

    Susana Vieira

  5. LIP6, Université Pierre et Marie Curie, CNRS, Paris, France

    Bernadette Bouchon-Meunier

  6. Iona College, Machine Intelligence Institute, New Rochelle, New York, USA

    Ronald R. Yager

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Petrík, M., Vetterlein, T. (2016). Algorithm for Generating Finite Totally Ordered Monoids. In: Carvalho, J., Lesot, MJ., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R. (eds) Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2016. Communications in Computer and Information Science, vol 611. Springer, Cham. https://doi.org/10.1007/978-3-319-40581-0_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40581-0_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40580-3

  • Online ISBN: 978-3-319-40581-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation