Matching of bounded set terms in the logic language script L signDscript L sign++

Journal of Logic Programming

Volumn 27, Issue 1, 1996, Pages 73-87

  Arni, Natraj ^b   Greco, Sergio ^a   Saccà, Domenico ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DATABASE SYSTEMS; OPTIMIZATION; SET THEORY;

BOUNDED SET TERMS; COMPLEXITY ANALYSIS; LOGIC LANGUAGE; MATCHING ALGORITHM;

LOGIC PROGRAMMING;

EID: 0030125785     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00146-8     Document Type: Article

References (28)

1. Arni, N., Greco, S., and Saccà, D., Set-Term Matching in Logic Programming, in: Proceedings of the 4th International Conference on Database Theory, 1992, pp. 436-449.
2. Abiteboul, S. and Grumbach, S., COL: A Logic-Based Language for Complex Objects, in: Proceedings of the International Conference on Extending Database Technology, 1988, pp. 271-293.
3. Beeri, C., Naqvi, S., Shmueli, O., and Tsur, S., Set Constructors in a Logic Database Language, J. Logic Programming 10(3&4):181-232 (1991).
4. Buttner, W., Unification in the Data Structure Sets, in: Proceedings of the 8th International Conference on Automated Deduction, 1986, pp. 470-488.
5. Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G.F., { log }: A Logic Programming Language with Finite Sets, Proceedings of the 8th International Conference on Logic Programming, 1991, pp. 121-124.
6. Fages, F., Associative-Commutative Unification, in: Proceedings of the 8th International Conference on Automated Deduction, 1986, pp. 416-430.
7. Immerman, N., Patnaik, S., and Stemple, D., The Expressiveness of a Family of Finite Set Languages, in: Proceedings of the Tenth ACM Symposium on Principles of Database Systems, 1991, pp. 37-52.
8. Jayaraman, B. and Plaisted, D. A., Functional Programming with Sets, in: Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Springer-Verlag, New York, 1987, pp. 194-210.
9. Jayaraman, B., Implementation of Subset-Equational Programs, J. Logic Programming 12:299-324 (1992).
10. Kapur, D. and Narendran, P., NP-Completeness of the Set Unification and Matching Problems, in: Proceedings of the 8th International Conference on Automated Deduction, 1986, pp. 489-495.
11. Kapur, D. and Narendran, P., Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers, in: Proceedings of the 8th International Conference on Logic in Computer Science, 1992, pp. 11-21.
12. Kifer, M. and Lausen, G., F-Logic: A Higher-Order Language for Reasoning About Objects, Inheritance and Scheme, in: Proceedings of the ACM SIGMOD Conference, 1989, pp. 134-146.
13. Knight, K., Unification: A Multidisciplinary Survey, ACM Comput. Surveys 21(1):93-124 (1989).
14. Kuper, G. M., Logic Programming with Sets, J. Computer System Sci. 41:44-64 (1990).
15. The script L signDscript L sign + + users manual, MCC Technical Report, 1992.
16. Ledermann, W. and Vajda, S. (eds.), Handbook of Applicable Mathematics, Wiley, New York, 1985, Vol. 5, Part B.
17. Lincoln, C. and Christian, J., Adventures in Associative-Commutative Unification, in Proceedings of the 9th International Conference on Automated Deduction, 1988, pp. 358-367.
18. Livesey, M. and Siekmann, J. H., Unification of A+C-Terms (Bags) and A+C+I-Terms (Sets), Technical Report 5/67, Facultat fur Informatik, University of Karlsruhe, 1976.
19. Lloyd, J., Foundation of Logic Programming, Springer-Verlag, New York, 1987.
20. Naqvi, S. and Tsur, S., A Logical Language for Data and Knowledge Bases, Computer Science Press, Rockville, MD, 1989.
21. Ramakrisnhan, R., Srivastava, D., and Sudanshan, S., CORAL - Control, Relations and Logic, in: Proceedings of 18th Conference on Very Large Data Bases, 1992, pp. 238-250.
22. Shmueli, O., Tsur, S., and Zaniolo, C., Compilation of Set Terms in the Logic Data Language (LDL), J. Logic Programming 12(1&2):89-119 (1992).
23. Siekmann, J., Unification Theory, J. Symbolic Computation 7(1):207-274 (1989).
24. Stickel M. E., A Unification Algorithm for Associative-Commutative Functions, J. ACM 28(3):423-434 (1981).
25. Stolzenburg, F., An Algorithm for General Set Unification and its Complexity, Workshop on Logic Programming with Sets, 1993.
26. Ullman, J. K., Principles of Database and Knowledge-Base Systems, Computer Science Press, Rockville, MD, 1988.
27. Vadaparty, K., On the Power of Rule-Based Languages with Sets, in: Proceedings of the 10th ACM Symposium on Principles of Database Systems, 1991, pp. 26-36.
28. Verma, R. M. and Ramakrishnan, I. V., Tight Complexity Bound for Term Matching Problems, Information and Computation 101:33-69 (1992).