49 search results - page 8 / 10 » XSB: Extending Prolog with Tabled Logic Programming |
ICLP
2010
Springer
13 years 10 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...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
PADL
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
ICLP
2010
Springer
13 years 10 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...