4340 search results - page 709 / 868 » Formal Methods and Cryptography |
138
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
134
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
147
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
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...
145
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Name ambiguity problem has been a challenging issue for a long history. In this paper, we intend to make a thorough investigation of the whole problem. Specifically, we formalize ...
152
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...