Set Constraints and Logic Programming

Information and Computation

Volumn 142, Issue 1, 1998, Pages 2-25

  Kozen, Dexter ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004476353     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2694     Document Type: Article

References (29)

1. Aiken, A. (1994), Personal communication.
2. Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. (1993), The complexity of set constraints, in "Proc. 1993 Conf. Computer Science Logic (CSL'93)" (E. Börger, Y. Gurevich, and K. Meinke, Eds.), Lecture Notes in Computer Science, Vol. 832, pp. 1-17. Eur. Assoc. Comput. Sci. Logic, Springer-Verlag, Berlin/New York.
3. Aiken, A., Kozen, D., and Wimmers, E. (1995), Decidability of systems of set constraints with negative constraints, Inform. and Comput. 122(1), 30-44.
4. Aiken, A., and Murphy, B. (1991), Implementing regular tree expressions, in "Proc. 1991 Conf. Functional Programming Languages and Computer Architecture," pp. 427-447.
5. Aiken, A., and Murphy, B. (1991), Static type inference in a dynamically typed language, in "Proc. 18th Symp. Principles of Programming Languages," pp. 279-290, ACM.
6. Aiken, A., and Wimmers, E. (1992), Solving systems of set constraints, in "Proc. 7th Symp. Logic in Computer Science," pp. 329-340, IEEE.
7. Bachmair, L., Ganzinger, H., and Waldmann, U. (1993), Set constraints are the monadic class, in "Proc. 8th Symp. Logic in Computer Science," pp. 75-83, IEEE.
8. 2 |V|), Theoret. Comput. Sci. 19, 85-98.
9. Charatonik, W., and Pacholski, L. (1994), Negative set constraints with equality, in "Proc. 9th Symp. Logic in Computer Science," pp. 128-136, IEEE.
10. Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G. (1992), Embedding finite sets in a logic programming language, in "Proc. 3rd Int. Workshop Extensions of Logic Programming (ELP'92)" (E. Lamma and P. Mello, Eds.), Lecture Notes Artificial Intelligence, Vol. 660, pp. 150-167, Springer-Verlag, Berlin/New York.
11. Englefriet, J. (1975), "Tree Automata and Tree Grammars," Technical Report DAIMI FN-10, Aarhus University.
12. Frühwirth, T., Shapiro, E., Vardi, M. Y., and Yardeni, E. (1991), Logic programs as types for logic programs, in "Proc. 6th Sym. Logic in Computer Science," pp. 300-309, IEEE.
13. Gilleron, R., Tison, S., and Tommasi, M. (1993), Solving systems of set constraints using tree automata, in "Proc. Symp. Theor. Aspects of Comput. Sci.," Lecture Notes in Computer Science, Vol. 665, pp. 505-514, Springer-Verlag, Berlin/New York.
14. Gilleron, R., Tison, S., and Tommasi, M. (1993), Solving systems of set constraints with negated subset relationships, in "Proc. 34th Symp. Foundations of Comput. Sci.," pp. 372-380, IEEE.
15. Heintze, N. (1992), "Set Based Program Analysis," Ph.D. thesis, Carnegie Mellon University.
16. Heintze, N., and Jaffar, J. (1990), A finite presentation theorem for approximating logic programs, in "Proc. 17th Symp. Principles of Programming Languages," pp. 197-209, ACM.
17. Jaffar, J., and Lassez, J.-L. (1987), Constraint logic programming, in "Proc. Symp. Principles of Programming Languages (POPL) 1987," pp. 111-119, ACM.
18. Jayaraman, B., and Plaisted, D. A. (1989), Programming with equations, subsets, and relations, in "Proc. North Amer. Conf. Logic Programming 1989" (E. L. Lusk and R. A. Overbeek, Eds.), Vol. 2, pp. 1051-1068, MIT Press.
19. Jones, N. D., and Muchnick, S. S. (1979), Flow analysis and optimization of LISP-like structures, in "Proc. 6th Symp. Principles of Programming Languages," pp. 244-256, ACM.
20. Kozen, D. (1993), Logical aspects of set constraints, in "Proc. 1993 Conf. Computer Science Logic (CSL'93)" (E. Börger, Y. Gurevich, and K. Meinke, Eds.), Lecture Notes in Computer Science, Vol. 832, pp. 175-188, Eur. Assoc. Comput. Sci. Logic, Springer-Verlag, Berlin/New York.
21. Kozen, D. (1994), Set constraints and logic programming, in "Proc. First Conf. Constraints in Computational Logics (CCL'94)" (J. P. Jouannaud, Ed.), Lecture Notes in Computer Science, Vol. 845, pp. 302-303, ESPRIT, Springer-Verlag, Berlin/New York. [Abstract]
22. Kuper, G. M. (1984), Logic programming with sets, in "Proc. Symp. Principles of Database Systems (PODS) 1987," pp. 11-20, ACM.
23. Mishra, P. (1984), Towards a theory of types in PROLOG, in "Proc. 1st Symp. Logic Programming," pp. 289-298, IEEE.
24. Mishra P., and Reddy, U. (1985), Declaration-free type checking, in "Proc. 12th Symp. Principles of Programming Languages," pp. 7-21, ACM.
25. Paige, R., and Tarjan, R. E. (1987), Three partition refinement algorithms, SIAM J. Comput. 16(6), 973-989.
26. Reynolds, J. C. (1969), Automatic computation of data set definitions, in "Information Processing 68," pp. 456-461, North-Holland.
27. Stefánsson, K. (1994), Systems of set constraints with negative constraints are NEXPTIME-complete, in "Proc. 9th Symp. Logic in Computer Science," pp. 137-141, IEEE.
28. Stolzenburg, F. (1993), An algorithm for general set unification and its complexity, in "Proc. Workshop Logic Programming with Sets, in conjunction with 10th Int. Conf. Logic Programmaing" (E. Omodeo and G. Rossi, Eds.), pp. 17-22.
29. Stolzenburg, F. (1994), Logic programming with sets by membership-constraints, in "Proceedings of the 10th Logic Programming Workshop" (N. E. Fuchs and G. Gottlob, Eds.), Universität Zürich. [Institut für Informatik, Technical Report ifi 94.10]