An Application of Deontic Logic to Information System Constraints

Authors:
Jose Carmo;Robert Demolombe;Andrew J. I. Jones
Affiliations:
Dipartimento de Mathematica, Universidade da Madeira, Campus Universitario da Penteada, 9000-390 Funchal, Madeira, Portugal;ONERA, Department of Information Processing and Modeling, Toulouse, France;Department of Computer Science, King's College London, The Strand, London WC2R 2LS, England
Venue:
Fundamenta Informaticae - Deontic Logic in Computer Science
Year:
2001

Citing 12
Cited 0

Integrity = validity + completeness

ACM Transactions on Database Systems (TODS)
Relational databases and knowledge bases

Relational databases and knowledge bases
What should a database know?

Journal of Logic Programming
The role of deontic logic in the specification of information systems

Logics for databases and information systems
Integrity constraints: semantics and applications

Logics for databases and information systems
Logical approaches to incomplete information: a survey

Logics for databases and information systems
An introduction to database systems (7th ed.)

An introduction to database systems (7th ed.)
First-order modal logic

First-order modal logic
To trust information sources: a proposal for a modal logical framework

Trust and deception in virtual societies
The Events Method for View Updating in Deductive Databases

EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Integrity Constraints Checking In Deductive Databases

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Managing Data Quality and Integrity in Federated Databases

Proceedings of the IFIP TC11 Working Group 11.5, Second Working Conference on Integrity and Internal Control in Information Systems: Bridging Business Requirements and Research Results

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the field of information systems the term "constraint" is applied to statements of various kinds. Here we start from the analysis of a simple example to characterise the different kinds of constraints. It is shown that constraints may be necessary truths or deontic constraints. Moreover, deontic constraints are classified into three different types: deontic constraints about the world, deontic constraints about the representation of the world (self-completeness), and deontic constraints about the links between the world and its representation (validity and completeness). We describe a modal logical framework to define the different types of constraints, to characterise their violations, and to show how to repair their violations. Two different general forms of deontic constraints are considered, namely O(&phis;→ψ) and &phis;→O&phis;, and it is shown that, except for deontic constraints about the world, the latter is more appropriate. Special issues related to the definition of quantifiers in the context of modal operators are also considered.