In the proof-theoretic view of knowledge bases (KB's), a KB is a set of facts (atomic sentences) and integrity constraints (IC's). An IC is then a sentence which must at least be consistent with the other sentences in the KB. This view obliterates the distinction between, for example, the constraint that age is a non-negative integer (which is true of the universe of discourse (UoD) but may be false in a particular implementation of a KB), and the constraint that a class must have precisely one teacher (which is false of the UoD if a class actually has two teachers). The second constraint is called deontic and constrains the UoD; the first constraint is a necessary truth of the UoD and does not constraint the UoD. Instead, it constrains the implementation of the KB. We show that both types of constraints can be specified in the single framework provided by a deontic variant of dynamic logic, which has the added advantage of being able to specify dynamic constraints as well. We give a non-trivial example of a KB specification with static, dynamic and deontic constraints.
|Number of pages||20|
|Publication status||Published - Jun 1989|
|Event||2nd Sympsium on Mathematical Fundamentals of Database Systems, MFDBS 1989 - Visegrád, Hungary|
Duration: 26 Jun 1989 → 30 Jun 1989
|Conference||2nd Sympsium on Mathematical Fundamentals of Database Systems, MFDBS 1989|
|Period||26/06/89 → 30/06/89|
|Other||26-30 June 1989|