In a previous paper, the valence concept, a general method to describe relationships, has been introduced along with a set-theoretic formal semantics. This approach is type-based, admits variants and detailed cardinality specifications, and can cope with incomplete intermediate states. Nevertheless, the resulting syntax is easy to understand. In this paper, an implementation of the valence concept is outlined. Special emphasis has been placed on minimizing space and time overhead on instant level, but it turns out that data dictionary overhead also keeps within reasonable limits. Please note that the valence concept is not a complete data model by itself, but a relationship model which can be embedded in a wide range of data models
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
We investigate cardinality constraints of the form M -theta K, where M is a set and theta is one of ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4164/5/bac0293.0001.001.pdfhttp://deepblue.lib.umich...
In a previous paper, the valence concept, a general method to describe relationships, has been intro...
This report describes the valence concept, a general method to specify relationships. This approach ...
Semantic data models for engineering applications often employ the Entity-Relationship approach in s...
Ternary relationships represent the association among three entities whose constraints database desi...
Modeling organizational rules during conceptual design provides a more accurate picture of the under...
ISA and cardinality constraints are among the most interesting types of constraints in data models. ...
AbstractThe concept description formalisms of existing description logics systems allow the user to ...
Adequate encodings for high-level constraints are a key ingredient for the application of SAT techno...
The problem of satisfiability of a specific class of integrity constraints in data bases, namely the...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
We address the problem of finding a "tight" representation of complex logical constraints ...
We introduce a new description logic that extends the well-known logic ALCQ by allowing the statemen...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
We investigate cardinality constraints of the form M -theta K, where M is a set and theta is one of ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4164/5/bac0293.0001.001.pdfhttp://deepblue.lib.umich...
In a previous paper, the valence concept, a general method to describe relationships, has been intro...
This report describes the valence concept, a general method to specify relationships. This approach ...
Semantic data models for engineering applications often employ the Entity-Relationship approach in s...
Ternary relationships represent the association among three entities whose constraints database desi...
Modeling organizational rules during conceptual design provides a more accurate picture of the under...
ISA and cardinality constraints are among the most interesting types of constraints in data models. ...
AbstractThe concept description formalisms of existing description logics systems allow the user to ...
Adequate encodings for high-level constraints are a key ingredient for the application of SAT techno...
The problem of satisfiability of a specific class of integrity constraints in data bases, namely the...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
We address the problem of finding a "tight" representation of complex logical constraints ...
We introduce a new description logic that extends the well-known logic ALCQ by allowing the statemen...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
We investigate cardinality constraints of the form M -theta K, where M is a set and theta is one of ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4164/5/bac0293.0001.001.pdfhttp://deepblue.lib.umich...