Sciweavers

137 search results - page 20 / 28
» Towards an Ontology of Approximate Reason
Sort
View
WWW
2007
ACM
15 years 10 months ago
Toward expressive syndication on the web
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
Christian Halaschek-Wiener, James A. Hendler
AI
2008
Springer
14 years 9 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
14 years 9 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
DLOG
2007
14 years 11 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong
CSFW
2010
IEEE
15 years 1 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko