3244 search results - page 279 / 649 » Extensions to Description Logics |
168
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
138
click to vote
SUM
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
218
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
The recent upsurge in the interest in Semantic Web services and the high-profile projects such as the WSMO, OWLS, and SWSL, have drawn attention to the importance of logic-based ...
153
click to vote
IWINAC
2005
Springer
16 years 2 days ago
2005
Springer
The framework of multi-adjoint logic programming has shown to cover a number of approaches to reason under uncertainty, imprecise data or incomplete information. In previous works,...
186
click to vote
CSL
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a type-theoretic account of action calculi using the proposi...