Finite axiomatization of languages for representation of system properties: Axiomatization of dependencies

The existence of full, consistent, and finite systems of inference rules for several languages is discussed. These languages are used for the description of system classes, the system being given by a multiplace relation. The same languages—types of dependencies—are used in relational database theor...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 1989, Vol.47 (3), p.339-372
Main Author: Petrov, Sergey V.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
System theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The existence of full, consistent, and finite systems of inference rules for several languages is discussed. These languages are used for the description of system classes, the system being given by a multiplace relation. The same languages—types of dependencies—are used in relational database theory for describing integrity constraints. The absence of finite axiomatization for different types of dependencies, including join dependencies, is proved.
ISSN:0020-0255
1872-6291
DOI:10.1016/0020-0255(89)90006-6