NonMatching

Bx Examples Repository

Title: NonMatching

Version: 0.1

Type: Precise

Overview

This artificial example illustrates a bx that is correct and hippocratic, but not matching or undoable.

Models

M = {0,1}

N = {a,b,c}

Consistency

R a b c
0 T T F
1 F T T

Consistency Restoration

Writing Rf, Rb for the forward and backward restoration functions:

Rf a b c
0 a b a
1 c b c
Rb a b c
0 0 0 1
1 0 1 1

Properties [optional section]

  • Correct
  • Hippocratic
  • Not undoable
  • Not matching

Discussion

"bad combinations" are 0 with c and 1 with a. If the consistency restoration function encounters one of these, it replaces the element it has to change with the element that's a member of the other bad combination.

References

@article{DBLP:journals/eceasst/Stevens12,
author = {Perdita Stevens},
title = {Observations relating to the equivalences induced on model
sets by bidirectional transformations},
journal = {ECEASST},
volume = {49},
year = {2012},
ee = {http://journal.ub.tu-berlin.de/eceasst/article/view/714},
bibsource = {DBLP, http://dblp.uni-trier.de}
}

Author(s)

Perdita Stevens

Reviewer(s)

none yet

Comments

This is where any member of the wiki can comment.

Unless otherwise stated, the content of this page is licensed under GNU Free Documentation License.