319 search results - page 5 / 64 » Uncertainty Reasoning in Description Logics: A Generic Appro... |
JAIR
2007
13 years 7 months ago
2007
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
ICDT
2003
ACM
14 years 20 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
DLOG
2006
13 years 8 months ago
2006
The goal of this paper is to present how the Prolog Technology Theorem Proving (PTTP) approach can be used for ABox-reasoning. This work presents an inference algorithm over the l...
WWW
2009
ACM
14 years 2 months ago
2009
ACM
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
ICLP
2001
Springer
13 years 12 months ago
2001
Springer
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...