Sciweavers

3032 search results - page 465 / 607
» Description Logic Rules
Sort
View
MEMOCODE
2010
IEEE
13 years 8 months ago
A formal executable semantics of Verilog
This paper describes a formal executable semantics for the Verilog hardware description language. The goal of our formalization is to provide a concise and mathematically rigorous...
Patrick O'Neil Meredith, Michael Katelman, Jos&eac...
DLOG
2011
13 years 2 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
DLOG
2011
13 years 2 months ago
The Complexity of Probabilistic EL
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
Jean Christoph Jung, Víctor Gutiérre...
VIS
2007
IEEE
107views Visualization» more  VIS 2007»
14 years 12 months ago
Semantic Layers for Illustrative Volume Rendering
Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. ...
Peter Rautek, Stefan Bruckner, M. Eduard Grölle...
CADE
2007
Springer
14 years 11 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur