1300 search results - page 107 / 260 » Probabilistic logic with independence |
CADE
2005
Springer
14 years 9 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
ESWS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We propose a general method and novel algorithmic techniques to facilitate the integration of independently developed ontologies using mappings. Our method and techniques...
FOCS
1991
IEEE
14 years 11 days ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...