Abstract
We introduce the negations of transactions in the sense of nonperformance as an ingredient of a specification language for integrity constraints. We investigate their (non-trivial) semantics in two stages: firstly a uniform semantics in terms of uninterpreted events, secondly a non-uniform semantics in terms of state (world) transforming functions. In particular we show the use of negated transactions in deontic integrity constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog and J.I. Zucker, “Contrasting Themes in the Semantics of Imperative Concurrency” in Current Trends in Concurrency: Overviews and Tutorials, (eds.) J.W. de Bakker, W.P. de Roever and G. Rozenberg, LNCS 224, Springer, Berlin (1986), pp. 51–121.
J.W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog and J.I. Zucker, Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Con-currency, Journal of Comp. Syst. Sci. 36 (2) (1988), pp. 158–224.
J.A. Bergstra and J.W. Klop, “Process Algebra for Synchronous Communi- cation”, Information and Control 60 (1/3) (1984), pp. 109–137.
M. Broy, “A Theory for Nondeterminism, Parallelism, Communication and Concurrency”, Theoretical Computer Science 45 (1986), pp. 1–62.
F. Dignum, “A Language for Modelling Knowledge Bases”, Ph.D. thesis, Vrije Universiteit, Amsterdam (1989).
F. Dignum and R.P. van de Riet, “Knowledge Base Modelling, Based on Linguistics and Founded in Logic”, Data Knowledge Engineering, (to appear).
J. Fiadeiro and T. Maibaum, “Temporal Reasoning over Deontic Specifica- tions”, Technical Report, Imperial College, London (1989).
D. Haret, “Dynamic Logic” in Handbook of Philosophical Logic (Vol.2), (eds.) D. Gabbay, F. Guenther, Reidel, Dordrecht (1984).
S. Khosla, “System Specification: A Deontic Approach”, Ph.D. thesis, Imperial College, London (1988).
J.-J.Ch. Meyer and E.P. de Vink, “Step Semantics for ”True“ Concurrency with Recursion”, Distributed Computing 3 (1989), pp. 130–145.
J.-J.Ch. Meyer, “Merging Regular Processes by Means of Fixed Point Theory”, Theoretical Computer Science 145 (1986), pp. I93–260.
J.-J.Ch. Meyer, “A Different Approach to Deontic Logic: Deontic Logic Viewed as a Variant of Dynamic Logic”, Notre Dame Journal of Formal Logic (29) (1988), pp. 109–136.
J.-J.Ch. Meyer, “Using Programming Concepts in Deontic Reasoning” in Semantics and Contextual Expression, (eds.) R. Bartsch, J. van Benthem, P. van Emde Boas, Foris, Dordrecht, (to appear).
R. Milner, Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25 (3) (1983), pp. 267–310.
R. Reiter, “On Closed World Databases” in Logic and Databases, (eds.) H. Gallaire and J. Minker, Plenum Press, New York (1978), pp. 55–76.
M. Rem, “Trace Theory and Systolic Computations”, in Proc. PARLE: Parallel Architectures and Languages Europe, Vol.1, (eds.) J.W. de Bakker, A.J. Nijman and P.C. Treleaven, LCNS 258, Springer, Berlin (1987), pp. 14–33.
H. Weigand, “Linguistically Motivated Principles of Knowledge Base Systems”, Ph.D. Thesis, Vrije Universiteit, Amsterdam (1989).
R. Wieringa, J.-J.Ch. Meyer and H. Weigand, “Specifying Dynamic and Deontic Integrity Constraints in Knowledge Bases”, Data Knowledge Engineering 4 (4), (1989).
R. Wieringa, H. Weigand, J.-J.Ch. Meyer and F. Dignum, “The Inheritance of Dynamic and Deontic Integrity Constraints”, IR-199, Vrije Universiteit, Amsterdam (1989).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dignum, F.P.M., Meyer, JJ.C. (1990). Negations of Transactions and Their Use in the Specification of Dynamic and Deontic Integrity Constraints. In: Semantics for Concurrency. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3860-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3860-0_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19625-9
Online ISBN: 978-1-4471-3860-0
eBook Packages: Springer Book Archive