Satisfiability of inequalities in a poset

Fundamenta Informaticae

Volumn 28, Issue 1-2, 1996, Pages 165-182

  Pratt, Vaughan ^a   Tiuryn, Jerzy ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; LOGIC PROGRAMMING; SET THEORY;

INEQUALITIES; POSET; SATISFIABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0030281821     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-281211     Document Type: Article

References (10)

1. Marcin Benke. Efficient Type Reconstruction in the Presence of Inheritance. In: A. M. Borzyszkowski, S. Sokołowski (Eds.) MFCS'93: Mathematical Foundations of Computer science, Proc. 18th Intern. Symp., pages 272-280, Springer Verlag, LNCS 711, 1993.
2. Marcin Benke. Subtyping and Alternation. To appear as Technical Report, Institute of Informatics, Warsaw University, 1995.
3. T.A. Feder and M. Vardi. Monotone monadic SNP and constraint satisfaction. In Proc. 25th ACM Symp. on Theory of Computing, pages 612-622, 1993.
4. My Hoang and John C. Mitchell. Lower Bounds on Type Inference with Subtypes. In Conf. Rec. 22nd ACM Symposium on Principles of Programming Languages, pages 176-185, 1995.
5. John C. Mitchell. Coercion and Type Inference (summary). In Conf. Rec. 11th ACM Symposium on Principles of Programming Languages, pages 175-185, 1984.
6. Patrick Lincoln and John C. Mitchell. Algorithmic Aspects of Type Inference with Subtypes. In Conf. Rec. 19th ACM Symposium on Principles of Programming Languages, pages 293-304, 1992.
7. P. Nevermann and I. Rival. Holes in ordered sets. Graphs and Combinatorics, pages 339-350, 1985.
8. Mitchell Wand and Patrick M. O'Keefe. On the Complexity of Type Inference with Coercion. In Conf. on Functional Programming Languages and Computer Architecture, 1989.
9. Jerzy Tiuryn. Subtype Inequalities. In Proc. 7th IEEE Symposium on Logic in Computer Science, pages 308-315, 1992.
10. Jerzy Tiuryn and Mitchell Wand. Type reconstruction with recursive types and atomic subtyping. In: M.-C. Gaudel and J.-P. Jouannaud (Eds.) TAPSOFT'93: Theory and Practice of Software Development, Proc. 4th Intern. Joint Conf. CAAP/FASE, Springer-Verlag LNCS 668, 1993, pp.686-701.