2008/05/14 by Gilles Champenois, Champenois, Gilles
Computer Science · #Advanced Algebra and Logic #Data Management and Algorithms #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #cs.LO
paper · pdf · doi:10.48550/arxiv.0805.2179
openalex publication_date 2008/05/14 · arxiv created 2009/12/15 · arxiv updated 2010/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 selection are redifined only from the mnesor addition and the granular multiplication. Union-compatibility is not required.