886 search results - page 114 / 178 » Reasoning with contextual graphs |
152
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
190
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
118
click to vote
LICS
2006
IEEE
15 years 10 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 ...
111
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we introduce a tile-graph-based approach to power planning. For a given flooplan solution, the power inputs are modeled into a tile graph, the minimum capacity of e...
146
click to vote
ISSS
1998
IEEE
15 years 8 months ago
1998
IEEE
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...