107 search results - page 20 / 22 » Reducing Propositional Theories in Equilibrium Logic to Logi... |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...