684 search results - page 82 / 137 » A characterization of b-perfect graphs |
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
DATE
2003
IEEE
15 years 5 months ago
2003
IEEE
A new method is presented to model symbolically strongly nonlinear circuits, characterized by Piece-Wise Linear (PWL) functions. The method follows the idea of Bokhoven and Leenae...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
127
click to vote
AIML
2008
15 years 1 months ago
2008
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...