Tractable constraints in finite semilattices

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

Volumn 1145, Issue , 1996, Pages 285-300

  Rehof, Jakob ^a   Mogensen, Torben Æ ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Algorithms; Constraint satisfiability; Finite semilattices; Program analysis; Tractability

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LOGIC; LOGIC PROGRAMMING;

CONSTRAINT SATISFIABILITY; INEQUALITY CONSTRAINT; LINEAR-TIME ALGORITHMS; MONOTONE FUNCTIONS; PROGRAM ANALYSIS; RELATIONAL CONSTRAINT; SEMILATTICES; TRACTABILITY;

STATIC ANALYSIS;

EID: 84957705773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_48     Document Type: Conference Paper

References (21)

1. L. Birkedal, M. Tofte, and M. Vejlstrup. From region inference to von Neumann machines via region representation inference. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages (POPL), pages 171-183. ACM Press, January 1996.
2. L. Birkedal and M. Welinder. Binding-time analysis for Standard ML. Lisp and Symbolic Computation, 8(3):191-208, September 1995.
3. A. Bondorf and J. Jørgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315-346, July 1993.
4. C.C. Chang and H.J. Keisler. Model Theory. Studies in Logic and the Foundation of Mathematics, Vol. 73, 3rd ed., North Holland, 1990.
5. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge Mathematical Textbooks, Cambridge University Press, 1990.
6. R. Dechter and J. Pearl. Structure identification in relational data. Artificial Intelligence, 58:237-270, 1992.
7. William F. Dowling and Jean H. Gallier. Lìnećir-time algorithms for testing the satisfiability of prepositional horn formulae. Journal of Logic Programming, 3:267-284, 1984.
8. Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Proc. 2nd Int'l Static Analysis Symposium (SAS), Glasgow, Scotland, Lecture Notes in Computer Science. Springer-Verlag, September 1995.
9. M. Garey and D. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, 1979.
10. R. Greenlaw, H.J. Hoover, and W. Ruzzo. Limits to Parallel Computation. P- Completeness Theory. Oxford University Press, 1995.
11. F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts, August 1991 (Lecture Notes in Computer Science, vol. 523), pages 448-472. ACM, Berlin: Springer-Verlag, 1991.
12. W. Hodges. Model Theory. Encyclopedia of Mathematics and its Applications, Vol. 42, Cambridge University Press, 1993.
13. P. Jeavons and M. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79:327-339, 1995.
14. Peter Jeavons and David Cohen. An algebraic characterization of tractable constraints. In First Annual Conference on Computing and Combinatorics (COCOON), pages 633-642. Springer Verlag, LNCS 959, 1995.
15. Peter Jeavons, David Cohen, and Marc Gyssens. A unifying framework for tractable constraints. In First International Conference on Principles and Practice of Constraint Programming, pages 276-291. Springer Verlag, LNCS 976, 1995.
16. G. Kildall. A unified approach to global program optimization. Proc. ACM Symp. on Principles of Programming Languages (POPL), 1973.
17. T. A. Mogensen. Types for 0, 1 or many uses. Technical report, In preparation, 1996.
18. Vaughan Pratt and Jerzy Tiuryn. Satisfiability of inequalities in a poset. Studia Logica, Helene Rasiowa memorial issue (to appear), 1996.
19. Jakob Rehof and Torben Mogensen. Report on tractable constraints in finite semilattices. Technical report, DIKU, Dept, of Computer Science, University of Copenhagen, Denmark. Available at http://www.diku.dk/research- groups/topps/personal/ rehof/publications.html, 1996.
20. Thomas J. Schaefer. The complexity of satisfiability problems. In Tenth Annual Symposium on the Theory of Computing (STOC), pages 216-226. ACM, 1978.
21. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value λ- calculus using a stack of regions. In Proc. 21st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Portland, Oregon. ACM, ACM Press, January 1994.