Goal: Find consequences with minimal number of clues.
Clues?
Idea:
How can we find consequences?
\( \exists clues :: \mathcal{Kb} : \exists reif : \exists prop, subj, val, dt: dt \neq U \land \forall extensions :: \mathcal{Kb} : Theory(PK, clues, reif, extensions) \Rightarrow extensions(prop,subj,val, dt)\)
Penne | Farfall | spirelli | Arrabi | Bologn | Carbon | ||
---|---|---|---|---|---|---|---|
Andrea | |||||||
Bart | |||||||
Casper |
arrabi | |||
Bologn | |||
Carbon |
My instance
Penne | Farfall | spirelli | Arrabi | Bologn | Carbon | ||
---|---|---|---|---|---|---|---|
Andrea | X | - | - | - | - | X | |
Bart | - | X | - | X | - | - | |
Casper | - | - | X | - | X | - |
arrabi | - | X | - |
Bologn | - | - | X |
Carbon | X | - | - |
My instance
Transitivity