Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Reasoning about termination of pure Prolog programs
Information and Computation
Database security
Role-Based Access Control Models
Computer
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Temporal Access Control Mechanism for Database Systems
IEEE Transactions on Knowledge and Data Engineering
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Access Control for Deductive Databases by Logic Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
| Hi-index | 0.00 |
We show how the family of temporal role-based access control (TRBAC) models from [6], the TRBACO models, may be equivalently represented in a considerably simpler and more efficiently implemented way. We call the latter the TRBACN models. To specify TRBACN models, stratified normal clause logic is sufficient. To compute with TRBACN models, any procedural semantics that enables the perfect model of a stratified theory to be generated may be used. Although TRBACN security models have a much simpler representation than TRBACO models, we show that TRBACN and TRBACO models are equivalent in terms of their expressive power.