Sciweavers

1435 search results - page 210 / 287
» E-connections of Description Logics
Sort
View
ESWS
2007
Springer
15 years 7 months ago
Algorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuraci...
Yue Ma, Pascal Hitzler, Zuoquan Lin
AGP
2003
IEEE
15 years 6 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
LPAR
2004
Springer
15 years 6 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
SEMWEB
2004
Springer
15 years 6 months ago
Learning Meta-descriptions of the FOAF Network
We argue that in a distributed context, such as the Semantic Web, ontology engineers and data creators often cannot control (or even imagine) the possible uses their data or ontolo...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...
DAC
2003
ACM
16 years 2 months ago
The synthesis of cyclic combinational circuits
Combinational circuits are generally thought of as acyclic structures. It is known that cyclic structures can be combinational, and techniques have been proposed to analyze cyclic...
Marc D. Riedel, Jehoshua Bruck