Set unification

Theory and Practice of Logic Programming

Volumn 6, Issue 6, 2006, Pages 645-701

  Dovier, Agostino ^a   Pontelli, Enrico ^b   Rossi, Gianfranco ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b New Mexico State University   (United States)

^c UNIVERSITY OF PARMA   (Italy)

Author keywords

ACI 1 unification; Set theory; Unification theory

Indexed keywords

ALGEBRA; ALGORITHMS; DATABASE SYSTEMS; PROBLEM SOLVING; SOFTWARE PROTOTYPING; THEOREM PROVING;

ACI 1 UNIFICATION; UNIFICATION ALGORITHMS; UNIFICATION THEORY;

SET THEORY;

EID: 33750064994     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002730     Document Type: Article

References (72)

1. ABITEBOUL, S. AND GRUMBACH., S. 1991. A Rule-Based Language with Functions and Sets. ACM Trans. on Database Systems 16, 1, 1-30.
2. ACZEL, P. 1988. Non-well-founded sets. CSLI Lecture Notes, vol. 14. Stanford University Press.
3. AIKEN, A. 1994. Set constraints: Results, Applications, and Future Directions. In Principles and Practice of Constraint Programming, A. Borning, Ed. Lecture Notes in Computer Science. Springer Verlag, 326-335.
4. ALIFFI, D., DOVIER, A., AND ROSSI, G. 1999. From Set to Hyperset Unification. Journal of Functional and Logic Programming 1999, 10, 1-48.
5. ARENAS-SÁNCHEZ, P. AND DOVIER, A. 1997. A Minimality Study for Set Unification. Journal of Functional and Logic Programming 1997, 7, 1-49.
6. ARENAS-SÁNCHEZ, P. AND RODRÍGUEZ-ARTALEJO, M. 2001. A General Framework for Lazy Functional Logic, Programming with Algebraic Polymorphic Types. Theory and Practice of Logic Programming 2, 1, 185-245.
7. ARNI, N., GRECO, S., AND SACCÀ, D. 1992. Set-term matching in logic programming. In Database Theory - ICDT'92, 4th International Conference, Berlin, Germany, October 14-16, 1992, Proceedings, J. Biskup and R. Hull, Eds. Lecture Notes in Computer Science, vol. 646. Springer, 436-449.
8. ARNI, N., GRECO, S., AND SACCÀ, D. 1996. Matching of Bounded Set Terms in the Logic Language LDL++. Journal of Logic Programming 27, 1, 73-87.
9. BAADER, F. 1998. On the Complexity of Boolean Unification. Information Processing Letters 67, 4, 215-220.
10. BAADER, F. AND BÜTTNER, W. 1988. Unification in commutative and idempotent monoids. Theoretical Computer Science 56, 345-352.
11. BAADER, F. AND SCHULZ, K. U. 1996. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation 21, 211-243.
12. BAADER, F. AND SNYDER, W. 2001. Unification Theory. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, Chapter 8, 446-533.
13. BARWISE, J. AND MOSS, L. 1996. Vicious Circles. On the Mathematics of non-well-founded phenomena. CSLI Lecture Notes, vol. 60. Stanford University Press.
14. BEERI, C., NAQVI, S., SHMUELI, O., AND TSUR., S. 1991. Set Constructors in a Logic Database Language. Journal of Logic Programming 10, 3, 181-232.
15. BÜTTNER, W. 1986. Unification in the Data Structure Sets. In Proc. of the Eight International Conference on Automated Deduction, J. K. Siekmann, Ed. Vol. 230. Springer-Verlag, Berlin, 470-488.
16. BÜTTNER, W. AND SIMONIS, H. 1987. Embedding Boolean Expressions into Logic Programming. Journal of Symbolic Computation 4, 191-205.
17. CANTONE, D., OMODEO, E. G., AND POLICRITI, A. 2001. Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer-Verlag, Berlin.
18. CODISH, M. AND LAGOON, V. 2000. Type Dependencies for Logic Programs using ACI-Unification. Theoretical Computer Science 238, 1-2, 131-159.
19. DANTSIN, E. AND VORONKOV, A. 1999. A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets, and Trees. In Proc. of Foundations of Software Science and Computation Structure. Second International Conference, FoSSaCS'99, W. Thomas, Ed. Lecture Notes in Computer Science, vol. 1578. Springer-Verlag, Berlin, 180-196.
20. DOVIER, A., FORMISANO, A., AND OMODEO, E. Decidability results for sets with atoms. ACM Transaction on Computational Logic 7(2): 269-301, 2006.
21. DOVIER, A., OMODEO, E. G., PONTELLI, E., AND ROSSI, G. 1996. {log}: A Language for Programming in Logic with Finite Sets. Journal of Logic Programming 28, 1, 1-44.
22. DOVIER, A., PIAZZA, C., AND POLICRITI, A. 2000. Comparing Expressiveness of Set Constructor Symbols. In Frontier of Combining Systems, H. Kirchner and C. Ringeissen, Eds. Lecture Notes in Computer Science, vol. 1794. Springer-Verlag, Berlin, 275-289.
23. DOVIER, A., PIAZZA, C., AND POLICRITI, A. 2004. An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science 311, 1-3, 221-256.
24. DOVIER, A., PIAZZA, C., PONTELLI, E., AND ROSSI, G. 2000. Sets and Constraint Logic Programming. ACM Transactions on Programming Languages and Systems 22, 5, 861-931.
25. DOVIER, A., POLICRITI, A., AND ROSSI, G. 1998. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundamenta Informaticae 36, 2/3, 201-234.
26. DOVIER, A. AND ROSSI, G. 1993. Embedding Extensional Finite Sets in CLP. In Proc. of Int'l Logic Programming Symposium, ILPS'93, D. Miller, Ed. The MIT Press, Cambridge, Mass., 540-556. Vancouver, BC, Canada.
27. FAGES, F. 1987. Associative-Commutative Unification. Journal of Symbolic Computation 3, 257-275.
28. GRAHAM, R. L., KNUTH, D. E., AND PATASHNIK, O. 1994. Concrete Mathematics. Addison-Wesley.
29. GRECO, S. 1996. Optimal Unification of Bound Simple Set Terms. In Proc. of Conference on Information and Knowledge Management. ACM Press, 326-336.
30. GRIESKAMP, W. 1999. A set-based calculus and its implementation. Ph.D. thesis, Technical University of Berlin.
31. HERMANN, M. AND KOLAITIS, P. 1997. On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. In Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29 - November 1, 1997, Proceedings, G. Smolka, Ed. Lecture Notes in Computer Science, vol. 1330. Springer-Verlag, Berlin, 282-296.
32. HEROLD, A. 1986. Combination of Unification Algorithms. In Proc. of 8th International Conference on Automated Deduction, J. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer-Verlag, Berlin, 450-469.
33. HILL, P. M. AND LLOYD, J. W. 1994. The Gödel Programming Language. The MIT Press, Cambridge, Mass.
34. JAYARAMAN, B. 1992. Implementation of Subset-Equational Programs. Journal of Logic Programming 12, 4, 299-324.
35. JAYARAMAN, B. AND PLAISTED, D. A. 1989. Programming with Equations, Subsets and Relations. In Proceedings of NACLP89, E. Lusk and R. Overbeek, Eds. The MIT Press, Cambridge, Mass., 1051-1068. Cleveland.
36. JOUANNAUD, J. P. AND KIRCHNER, C. 1991. Solving equations in abstract algebras: A rule-based survey of unification. In Computational Logic: Essays in Honor of Alan Robinson, J. L. Lassez and G. Plotkin, Eds. MIT Press.
37. KAPUR, D. AND NARENDRAN, P. 1986. NP-completeness of the set unification and matching problems. In 8th International Conference on Automated Deduction, J. H. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer-Verlag, Berlin, 489-495.
38. KAPUR, D. AND NARENDRAN, P. 1992. Complexity of Unification Problems with Associative-Commutative Operators. Journal of Automated Reasoning 9, 261-288.
39. KIFER, M. AND LAUSEN, G. 1989. F-logic: a higher-order language for reasoning about objects, inheritance, and scheme. In International Conference on Management of Data and Symposium on Principles of Database Systems. ACM Press, 134-146.
40. KIRCHNER, C. 1989. From Unification in Combination of Equational Theories to a New AC-Unification Algorithm. Resolution of Equations in Algebraic Structures, vol. 2. Academic Press.
41. KOZEN, D. 1998. Set Constraints and Logic Programming. Information and Computation 142, 1, 2-25.
42. KUNEN, K. 1980. Set Theory. An Introduction to Independence Proofs. Studies in Logic. North Holland, Amsterdam.
43. KUPER, G. M. 1990. Logic Programming with Sets. Journal of Computer and System Science 41, 1, 66-75.
44. LEGEARD, B. AND LEGROS, E. 1991. Short Overview of the CLPS System. In Symposium on Progr. Languages Implementation and Logic Programming. Springer Verlag, 431-433.
45. LIM, S.-J. AND No, Y.-K. 1997. Design and Analysis of Parallel Set-Term Unification. In Proc. of Computing and Combinatorics, Third Annual International Conference, T. Jiang and D. T. Lee, Eds. Lecture Notes in Computer Science, vol. 1276. Springer-Verlag, Berlin, 321-330.
46. LINCOLN, P. AND CHRISTIAN, J. 1989. Adventures in Associative-Commutative Unification. Journal of Symbolic Computation 8, 1/2, 217-240.
47. LIU, M. 1998. Relationlog: a Typed Extension to Datalog with Sets and Tuples. Journal of Logic Programming 36, 3, 271-299.
48. LIVESEY, M. AND SIEKMANN, J. 1976. Unification of Sets and Multisets. Technical report, Institut fur Informatik I, Universitat Karlsruhe.
49. MANANDHAR, S. 1994. An Attributive Logic of Set Descriptions and Set Operations. In 32nd Annual Meeting of the Association of Computational Linguistics. ACL, 255-262.
50. MARCINIEC, J. 1997. Infinite Set Unification with Application to Categorial Grammar. Studia Logica 58, 339-355.
51. MARTELLI, A. AND MONTANARI, U. 1982. An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems 4, 258-282.
52. MARTIN, U. AND NIPKOW, T. 1988. Unification in Boolean Rings. Journal of Automated Reasoning 4, 4, 381-396.
53. MARTIN, U. AND NIPKOW, T. 1989. Boolean Unification - The Story So Far. Journal of Symbolic Computation 7, 3/4, 275-293.
54. NAQVI, S. AND TSUR, S. 1989. A Logical Language for Data and Knowledge Bases. Computer Science Press.
55. OMODEO, E. G. AND POLICRITI, A. 1995. Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case. Communications on Pure and Applied Mathematics 48, 9-10, 1123-1155. Special Issue in honor of J.T. Schwartz.
56. PATERSON, M. S. AND WEGMAN, M. N. 1978. Linear Unification. Journal of Computer and System Sciences 16, 158-167.
57. POLICRITI, A. AND SCHWARTZ, J. T. 1997. T-Theorem Proving I. Journal of Symbolic Computation 20, 3, 315-342.
58. POLLARD, C. J. AND MOSHIER, M. D. 1990. Unifying partial description of sets. In Information, Language and Cognition, P. Hanson, Ed. University of British Columbia Press, Vancouver, BC, 285-322.
59. ROUNDS, W. C. 1988. Set values for unification based grammar formalisms and logic programming. Research Report CSLI-88-129, Center for the Study of Language Language and Information, Stanford, CA.
60. SCHMIDT-SCHAUSS, M. 1989. Unification in a Combination of Arbitrary Disjoint Equational Theories. Journal of Symbolic Computation 8, 1/2, 51-99.
61. SCHWARTZ, J., DEWAR, R., DUBINSKY, E., AND SCHONBERG, E. 1986. Programming with Sets: an Introduction to SETL. Springer-Verlag, Berlin.
62. SHMUELI, O., TSUR, S., AND ZANIOLO, C. 1992. Compilation of Set Terms in the Logic Data Language (LDL). Journal of Logic Programming 12, 1/2, 89-119.
63. SIEKMANN, J. K. 1984. Universal Unification. In Proc. of 7th International Conference on Automated Deduction, R. E. Shostak, Ed. Lecture Notes in Computer Science, vol. 170. Springer-Verlag, Berlin, 1-42.
64. SIEKMANN, J. K. 1989. Unification Theory. Journal of Symbolic Computation 7, 3/4, 207-274.
65. SPIVEY, J. 1992. The Z Notation: a Reference Manual. Prentice Hall.
66. STOLZENBURG, F. 1996. Membership-Constraint and Complexity in Logic Programming with Sets. In First Int'l Workshop on Frontier of Combining Systems, F. Baader and K. Schulz, Eds. Kluwer Academic Publishers, 285-302.
67. STOLZENBURG, F. 1999. An Algorithm for General Set Unification and Its Complexity. Journal of Automated Reasoning 22, 1, 45-63.
68. TARSKI, A. 1924. Sur les ensembles fini. Fundamenta Mathematicae VI, 45-95.
69. TIDEN, E. 1986. Unification in Combinations of Collapse-free Theories with Disjoint Sets of Function Symbols. In Proceedings of the International Conference on Automated Deduction, J. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer-Verlag, Berlin, 431-449.
70. WANG, L., WIJESEKERA, D., AND JAJODIA, S. 2004. A logic-based framework for attribute based access control. In Formal Methods in Security Engineering: From Specification to Code. ACM, 45-55.
71. YAKHNO, T. AND PETROV, E. 2000. Extensional Set Library for ECLiPSe. In Perspectives of System Informatics, Third International Andrei Ershov Memorial Conference, PSI'99, D. Bjørner, M. Broy, and A. V. Zamulin, Eds. Lecture Notes in Computer Science, vol. 1755. Springer, 434-444.
72. YELLICK, K. 1985. Combining Unification Algorithms for Confined Equational Theories. In Proceedings of the Conference on Rewriting Techniques and Applications, J.-P. Jouannaud, Ed. Lecture Notes in Computer Science, vol. 202. Springer-Verlag, Berlin.