Negations of Transactions and Their Use in the Specification of Dynamic and Deontic Integrity Constraints

1990 ◽  
pp. 61-80 ◽  
Author(s):  
F. P. M. Dignum ◽  
J.-J. Ch. Meyer
Keyword(s):  
Integrity Constraints

Modelling spatial integrity constraints with OCL

2011 ◽  
Vol 21 (SI) ◽  
pp. 95-123 ◽  
Author(s):  
François Pinet ◽  
Magali Duboisset ◽  
Michel Schneider
Keyword(s):  
Integrity Constraints

CHR grammars

2005 ◽  
Vol 5 (4-5) ◽  
pp. 467-501 ◽  
Author(s):  
HENNING CHRISTIANSEN
Keyword(s):  
Logic Programming ◽  
Integrity Constraints ◽  
Bottom Up ◽  
Context Sensitive ◽  
Language Analysis ◽  
Definite Clause Grammars ◽  
Grammar Rules ◽  
High Flexibility ◽  
Definite Clause ◽  
Specification And Implementation

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

scholarly journals Validation of schema mappings with nested queries

2013 ◽  
Vol 10 (1) ◽  
pp. 79-104
Author(s):  
Guillem Rull ◽  
Carles Farré ◽  
Ernest Teniente ◽  
Toni Urpí
Keyword(s):  
Integrity Constraints ◽  
Automatic Process ◽  
Document Type ◽  
Relational Schemas ◽  
Schema Mappings ◽  
Nested Data ◽  
Nested Queries ◽  
The Given ◽  
Human Designer ◽  
The Web

With the emergence of the Web and the wide use of XML for representing data, the ability to map not only flat relational but also nested data has become crucial. The design of schema mappings is a semi-automatic process. A human designer is needed to guide the process, choose among mapping candidates, and successively refine the mapping. The designer needs a way to figure out whether the mapping is what was intended. Our approach to mapping validation allows the designer to check whether the mapping satisfies certain desirable properties. In this paper, we focus on the validation of mappings between nested relational schemas, in which the mapping assertions are either inclusions or equalities of nested queries. We focus on the nested relational setting since most XML?s Document Type Definitions (DTDs) can be represented in this model. We perform the validation by reasoning on the schemas and mapping definition. We take into account the integrity constraints defined on both the source and target schema. We consider constraints and mapping?s queries which may contain arithmetic comparisons and negations. This class of mapping scenarios is significantly more expressive than the ones addressed by previous work on nested relational mapping validation. We encode the given mapping scenario into a single flat database schema, so we can take advantage of our previous work on validating flat relational mappings, and reformulate each desirable property check as a query satisfiability problem.

Sign in / Sign up

Export Citation Format

Share Document