Sciweavers

454 search results - page 59 / 91
» Representation results for defeasible logic
Sort
View
CGF
2008
137views more  CGF 2008»
13 years 8 months ago
Interaction-Dependent Semantics for Illustrative Volume Rendering
In traditional illustration the choice of appropriate styles and rendering techniques is guided by the intention of the artist. For illustrative volume visualizations it is diffic...
Peter Rautek, Stefan Bruckner, M. Eduard Gröl...
ICCBR
2009
Springer
13 years 6 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza
KR
2000
Springer
14 years 8 days ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
14 years 5 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
CONCUR
1997
Springer
14 years 26 days ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler