Sciweavers

522 search results - page 34 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
PODS
1998
ACM
116views Database» more  PODS 1998»
14 years 22 days ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 7 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
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...
Robin Hirsch, Nikos Gorogiannis
NPAR
2004
ACM
14 years 1 months ago
Rendering complexity in computer-generated pen-and-ink illustrations
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...
Brett Wilson, Kwan-Liu Ma
CORR
1998
Springer
103views Education» more  CORR 1998»
13 years 8 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
CSL
2005
Springer
14 years 2 months ago
Permutative Logic
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...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet