Logic Programs with Annotated Disjunctions

   Info_icon.svg   data    BibTeX_logo.svg   bibtex
Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe
Bart Demoen, Vladimir Lifschitz (eds.)
Logic Programming. 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004. Proceedings, pages 431–445
Lecture Notes in Computer Science 3132
Springer
2004

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.

origin event
journal or series
Journal_icon.svg Lecture Notes in Computer Science (LNCS)