Logic and information
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Using multiset discrimination to solve language processing problems without hashing
Theoretical Computer Science
Journal of the ACM (JACM)
A short introduction to intuitionistic logic
A short introduction to intuitionistic logic
Design and Semantics of a Decentralized Authorization Language
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
DKAL: Distributed-Knowledge Authorization Language
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Operational Semantics for DKAL: Application and Analysis
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
Strict canonical constructive systems
Fields of logic and computation
Kripke semantics for basic sequent systems
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
New modalities for access control logics: permission, control and ratification
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Noninterference in a predicative polymorphic calculus for access control
Computer Languages, Systems and Structures
Abstract Hilbertian deductive systems, infon logic, and Datalog
Information and Computation
| Hi-index | 0.00 |
Infons are statements viewed as containers of information (rather then representations of truth values). The logic of infons turns out to be a conservative extension of logic known as constructive or intuitionistic. Distributed Knowledge Authorization Language uses additional unary connectives “p said” and “p implied” where p ranges over principals. Here we investigate infon logic and a narrow but useful primal fragment of it. In both cases, we develop model theory and analyze the derivability problem: Does the given query follow from the given hypotheses? Our more involved technical results are on primal infon logic. We construct an algorithm for the multiple derivability problem: Which of the given queries follow from the given hypotheses? Given a bound on the quotation depth of the hypotheses, the algorithm runs in linear time. We quickly discuss the significance of this result for access control.