论文信息 - Satisfiability of Inequalities in a Poset

Satisfiability of Inequalities in a Poset

We consider tractable and intractable cases of the satisfiability problem for conjunctions of inequalities between variables and constants in a fixed finite poset. We show that crowns are intractable. We study members and closure properties of the class of tractable posets. We define a feasible poset to be one whose potential obstacles to satisfiability are representable by a certain formula of the first-order extended by the least fixed operator. For bipartite posets we give a complete classification of hard posets and feasible ones.

Jerzy Tiuryn | Vaughan R. Pratt | V. Pratt | J. Tiuryn

[1] John C. Mitchell,et al. Lower bounds on type inference with subtypes , 1995, POPL '95.

[2] Peter Nevermann,et al. Holes in ordered sets , 1985, Graphs Comb..

[3] Marcin Benke. Efficient Type Reconstruction in the Presence of Inheritance , 1993, MFCS.

[4] Tomás Feder,et al. Monotone monadic SNP and constraint satisfaction , 1993, STOC.

[5] Mitchell Wand,et al. On the complexity of type inference with coercion , 1989, FPCA.

[6] Jerzy Tiuryn,et al. Type Reconstruction with Recursive Types and Atomic Subtyping , 1993, TAPSOFT.

[7] John C. Mitchell,et al. Coercion and type inference , 1984, POPL.

[8] John C. Mitchell,et al. Algorithmic aspects of type inference with subtypes , 1992, POPL '92.