👂 🎴 🕸️
Every
bound
needs
a
predicate
:
a
short
''
fixed
vocabulary
word
that
says
exactly
how
its
subject
knot
relates
to
its
object
knot
.
Kastalia
constrains
this
vocabulary
deliberately
--
predicates
live
in
a
proper
Postgres
ENUM
type
''
not
a
free
-
text
column
--
so
that
a
graph
query
can
rely
on
a
closed
''
known
set
of
relation
kinds
rather
than
accidentally
-
inconsistent
free
text
.<
br
><
br
>
This
short
mention
is
just
a
pointer
:
the
full
catalogue
of
predicates
''
with
one
knot
describing
each
''
lives
in
its
own
section
of
this
guide
(
see
<
a
href
=
„
/
438
/
knot
“
>
Predicates
a
>''
further
down
).
A
<
em
>
template
em
>
is
the
piece
of
code
that
decides
how
a
given
knot
(
and
''
typically
''
its
neighbours
in
the
graph
)
gets
turned
into
an
actual
page
a
human
can
read
.
Kastalia
uses
Template
::
Toolkit
(
Perl
'
s
TT
)
for
this
:
each
template
is
a
.
tt
file
living
under
views
/''
free
to
query
the
graph
however
it
needs
and
to
render
the
result
however
it
likes
.<
br
><
br
>
The
same
knot
can
''
in
principle
''
be
rendered
by
several
different
templates
--
a
lecture
knot
might
look
like
a
slide
deck
under
mainframe
''
a
flat
document
under
knot
(
the
default
)''
or
a
node
in
a
force
-
directed
diagram
under
arbre
.
Which
template
applies
is
usually
decided
by
the
knot
'
s
own
template
attribute
''
though
some
domains
additionally
define
a
fixed
<
em
>
canonical
em
>
template
that
every
.
knot
-
style
URL
on
that
domain
gets
routed
through
regardless
(
see
domain
template
in
config
.
yml
).<
br
><
br
>
The
resulting
rendered
page
is
called
a
<
em
>
view
em
>.
The
two
fundamental
tables
of
Kastalia
'
s
database
are
knots
and
bounds
.<
br
><
br
>
A
<
strong
>
knot
strong
>
is
a
single
addressable
unit
of
content
:
it
has
a
unique
knot
id
''
a
knot
name
(
its
path
-
like
''
human
-
readable
label
)''
a
knot
content
(
free
text
''
typically
light
HTML
''
such
as
the
page
you
are
reading
right
now
)''
and
a
set
of
free
-
form
attributes
(
an
open
-
ended
key
-
value
store
--
see
the
Attributes
section
of
this
guide
).<
br
><
br
>
A
<
strong
>
bound
strong
>
connects
two
knots
--
a
sub
(
ject
)
and
an
obj
(
ect
)
--
through
a
predicate
that
names
the
relation
between
them
(
see
the
Predicates
section
).
Bounds
also
carry
an
ord
(
ordering
''
used
whenever
children
/
items
need
a
stable
sequence
)
and
a
bound
creator
(
who
asserted
the
relation
).<
br
><
br
>
Everything
visible
anywhere
in
Kastalia
--
a
course
''
a
presentation
''
a
glossary
entry
''
a
recording
--
is
ultimately
just
some
knots
and
the
bounds
between
them
''
read
out
through
a
template
.
A
knowledge
graph
is
a
graph
whose
nodes
and
edges
are
meant
to
be
interpreted
''
not
just
traversed
:
nodes
stand
for
entities
or
ideas
''
and
edges
carry
a
specific
predicate
(
a
verb
''
in
effect
)
that
says
exactly
how
the
two
nodes
relate
--
is
parent
''
translates
''
illustrates
''
and
so
on
.<
br
><
br
>
Kastalia
KMS
is
''
at
its
core
''
a
general
-
purpose
engine
for
building
''
editing
and
rendering
exactly
this
kind
of
graph
.
It
does
not
presuppose
any
particular
domain
:
the
same
knots
/
bounds
substrate
underlies
a
university
course
''
a
glossary
of
linguistic
terms
''
an
archive
of
spoken
recordings
''
or
a
tree
of
philosophical
arguments
.
What
differs
between
these
uses
is
only
which
predicates
get
used
''
and
which
<
em
>
template
em
>
is
chosen
to
turn
the
raw
graph
into
something
readable
.
A
graph
''
in
the
mathematical
sense
''
is
simply
a
set
of
nodes
together
with
a
set
of
edges
connecting
pairs
of
nodes
.
Kastalia
treats
its
entire
universe
of
discourse
as
one
big
graph
:
every
stored
unit
of
meaning
is
a
node
(
Kastalia
calls
it
a
<
em
>
knot
em
>)''
and
every
stated
relation
between
two
units
is
a
directed
''
labelled
edge
(
a
<
em
>
bound
em
>).<
br
><
br
>
Unlike
a
tree
''
a
graph
permits
any
node
to
be
reached
from
many
different
directions
--
the
same
knot
can
simultaneously
be
the
child
of
one
category
''
a
member
of
a
group
''
the
illustration
of
another
knot
''
and
the
translation
of
yet
another
.
This
is
precisely
what
lets
Kastalia
model
real
knowledge
''
which
is
rarely
a
strict
hierarchy
.
[Impressum, Datenschutz, Login] Other subprojects of udk.ai linkring: refused.science baumhaus.digital teacher.solar fibel.digital gardens.digital