Computing distributed knowledge as the greatest lower bound of knowledge

DOI10.1007/978-3-030-88701-8_25OpenAlexW3207486432MaRDI QIDQ2695370

Santiago Quintero, Sergio Ramírez, Carlos Pinzón, Frank D. Valencia

Publication date: 30 March 2023

Full work available at URL: https://arxiv.org/abs/2210.08128

zbMATH Keywords

lattice algorithmsdistributive knowledgejoin-endomorphims

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating all finite modular lattices of a given size
• Agreeing to disagree: the non-probabilistic case
• Agreeing to disagree
• On the canonicity of Sahlqvist identities
• Tree structure for distributive lattices and its applications
• Resolving distributed knowledge
• S5 knowledge without partitions
• Varieties of complex algebras
• On closed elements in closure algebras
• On the Lattice of All Join-Endomorphisms of a Lattice
• A completeness theorem in modal logic
• Knowledge and common knowledge in a distributed environment
• Handbook of Spatial Logics
• Proof Theory for Distributed Knowledge
• Bounded distributive lattice expansions
• Counting and Computing Join-Endomorphisms in Lattices
• An improved equivalence algorithm
• Canonical extensions and relational completeness of some substructural logics
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators
• Bounded lattice expansions

This page was built for publication: Computing distributed knowledge as the greatest lower bound of knowledge