778 search results - page 46 / 156 » Expressiveness and complexity of graph logic |
76
Voted
LOGCOM
2010
14 years 11 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
NPAR
2004
ACM
15 years 6 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
72
Voted
CORR
1998
Springer
15 years 6 days ago
1998
Springer
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
CSL
2005
Springer
15 years 6 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
102
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...