Comparing expressiveness of set constructor symbols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1794, Issue , 2000, Pages 275-289

  Dovier, Agostino ^a   Piazza, Carla ^b   Policriti, Alberto ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Constraints; References; Sets and Multisets Theory; Unication

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AXIOMATIZATION; CANONICAL FORM; COMMON OPERATOR; CONSTRAINTS; EXPRESSIVE POWER; MULTI-SETS; REFERENCES; UNICATION;

ARTIFICIAL INTELLIGENCE;

EID: 84949189314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720084_18     Document Type: Conference Paper

References (22)

1. D. Aliffi, A. Dovier, and G. Rossi. From set to hyperset unification. Journal of Functional and Logic Programming, 1999(10):1-48, September 1999.
2. P. Arenas-Sánchez and A. Dovier. A minimality study for set unification. Journal of Functional and Logic Programming, 1997(7):1-49, December 1997.
3. F. Baader and W. Büttner. Unification in commutative and idempotent monoids. Theoretical Computer Science, 56:345-352, 1988.
4. F. Baader and K. U. Schulz. Unification theory. In Wolfgang Bibel and Peter H. Schmidt, editors, Automated Deduction: A Basis for Applications. Volume I, Fo- undations: Calculi and Methods. Kluwer Academic Publishers, Dordrecht, 1998.
5. P. Bernays. A system of axiomatic set theory. Part I. The Journal of symbolic logic, 2:65-77, 1937.
6. D. Cantone, A. Ferro, and E. G. Omodeo. Computable Set Theory, Vol. 1. Int'l Series of Monographs on Computer Science. Clarendon Press, Oxford, 1989.
7. E. Dantsin and A. Voronkov. A nondeterministic polynomial-time unification algorithm for bags, sets and trees. In W. Thomas, editor, FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science, pages 180-196. Springer-Verlag, Berlin, 1999.
8. A. Dovier. A Language with Finite Sets Embedded in the CLP Scheme. In R. Dyckhoff, editor, Int'l Workshop on Extension of Logic Programming, volume 798 of Lecture Notes in Artificial Intelligence, pages 77-93. Springer-Verlag, Berlin, 1994.
9. A. Dovier. Computable Set Theory and Logic Programming. PhD thesis, Universitádegli Studi di Pisa, March 1996. TD-1/96.
10. A. Dovier, E. G. Omodeo, E. Pontelli, and G. Rossi. {logg}: A Language for Programming in Logic with Finite Sets. J. of Logic Programming, 28(1):1-44, 1996.
11. A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. On the Representation and Management of Finite Sets in CLP-languages. In J. Jaffar, editor, Proc. of 1998 Joint Int'l Conf. and Symp. on Logic Programming, pages 40-54. The MIT Press, Cambridge, Mass., 1998.
12. A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. ACI1 constraints. In D. De Schreye, editor, ICLP'99, 16th International Conference on Logic Programming, pages 573-587. The MIT Press, Cambridge, Mass., 1999.
13. A. Dovier, A. Policriti, and G. Rossi. A uniform axiomatic view of lists, multisets and the relevant unification algorithms. Fundamenta Informaticae, 36(2/3):201-234, 1998.
14. S. Grumbach and T. Milo. Towards tractable algebras for bags. Journal of Computer and System Sciences, 52(3):570-588, 1996.
15. J. Jaffar, M. Maher, K. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 1-3(37):1-46, 1998.
16. K. Kunen. Set Theory. An Introduction to Independence Proofs. Studies in Logic. North Holland, Amsterdam, 1980.
17. E. G. Omodeo and A. Policriti. Solvable set/hyperset contexts: I. some decision procedures for the pure, finite case. Communication on Pure and Applied Mathematics, 9-10:1123-1155, 1995.
18. F. Parlamento and A. Policriti. The logically simplest form of the infinity axiom. American Mathematical Society, 103:274-276, 1988.
19. O. Shmueli, S. Tsur, and C. Zaniolo. Compilation of set terms in the logic data language (LDL). Journal of Logic Programming, 12(1-2):89-119, 1992.
20. J. R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, 1967.
21. F. Stolzenburg. An algorithm for general set unification and its complexity. Journal of Automated Reasoning, 22, 1999.
22. R. L. Vaught. On a Theorem of Cobham Concerning Undecidable Theories. In E. Nagel, P. Suppes, and A. Tarski, editors, Proceedings of the 1960 International Congress, pages 14-25. Stanford University Press, Stanford, 1962.