A Uniform Axiomatic View of Lists, Multisets, and Sets, and the Relevant Unification Algorithms

Fundamenta Informaticae

Volumn 36, Issue 2, 1998, Pages 201-234

  Dovier, Agostino ^a   Policriti, Alberto ^b   Rossi, Gianfranco ^c  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF PARMA   (Italy)

Author keywords

Axiomatic Set Theory; Unification

Indexed keywords

EID: 0002611746     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-36235     Document Type: Article

References (27)

1. Apt, K. R. Introduction of Logic Programming. In Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, J. van Leeuwen, Ed. Elsevier and The MIT Press, 1990.
2. Arenas-Sánchez, P., and Dovier, A. A minimality study for set unification. Journal of Functional and Logic Programming, 1997(7): 1-49.
3. Bellé, D., and Parlamento, F. Undecidability of Weak Membership Theories. In Proceedings of the International Conference on Logic and Algebra (in memory of R. Magari) (1994).
4. Bernays, P. A system of axiomatic set theory. Part I. The Journal of symbolic logic 2 (1937), 65-77.
5. Clark, K. L. Negation as Failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, 1978, pp. 293-321.
6. Dovier, A. Computable Set Theory and Logic Programming. PhD thesis, Université degli Studi di Pisa, March 1996. TD-1/96.
7. Dovier, A., Piazza, C., Pontelli, E., and Rossi, G. On the Representation and Management of Finite Sets in CLP-languages. In J. Jaffar, editor, Proceedings of 1998 Joint International Conference and Symposium on Logic Programming, pages 40-54. The MIT Press, Cambridge, Mass., June 1998.
8. Dovier, A., Omodeo, E. G., and Policriti, A. Solvable set/hyperset contexts: II. a goal-driven unification algorithm for the blended case. Applicable Algebra in Engineering, Communication and Computing, 1998. (To appear)
9. Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G. {log}: A Language for Programming in Logic with Finite Sets. Journal of Logic Programming 28, 1 (1996), 1-44.
10. Dovier, A., and Rossi, G. Embedding Extensional Finite Sets in CLP. In Proc. of Int'l Logic Programming Symposium, ILPS'93 (1993), D. Miller, Ed., The MIT Press, Cambridge, Mass., pp. 540-556.
11. Herbrand, J. Recherches sur la theorie de la demonstration. Master's thesis, Université de Paris, 1930. Also in Ecrits logiques de Jacques Herbrand, PUF, Paris, 1968.
12. Jaffar, J., and Maher, M. J. Constraint Logic Programming: A Survey. The Journal of Logic Programming 19-20 (1994), 503-581.
13. Kapur, D., and Narendran, P. NP-completeness of the set unification and matching problems. In 8th International Conference on Automated Deduction (1986), J. H. Siekmann, Ed., vol. 230 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 489-495.
14. Kunen, K. Set Theory. An Introduction to Independence Proofs. Studies in Logic. North Holland, Amsterdam, 1980.
15. Lassez, J. L., Maher, M. J., and Marriot, K. Unification Revisited. In Foundations of Deductive Databases and Logic Programming, J. Minker ed., Morgan Kaufmann Publishers, pp. 587-625, 1987.
16. Lloyd, J. W. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
17. Mal'cev, A. Axiomatizable Classes of Locally Free Algebras of Various Types. In The Metamathematics of Algebraic Systems, Collected Papers. North Holland, Amsterdam, 1971, ch. 23.
18. Martelli, A., and Montanari, U. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4 (1982), 258-282.
19. Montagna, F., and Mancini, A. A minimal predicative set theory. Notre Dame Journal of Formal Logic 35 (1994), 186-203.
20. Omodeo, E. G., Policriti, A., and Rossi., G. F. Che genere di insiemi/ multi-insiemi/ iperinsiemi incorporare nella programmazione logica? In Proc. Eighth Italian Conference on Logic Programming (1993), D. Saccà, Ed., pp. 55-70.
21. 0-Formulas in Set Theory. Communications of Pure and Applied Mathematics 41 (1988), 221-251.
22. Paterson, M. S., and Wegman, M. N. Linear unification. Journal of Computer System Science 16, 2 (1978), 158-167.
23. Schwartz, J. T., Dewar, R. B. K., Dubinsky, E., and Schonberg., E. Programming with sets, an introduction to SETL. Springer-Verlag, Berlin, 1986.
24. Siekmann, J. H. Unification theory. In Unification, C. Kirchner, Ed. Academic Press, 1990.
25. Stolzenburg, F. Membership-Constraint and Complexity in Logic Programming with Sets. In Proc. First Int'l Workshop on Frontier of Combining Systems (1996), F. Baader and K. U. Schulz, Eds., Kluwer Academic Publishers.
26. Tarski, A., and Givant, S. A Formalization of Set Theory without Variables, vol. 41 of Colloquium Publications. American Mathematical Society, 1986.
27. Vaught, R. L. On a Theorem of Cobham Concerning Undecidable Theories. In Proceedings of the 1960 International Concress (1962), E. Nagel, P. Suppes, and A. Tarski, Eds., Stanford University Press, Stanford, pp. 14-25.