1486 search results - page 109 / 298 » A Logically Saturated Extension of |
176
click to vote
FROCOS
2009
Springer
16 years 13 days ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
153
click to vote
TLCA
2009
Springer
16 years 12 days 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...
130
click to vote
SUM
2007
Springer
15 years 12 months 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...
209
click to vote
VLDB
2007
ACM
15 years 12 months 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 ...
142
Voted
IWINAC
2005
Springer
15 years 11 months 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,...