Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Layered graph logic as an assertion language for access control policy models

From MaRDI portal
Publication:2987042
Jump to:navigation, search

DOI10.1093/LOGCOM/EXV020zbMath1361.68223OpenAlexW2475588791MaRDI QIDQ2987042

Kevin McDonald, Matthew Collinson, David J. Pym

Publication date: 17 May 2017

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6c23c9c60e91fe7e50b2999eeb280e225a384304


zbMATH Keywords

modellingsubstructural logicaccess controllayered graphs


Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)


Related Items (5)

Coalgebraic completeness-via-canonicity for distributive substructural logics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Intuitionistic Layered Graph Logic ⋮ A Substructural Epistemic Resource Logic







This page was built for publication: Layered graph logic as an assertion language for access control policy models

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2987042&oldid=15997927"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki