Although assertions can be combined in propositional logic, an intrinsic relationship to the primitive propositions cannot be stated. In this chapter, we introduce the first-order predicate logic with equality in which the intrinsic relationship of objects, and their attributes can be formalized. Formulas can be interpreted over structures rather than on simple values.
KeywordsPolicy Language Propositional Logic Predicate Logic Predicate Symbol Universal Quantifier
- 1.Becker MY (2005) Cassandra: flexible trust management and its application to electronic health records. Technical report, UCAM-CL-TR-648, University of Cambridge, United Kingdom Google Scholar
- 2.Becker MY, Sewell P (2004) Cassandra: distributed access control policies with tunable expressiveness. In: POLICY ’04: proceedings of the fifth IEEE international workshop on policies for distributed systems and networks. IEEE Press, New York, pp 159–168 Google Scholar
- 4.Bonatti PA, Shahmehri N, Duma C, Olmedilla D, Nejdl W, Baldoni M, Baroglio C, Martelli A, Coraggio P, Antoniou G, Peer J, Fuchs NE (2004) Rule-based policy specification: state of the art and future work. Technical report, Dipatimento di Scienze Fisiche, Universit a di Napoli, Complesso Universitario di Monte Sant Angelo Google Scholar
- 5.Chen F, Sandhu RS (1996) Constraints for role-based access control. In: RBAC ’95: proceedings of the first ACM workshop on role-based access control. ACM, New York, pp 39–46 Google Scholar
- 8.Davis R, Shrobe H, Szolovits P (1993) What is a knowledge representation? AI Mag 14(1):17–33 Google Scholar
- 9.DeMarco T (1978) Structured analysis and system specification. Yourdon Press, New York Google Scholar