1. Chapter 6 - 1 Modeling Theory Allow modeling to be done ontologically (high level of abstraction) Then, systematically transform the application model into predicate calculus for use in reasoning. Objectives

2. Chapter 6 - 2 Assumptions –no recursive relationships (add roles to remove, if necessary) –relationship-set names include associated object-set names –no templates (transform shorthand into underlying constructs) Example Modeling Theory Assumptions & Example

3. Chapter 6 - 3 Generated Predicates Object Sets Relationship Sets Room(x), Room Nr(x), Cost(x), Date(x), Guest(x), Guest Nr(x), Current Guest(x), Future Guest(x), Guarantee Nr(x) Room(x) has Room Nr(y), Room(x) has Cost(y), Guest(x) has reservation for Room(y) on Date(z), Guest(x) has Guest Nr(y) Future Guest(x) has Guarantee Nr(y)

4. Chapter 6 - 4 Generated Rules Referential-Integrity Constraints  x  y(Room(x) has Room Nr(y)  Room(x)  Room Nr(y))... Generalization/Specialization Constraints  x(Current Guest(x)  Future Guest(x)  Guest(x)) Participation Constraints  x(Room(x)   1 y(Room(x) has Cost(y))  x(Cost(x)   1 y(Room(y) has Cost(x))... Co-occurrence Constraints  (  z(Guest(z) has reservation for Room(x) on Date(y))   1 w(Guest(w) has reservation for Room(x) on Date(y)))

5. Chapter 6 - 5 A Valid Interpretation Object-Set Relations Relationship-Set Relations Constraints Room R1 R2 Room Nr 1 2 Cost 90 80 Room has Room Nr R1 1 R2 2  x(Room(x)   1 y(Room(x) has Room Nr(y))...