(Enter summary)
Abstract: In this paper we show how to extend a set unification algorithm -- i.e., an extended unification algorithm incorporating the axioms of a simple theory of sets -- to hyperset unification, that is to sets in which, roughly speaking, membership can form cycles. This is obtained by enlarging the domain from that of terms (hence, trees) to that of graphs involving free as well as interpreted function symbols (namely, the set element insertion and the empty set), which can be regarded as a convenient ... (Update)
Context of citations to this paper: More
...[ Y ) Z = X [ Y [ Z) C) X [ Y = Y [ X (I) X [ X = X (1) X = X Fig. 1. Equational axioms for ; f Delta j Delta g, and [ in [9, 1, 7] are ensured to remain in the class NP. In [8, 9, 11] positive and negative constraints of this theory has been studied and solved. In...
Cited by: More
Comparing Expressiveness of Set Constructor Symbols - Dovier, Piazza, Policriti (2000)
(Correct)
Similar documents (at the sentence level):
33.6%: From Set to Hyperset Unification - Aliffi, al. (1999)
(Correct)
Active bibliography (related documents): More All
1.1: Set Unification Revisited - Dovier, Pontelli
(Correct)
0.8: Set Unification - Dovier, Pontelli, Rossi (2001)
(Correct)
0.5: Constructive Negation and Constraint Logic Programming with.. - Dovier, Pontelli, al.
(Correct)
Similar documents based on text: More All
0.4: Set-Based Constraints - Dovier, Piazza, Rossi
(Correct)
0.4: Embedding extensional finite sets in CLP - Dovier, Rossi (1993)
(Correct)
0.3: Agostino Dovier - Carla Piazza And
(Correct)
BibTeX entry: (Update)
D. Aliffi, A. Dovier, and G. Rossi. From set to hyperset unification. Journal of Functional and Logic Programming, 1999(10):1--48, September 1999. http://citeseer.ist.psu.edu/article/aliffi99from.html More
@article{ aliffi99from,
author = "Davide Aliffi and Agostino Dovier and Gianfranco Rossi",
title = "From Set to Hyperset Unification",
journal = "Journal of Functional and Logic Programming",
volume = "1999",
number = "10",
year = "1999",
url = "citeseer.ist.psu.edu/article/aliffi99from.html" }
Citations (may not include all citations):
170
ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
118
Complete Axiomatizations of the Algebras of Finite (context) - Maher - 1988
97
A Formalization of Set Theory without Variables (context) - Tarski, Givant - 1986
77
Co-induction in relational semantics (context) - Milner, Tofte - 1991 ACM DBLP
52
Logic Programming with Sets
- Kuper - 1990 ACM DBLP
41
Center for the Study of Language and Information (context) - Aczel, volume et al. - 1988
40
flogg: A Language for Programming in Logic with Finite Sets
- Dovier, Omodeo et al. - 1996
39
Set Constructors in a Logic Database Language (context) - Beeri, Naqvi et al. - 1991 ACM DBLP
38
Unication theory
- Siekmann - 1990
37
The Liar: An Essay on Truth and Circularity (context) - Barwise, Etchemendy - 1987
27
Set theory with free construction principles (context) - Forti, Honsell
27
the Combination of Symbolic Constraints (context) - Baader, Schulz - 1995
26
Unication in the Union of Disjoint Equational Theories: Comb.. (context) - Baader, Schulz - 1996
20
Membership-Constraint and Complexity in Logic Programming wi..
- Stolzenburg - 1996
19
Computer Science Department (context) - Hill, Lloyd et al. - 1991
18
Unication revisited (context) - Lassez, Maher et al. - 1986
16
Programming with Equations (context) - Jayaraman, Plaisted - 1989 ACM DBLP
13
The Mathematical Intelligencer (context) - Barwise, Moss - 1991
11
Computable Set Theory and Logic Programming (context) - Dovier - 1996
10
and sets in a logic programming framework (context) - Dovier, Policriti et al. - 1996
8
Bounded hyperset theory and web-like data bases
- Lisitsa, Yu - 1997 ACM DBLP
7
Theoretical Computer Science (context) - Baader, uttner et al. - 1988 ACM
7
the Mathematics of nonwell -founded phenomena (context) - Barwise, Moss et al. - 1986
6
A minimality study for set unication (context) - Arenas-S, Dovier - 1997
5
Unication in the Data Structure Sets (context) - uttner - 1986
4
International Series of Monographs on Computer Science (context) - Cantone, Ferro et al. - 1989
4
Solving Systems of Equations over Hypersets (context) - Dovier, Omodeo et al. - 1994
3
Unication of Sets and Multisets (context) - Livesey, Siekmann - 1976
3
Complete sets of uniers and matchers in equational theories (context) - Fages, Huet - 1986
2
Notes for a Tutorial on NonWellfounded Sets (context) - Barwise, Moss - 1993
2
Sets and the Axiom of Foundation (context) - Barwise - 1986
1
Dipartimento di Matematica ed Informatica (context) - Dovier, Omodeo et al. - 1994
1
Ecient Unication with Innite Terms in Logic Programming (context) - Martelli, Rossi - 1984
1
Stepwise Development of an Algorithm for Unication over Inni.. (context) - Martelli, Rossi - 1990
1
Prolog and Innite Trees (context) - Colmeraurer - 1982
1
Ecient Unication over Innite Terms (context) - Ja - 1984
Documents on the same site (http://www.math.unipr.it/~gianfr/papers.html): More
A WAM Implementation for the Logic Meta-Programming Language.. - Cervesato, Rossi (1993)
(Correct)
A Uniform Axiomatic View of Lists, Multisets, and Sets, and the .. - Dovier, al. (1998)
(Correct)
Logic Meta-Programming Facilities in 'LOG - Cervesato, Rossi (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC