notxia/unibo-ai-notes
1
0
Fork 0
mirror of https://github.com/NotXia/unibo-ai-notes.git synced 2025-12-16 11:31:49 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos <noupdate>

Browse Source
This commit is contained in:
Tian Cheng (Riccardo) Xia
2024-01-07 17:26:21 +01:00
parent a7933cf3ba
commit 73fe58ed0b
6 changed files with 28 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/fundamentals-of-ai-and-kr/module2/sections/_ontologies.tex
View File

@ -75,7 +75,7 @@
\item[Exhaustive decomposition] \marginnote{Exhaustive decomposition}
Given a category $c$ and a set of categories $S$, $S$ is an exhaustive decomposition of $c$ iff
any element in $c$ belongs to at least a category in $S$:
\[ \texttt{exhaustiveDecomposition($S$, $c$)} \iff (\forall o \in c \iff \exists c_2 \in S: o \in c_2) \]
\[ \texttt{exhaustiveDecomposition($S$, $c$)} \iff \forall o: (o \in c \iff \exists c_2 \in S: o \in c_2) \]
\item[Partition] \marginnote{Partition}
Given a category $c$ and a set of categories $S$, $S$ is a partition of $c$ when: