Results 1  10
of
25
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
, 2006
"... ..."
AN OVERVIEW OF THE APPLICATIONS OF MULTISETS
, 2007
"... This paper presents a systemization of representation of multisets and basic operations under multisets, and an overview of the applications of multisets in mathematics, computer science and related areas. ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
This paper presents a systemization of representation of multisets and basic operations under multisets, and an overview of the applications of multisets in mathematics, computer science and related areas.
A uniform approach to constraintsolving for lists, multisets, compact lists, and sets
 ACM TRANS. COMPUT. LOG
, 2008
"... Lists, multisets, and sets are wellknown data structures whose usefulness is widely recognized in various areas of Computer Science. They have been analyzed from an axiomatic point of view with a parametric approach in [Dovier et al. 1998] where the relevant unification algorithms have been develop ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Lists, multisets, and sets are wellknown data structures whose usefulness is widely recognized in various areas of Computer Science. They have been analyzed from an axiomatic point of view with a parametric approach in [Dovier et al. 1998] where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints, namely equality and membership constraints and their negative counterparts.
Comparing Expressiveness of Set Constructor Symbols
, 2000
"... In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantified formulae. In order to prove our results ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
(Show Context)
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantified formulae. In order to prove our results, canonical forms for settheoretic and multisettheoretic formulae are established and a particularly natural axiomatization of multisets is given and studied.
Set Unification
, 2001
"... The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas  e.g., deductive databases, theorem ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas  e.g., deductive databases, theorem proving, static analysis, rapid software prototyping. The problem has been explored in depth, but the various solutions proposed are spread across a large literature, and some of the approaches have been ignored and/or rediscovered by different researchers. In this
Constructive Negation and Constraint Logic Programming with Sets
 New Generation Computing
"... The aim of this paper is to extend the Constructive Negation technique to the case of CLP (SET ), a Constraint Logic Programming (CLP ) language based on hereditarily (and hybrid) finite sets. The challenging aspects of the problem originate from the fact that the structure on which CLP (SET ) is ba ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
The aim of this paper is to extend the Constructive Negation technique to the case of CLP (SET ), a Constraint Logic Programming (CLP ) language based on hereditarily (and hybrid) finite sets. The challenging aspects of the problem originate from the fact that the structure on which CLP (SET ) is based is not admissible closed, and this does not allow to reuse the results presented in the literature concerning the relationships between CLP and constructive negation. We propose a new constraint satisfaction algorithm, capable of correctly handling constructive negation for large classes of CLP (SET ) programs; we also provide a syntactic characterization of such classes of programs. The resulting algorithm provides a novel constraint simplification procedure to handle constructive negation, suitable to theories where unification admits multiple most general unifiers. We also show, using a general result, that it is impossible to construct an interpreter...
Aggregation of composite solutions: strategies, models, examples. Electronic preprint
"... ar ..."
(Show Context)
Deciding implication for functional dependencies in complexvalue databases', Theor
 Comput. Sci
"... databases ..."
(Show Context)
Towards Correctness of Program Transformations Through Unification and Critical Pair Computation
, 2010
"... Abstract. Correctness of program transformations in extended lambdacalculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach is the combination of a context lemma with the computation of overlaps between pro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Correctness of program transformations in extended lambdacalculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, which results in socalled complete sets of diagrams. The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order way by variants of critical pair computation that use unification algorithms. As a case study of an application we describe a finitary and decidable unification algorithm for the combination of the equational theory of leftcommutativity modelling multisets, context variables and manysorted unification. Sets of equations are restricted to be almost linear, i.e. every variable and context variable occurs at most once, where we allow one exception: variables of a sort without ground terms may occur several times. Every context variable must have an argumentsort in the free part of the signature. We also extend the unification algorithm by the treatment of bindingchains in let and letrecenvironments and by contextclasses. This results in a unification algorithm that can be applied to all overlaps of normalorder reductions and transformations in an extended lambda calculus with letrec that we use as a case study. 1