IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-015-9634-3_8.html
   My bibliography  Save this book chapter

Towards Grammars of Decision Algorithms

In: Where Mathematics, Computer Science, Linguistics and Biology Meet

Author

Listed:
  • Lech Polkowski

    (Polish-Japanese Institute of Information Technology
    Warsaw University of Technology, Institute of Mathematics)

  • Andrzej Skowron

    (Warsaw University of Technology, Institute of Mathematics)

Abstract

Rough mereology is a paradigm allowing for approximate reasoning in data oriented approach. It is rooted in Rough Set Theory [4]. Rough sets and rough mereology have been applied in particular to problems of formal language and grammar theories [2], [3] by Păun, Polkowski and Skowron and to problems of synthesis of grammars from data about multi-agent systems [8]. Here, we continue the topic of [8] on a meta-level: we introduce rough mereological distances (similarity measures) not only on granules of knowledge but also on pairs of granules (i.e. on decision rules) as well as on collections of pairs (i.e. on decision algorithms). This will provide a tool for extending the construction of synthesis grammars proposed in [8] in terms of granules to synthesis grammars defined in terms of decision algorithms.

Suggested Citation

  • Lech Polkowski & Andrzej Skowron, 2001. "Towards Grammars of Decision Algorithms," Springer Books, in: Carlos Martín-Vide & Victor Mitrana (ed.), Where Mathematics, Computer Science, Linguistics and Biology Meet, chapter 0, pages 85-95, Springer.
    • Handle: RePEc:spr:sprchp:978-94-015-9634-3_8
    DOI: 10.1007/978-94-015-9634-3_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-015-9634-3_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.