Sciweavers

56 search results - page 5 / 12
» A Road-Map on Complexity for Hybrid Logics
Sort
View
NPAR
2004
ACM
15 years 2 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
CHI
2011
ACM
14 years 1 months ago
Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops
We introduce “Facet-Streams”, a hybrid interactive surface for co-located collaborative product search on a tabletop. Facet-Streams combines techniques of information visualiz...
Hans-Christian Jetter, Jens Gerken, Michael Zö...
LMCS
2007
132views more  LMCS 2007»
14 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
IJCAI
2003
14 years 11 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
ENTCS
2007
156views more  ENTCS 2007»
14 years 9 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...