according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
In this paper we present a mechanism for translating constraint queries, i.e., Boolean expressions of constraints, across heterogeneous information sources. Integrating such syste...
The use of semantic knowledge in its various forms has become an important aspect in managing data in database and information systems. In the form of integrity constraints, it ha...
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...