16 search results - page 2 / 4 » Compressing probabilistic Prolog programs |
APIN
2000
13 years 5 months ago
2000
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
UAI
2003
13 years 6 months ago
2003
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
ICLP
2010
Springer
13 years 9 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...