Using First-Order Logic to Reason about Policies
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Weissman, Vicky | |
| dc.date | 2006-01-10 | |
| dc.date | 2006-05-15 | |
| dc.date.accessioned | 2026-07-07T06:57:54Z | |
| dc.date.available | 2026-07-07T06:57:54Z | |
| dc.description | A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies have a clear syntax and semantics. We show that further restricting the fragment results in a language that is still quite expressive yet is also tractable. More precisely, questions about entailment, such as `May Alice access the file?', can be answered in time that is a low-order polynomial (indeed, almost linear in some cases), as can questions about the consistency of policy sets. | |
| dc.description | 39 pages, earlier version in Proceedings of the Sixteenth IEEE Computer Security Foundations Workshop, 2003, pp. 187-201 | |
| dc.identifier | https://arxiv.org/abs/cs/0601034 | |
| dc.identifier | http://arxiv.org/abs/cs/0601034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/107146 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Cryptography and Security | |
| dc.subject | H.2.7; K.4.4 | |
| dc.title | Using First-Order Logic to Reason about Policies | |
| dc.type | text |