Sciweavers

NMR
2004
Springer

Logic programs with annotated disjunctions

13 years 10 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, we introduce a new formalism, Logic Programs with Annotated Disjunctions, based on disjunctive logic programs. In this formalism, each of the disjuncts in the head of a clause is annotated with a probability. Viewing such a set of probabilistic disjunctive clauses as a probabilistic disjunction of normal logic programs allows us to derive a possible world semantics, more precisely, a probability distribution on the set of all Herbrand interpretations. We demonstrate the strength of this formalism by some examples and compare it to related work.
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where NMR
Authors Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe
Comments (0)