Classification and syntax of constraints in binary semantical networks

摘要

We use binary semantical networks to design or to build information systems. A good system should have a good conceptual scheme with well-defined constraints. This article classifies the constraints and defines their syntax so that there is a clear and easy way to express constraints. The constraints language is a generalization of graphical constraints. This article is based on a former article of the author (Proceedings of the New Generation Computers Conference) and a Control Data DMRL Report by R. Meersman (1982). Examples come mostly from the hospital case of De Brock and Remmen.