1199 search results - page 235 / 240 » Parameterized Proof Complexity |
CLIMA
2004
13 years 8 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
FLAIRS
2004
13 years 8 months ago
2004
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
IJCAI
1989
13 years 8 months ago
1989
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...