1020 search results - page 102 / 204 » Tight Semantics for Logic Programs |
APWEB
2006
Springer
14 years 1 months ago
2006
Springer
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
LOPSTR
2009
Springer
14 years 4 months ago
2009
Springer
We propose a new grouping operator for logic programs based on the group_by operator of SQL. The novelty of our proposal lies in the use of modes, which allows us to relax some rat...
SEKE
2001
Springer
14 years 2 months ago
2001
Springer
ct 7 Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle 8 defects in the logic design of these s...
UAI
2008
13 years 11 months ago
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...