Article thumbnail

Completing rule bases in symbolic domains by analogy making

By Henri Prade and Steven Schockaert


The paper considers the problem of completing a set of parallel if-then rules that provides a partial description of how a conclusion variable depends on the values of condition variables, where each variable takes its value among a finite ordered set of labels. The proposed approach does not require the use of fuzzy sets for the interpretation of these labels or for defining similarity measures, but rather relies on the extrapolation of missing rules on the basis of analogical proportions that hold for each variable between the labels of several parallel rules. The analogical proportions are evaluated for binary and multiple-valued variables on the basis of a logical expression involving Lukasiewicz implication. The underlying assumption is that the mapping partially specified by the given rules is as regular as suggested by these rules. A comparative discussion with other approaches is presented

Topics: QA75 Electronic computers. Computer science, QA76 Computer software
Publisher: Atlantis Press
Year: 2011
DOI identifier: 10.2991/eusflat.2011.76
OAI identifier: oai:
Provided by: ORCA
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.