Towards Grammars of Decision Algorithms

Lech Polkowski () and Andrzej Skowron ()
Additional contact information
Lech Polkowski: Polish-Japanese Institute of Information Technology
Andrzej Skowron: Warsaw University of Technology, Institute of Mathematics

Chapter Chapter 8 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 85-95 from Springer

Abstract: 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.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().