Sciweavers

2035 search results - page 356 / 407
» On the complexity of stratified logics
Sort
View
SWAP
2007
14 years 11 months ago
Who the FOAF knows Alice? RDF Revocation in DBin 2.0
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating ...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...
CIIA
2009
14 years 11 months ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci
DEXA
2010
Springer
180views Database» more  DEXA 2010»
14 years 11 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...
GG
2010
Springer
14 years 11 months ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
GLVLSI
2008
IEEE
150views VLSI» more  GLVLSI 2008»
14 years 10 months ago
Using unsatisfiable cores to debug multiple design errors
Due to the increasing complexity of today's circuits a high degree of automation in the design process is mandatory. The detection of faults and design errors is supported qu...
André Sülflow, Görschwin Fey, Rod...