The independence property of a class of set constraints

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

Volumn 1118, Issue , 1996, Pages 76-90

  Charatonik, Witold ^a,b   Podelski, Andreas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957883482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_67     Document Type: Conference Paper

References (28)

1. [1]. A. Aiken, D. Kozen, M. Vardi, and E. L. Wimmers. The complexity of set constraints. In 1993 Conference on Computer Science Logic, LNCS 832, pp 17, Sept 1993.
2. [2]. A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of system s of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, June 1993.
3. [3]. A. Aiken, E. Wimmers, and T. Lakshman. Soft typing with conditional types. In Twenty-First Annual A CM Symposium on Principles of Programraing Languages, Portland, Oregon, Jan. 1994.
4. [4]. H. Ait-Kaci and A. Podelski. Entailment and disentailment of order-sorted feature constraints. In A. Voronkov, editor, Fourth International Conference on Logic Programming and Automated Reasoning, Springer LNAI 698, pp 18. Springer-Verlag, July 1993.
5. [5]. H. Ait-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263-283, 1994.
6. [6]. L. Bachmair, H. Ganzinger, and U. Waidmann. Set constraints are the monadic class. In Eighth Annual IEEE Symposium on Logic in Computer Science, pp 75-83, 1993.
7. [7]. W. Charatonik and L. Pacholski. Negative set constraints with equality. In Ninth Annual IEEE Symposium on Logic in Computer Science, pp 128-136, 1994.
8. [8]. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In 35 th Symposium on Foundations of Computer Science, pp 642-653, 1994.
9. [9]. A. Colmerauer. Equations and ineqtmtions on finite and infinite trees. In 2nd International Conference on Fifth Generation Computer Systems, pp 85-99, 1984.
10. [10]. T. Friihwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Sixth Annual IEEE Symposium on Logic in Computer Science, pp 300-309, July 1991.
11. [11]. R. Gilleron, S. Tison, and M. Tommasi. Solving systems of set constraints with negated subset relationships. In 34 th Symposium on Foundations of Computer Science, pp 372-380, 1993.
12. [12]. N. Heintze. Set based program analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992.
13. [13]. N. Heintze. Set based analysis of ML programs. Technical Report CMU-CS-93-193, School of Computer Science, Carnegie Mellon University, July 1993.
14. [14]. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Fifth Annual IEEE Symposium on Logic in Computer Science, pp 42-51, 1990.
15. [15]. R. Helm, K. Marriott, and M. Odersky. Constraint-based query optimization for spatial databases. In Tenth A CM Symposium on the Principles of Database Systems, pp 181-191, Denver, CO, May 1991.
16. [16]. J. Jaffar and J.-L. Lassez. Constraint logic programming. In 14th ACId Conference on Principles of Programming Languages, pp 111-119, Munich, Germany, Jan. 1987. ACM.
17. [17]. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51:26-52, 1995.
18. [18]. D. Kozen. Logical aspects of set constraints. In 1993 Conference on Computer Science Logic, LNCS 832, pp 175-188, Sept 1993.
19. [19]. J. Lassez and K. McAloon. Applications of a canonical form for generalized linear constraints. In International Conference on 5th Generation Computer Systems, pp 703-710, Tokyo, Japan, Dec 1988.
20. [20]. J.-L. Lassez and K. McAloon. A constraint sequent calculus. In Fifth Annual IEEE Symposium on Logic in Computer Science, pp 52-61, June 1990.
21. [21]. M. J. Maher. Logic semantics for a class of committed-choice programs. In J.-L. Lassez, editor, Logic Programming, Fourth International Conference, pp 858-876, Cambridge, MA, 1987. The MIT Press.
22. [22]. M. J. Maher. A logic programming view of CLP. In D. S. Warren, editor, lOth International Conference on Logic Programming, pp 737-753, Budapest, Hungary, June 1993. The MIT Press.
23. [23]. M. J. Maher. Constrained dependencies. In U. Montanari, editor, First International Conference on Principles and Practice of Constraint Programming (CP'95), LNCS 976, pp 170-185, Cassis, France, 19-22 Sept. 1995. Springer-Verlag.
24. [24]. M. Mfiller. Type Analysis for a Higher-Order Concurrent Constraint Language. Doetoral Dissertation. Universität des Saarlandes, Technische Fakultät, 66041 Saarbriieken, Germany, 1996. In preparation.
25. [25]. M. MiiUer, J. Niehren, and A. Podelski. Inclusion constraints over non:empty sets of trees. Submitted for publication.
26. [26]. V. A. Saraswat. Concurrent Constraint Programming. The MIT Press, Cambridge, MA, 1993.
27. [27]. G. Smolka. The Oz Programming Model. In Volume 1000 of LNCS. Springer-Verlag, Berlin, Germany, 1995.
28. [28]. G. Smolka and R. Treinen. Records for Logic Programming. The Journal of Logic Programming, 18(3):229-258, Apr 1994.