Sciweavers

99 search results - page 12 / 20
» Extending Classical Theorem Proving for the Semantic Web
Sort
View
MSCS
1998
58views more  MSCS 1998»
14 years 10 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
POPL
2010
ACM
15 years 8 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
91
Voted
WWW
2008
ACM
15 years 11 months ago
Scalable querying services over fuzzy ontologies
Fuzzy ontologies are envisioned to be useful in the Semantic Web. Existing fuzzy ontology reasoners are not scalable enough to handle the scale of data that the Web provides. In t...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, S...
DAGSTUHL
2008
15 years 15 days ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb
ESWS
2008
Springer
15 years 24 days ago
Forgetting Concepts in DL-Lite
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, ...
Zhe Wang, Kewen Wang, Rodney W. Topor, Jeff Z. Pan