393 search results - page 62 / 79 » Probabilistic Description Logic Programs |
KR
1998
Springer
14 years 22 days ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
TCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
SIGSOFT
2003
ACM
14 years 9 months ago
2003
ACM
Web Services are software services that can be advertised by providers and deployed by customers using Web technologies. This concept is currently carried further to address Web s...
DLOG
2007
13 years 10 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
UAI
2008
13 years 10 months ago
2008
Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal langu...