Showing cs.LOShow all
3 papers · 1 filter
cs.LO2008
Mnesors for databases
Gilles Champenois
We add commutativity to axioms defining mnesors and substitute a bitrop for the lattice. We show that it can be applied to relational database querying: set union, intersection and…
cs.LO2008
Grainy Numbers
Gilles Champenois
Grainy numbers are defined as tuples of bits. They form a lattice where the meet and the join operations are an addition and a multiplication. They may be substituted for the real…
cs.LO2007
From vectors to mnesors
Gilles Champenois
The mnesor theory is the adaptation of vectors to artificial intelligence. The scalar field is replaced by a lattice. Addition becomes idempotent and multiplication is interpreted…