Revising Probabilistic Prolog Programs

  • Authors:

  • Luc Raedt;Kristian Kersting;Angelika Kimmig;Kate Revoredo;Hannu Toivonen

  • Affiliations:

  • Inst. f. Informatik, Universität Freiburg, Georges-Köhler-Allee 079, D-79110 Freiburg, Dep. Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B-3001 Leuven,;Inst. f. Informatik, Universität Freiburg, Georges-Köhler-Allee 079, D-79110 Freiburg, Dep. Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B-3001 Leuven,;Inst. f. Informatik, Universität Freiburg, Georges-Köhler-Allee 079, D-79110 Freiburg, Dep. Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B-3001 Leuven,;Inst. f. Informatik, Universität Freiburg, Georges-Köhler-Allee 079, D-79110 Freiburg, Dep. Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B-3001 Leuven,;Inst. f. Informatik, Universität Freiburg, Georges-Köhler-Allee 079, D-79110 Freiburg, Dep. Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B-3001 Leuven,

  • Venue:
  • Inductive Logic Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ProbLog (probabilistic prolog) language has been introduced in [1], where various algorithms have been developed for solving and approximating ProbLog queries. Here, we define and study the problem of revising ProbLog theories from examples.