Ockham's razor and reasoning about information flow
Mehrnoosh Sadrzadeh
TL;DR
This paper explores the minimal algebraic structures necessary for reasoning about information flow, questioning whether complex Boolean algebras are essential, and investigates weaker frameworks for multi-agent scenarios.
Contribution
It introduces simplified algebraic frameworks that retain reasoning capabilities about information flow in multi-agent systems, reducing the complexity of traditional structures.
Findings
Weaker algebraic structures can effectively model information flow.
Simplified frameworks facilitate compositional reasoning in multi-agent scenarios.
The study challenges the necessity of full Boolean algebra complexity.
Abstract
What is the minimal algebraic structure to reason about information flow? Do we really need the full power of Boolean algebras with co-closure and de Morgan dual operators? How much can we weaken and still be able to reason about multi-agent scenarios in a tidy compositional way? This paper provides some answers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge · Security and Verification in Computing