{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:33Z","timestamp":1763458893299,"version":"3.45.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CTC-0208535"],"award-info":[{"award-number":["CTC-0208535"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["F49620-02-1-0101"],"award-info":[{"award-number":["F49620-02-1-0101"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-01-1-0795","N00014-00-1-03-41N00014-01-10-511"],"award-info":[{"award-number":["N00014-01-1-0795","N00014-00-1-03-41N00014-01-10-511"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:p>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 \u201cMay Alice access the file?\u201d, 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.<\/jats:p>","DOI":"10.1145\/1380564.1380569","type":"journal-article","created":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T09:35:10Z","timestamp":1217928910000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Using First-Order Logic to Reason about Policies"],"prefix":"10.1145","volume":"11","author":[{"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[{"name":"Cornell University"}]},{"given":"Vicky","family":"Weissman","sequence":"additional","affiliation":[{"name":"Cornell University"}]}],"member":"320","published-online":{"date-parts":[[2008,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/155183.155225"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/319709.319718"},{"key":"e_1_2_1_3_1","unstructured":"Apple Computer I. 2004. iTunes: Terms of sale. Available at http:\/\/www.apple.com\/support\/ itunes\/legal\/policies.html.]]"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009380.1009672"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/293910.293151"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Blaze M. Feigenbaum J. Ioannidis J. and Keromytis A. 1998. The KeyNote trust management system. Available at http:\/\/www.cis.upenn.edu\/~angelos\/keynote.html.]]","DOI":"10.17487\/rfc2704"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/525080.884248"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647502.728332"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"B\u00f6rger E. Gr\u00e4del E. and Gurevich Y. 1997. The Classical Decision Problem. Perspectives of Mathematical Logic. Springer-Verlag Berlin Germany. 2nd printing (Universitext) 2001.]]","DOI":"10.1007\/978-3-642-59207-2"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204036"},{"volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference (KR'00)","author":"Chomicki J.","key":"e_1_2_1_11_1","unstructured":"Chomicki, J., Lobo, J., and Naqvi, S. 2000. A logic programming approach to conflict resolution in policy management. In Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference (KR'00). 121--132.]]"},{"key":"e_1_2_1_12_1","unstructured":"ContentGuard. 2001. XrML: The digital rights language for trusted content and services. Available at http:\/\/www.xrml.org\/.]]"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/829514.830540"},{"key":"e_1_2_1_14_1","unstructured":"Ellison C. Frantz B. Lampson B. Rivest R. Thomas B. and Ylonen T. 1999a. Simple public key certificate. Available at http:\/\/world.std.com\/~cme\/spki.txt. Internet RFC 2693.]]"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Ellison C. Frantz B. Lampson B. Rivest R. Thomas B. and Ylonen T. 1999b. SPKI certificate theory. Available at http:\/\/www.ietf.org\/html.charters\/spki-charter.html. Internet RFC 2693.]]","DOI":"10.17487\/RFC2693"},{"volume-title":"A Mathematical Introduction to Logic","author":"Enderton H. B.","key":"e_1_2_1_16_1","unstructured":"Enderton, H. B. 1972. A Mathematical Introduction to Logic. Academic Press, New York.]]"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/300830.300834"},{"key":"e_1_2_1_18_1","volume-title":"Database Systems: The Complete Book","author":"Garcia-Molina H.","year":"2002","unstructured":"Garcia-Molina, H., Ullman, J. D., and Widom, J. 2002. Database Systems: The Complete Book. Prentice Hall, New Jersey.]]"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/146937.146940"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/320473.320482"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/959088.959093"},{"key":"e_1_2_1_22_1","unstructured":"Halpern J. Y. van der Meyden R. and Schneider F. 1999. Logical foundations for trust management. Unpublished manuscript.]]"},{"volume-title":"Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03)","author":"Halpern J. Y.","key":"e_1_2_1_23_1","unstructured":"Halpern, J. Y. and Weissman, V. 2003. Using first-order logic to reason about policies. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03). 187--201.]]"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326558"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646962.712107"},{"key":"e_1_2_1_26_1","volume-title":"ODRL: The open digital rights language initiative.","author":"Iannella R.","year":"2001","unstructured":"Iannella, R. 2001. ODRL: The open digital rights language initiative. Available at http:\/\/odrl.net\/.]]"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00962920"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/383891.383894"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884431"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/138873.138874"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/605434.605438"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645773.667961"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-005-0073-0"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/829514.830539"},{"key":"e_1_2_1_35_1","volume-title":"Information rights management in Office Professional Edition","author":"Microsoft","year":"2003","unstructured":"Microsoft. 2003. Information rights management in Office Professional Edition 2003. Available at http:\/\/www.microsoft.com\/office\/editions\/prodinfo\/technologies\/irm.mspx.]]"},{"key":"e_1_2_1_36_1","volume-title":"XACML: The eXtensible Access Control Markup Language, version 2.0.","author":"Moses T.","year":"2005","unstructured":"Moses, T. 2005. XACML: The eXtensible Access Control Markup Language, version 2.0. Available at http:\/\/www.xacml.org.]]"},{"key":"e_1_2_1_37_1","unstructured":"MPEG. 2004. Information technology---Multimedia framework (MPEG-21) -- Part 5: Rights Expression Language (ISO\/IEC 21000-5:2004). Available at http:\/\/www.iso.ch\/iso\/en\/.]]"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322198"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","unstructured":"Nerode A. and Shore R. 1997. Logic for Applications 2nd ed. Springer-Verlag New York.]]","DOI":"10.5555\/548904"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/249246"},{"volume-title":"Workshop on Issues in the Theory of Security (WITS'04)","author":"Pucella R.","key":"e_1_2_1_41_1","unstructured":"Pucella, R. and Weissman, V. 2004. A formal foundation for ODRL rights. In Workshop on Issues in the Theory of Security (WITS'04).]]"},{"key":"e_1_2_1_42_1","unstructured":"Rivest R. and Lampson B. 1996. SDSI --- A simple distributed security infrastructure. Available at http:\/\/theory.lcs.mit.edu\/~cis\/sdsi.html.]]"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Robinson G. and Wos L. 1983. Paramodulation and theorem-proving in first-order theories with equality. In Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970 J. Siekmann and G. Wrightson Eds. Springer Berlin Heidelberg 298--313.]]","DOI":"10.1007\/978-3-642-81955-1_19"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"volume-title":"Proceedings of the 8th European Conference on Digital Libraries (ECDL'04)","author":"Weissman V.","key":"e_1_2_1_47_1","unstructured":"Weissman, V. and Lagoze, C. 2004. Towards a policy language for humans and computers. In Proceedings of the 8th European Conference on Digital Libraries (ECDL'04). 513--525.]]"},{"key":"e_1_2_1_48_1","volume-title":"v","author":"Wright G. H.","year":"1951","unstructured":"Wright, G. H. v. 1951. An Essay in Modal Logic. North-Holland, Amsterdam.]]"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1380564.1380569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1380564.1380569","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1380564.1380569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:36:26Z","timestamp":1763458586000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1380564.1380569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["10.1145\/1380564.1380569"],"URL":"https:\/\/doi.org\/10.1145\/1380564.1380569","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"type":"print","value":"1094-9224"},{"type":"electronic","value":"1557-7406"}],"subject":[],"published":{"date-parts":[[2008,7]]},"assertion":[{"value":"2005-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}