Revising probabilistic prolog programs

0Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Ver lag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., & Toivonen, H. (2007). Revising probabilistic prolog programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4455 LNAI, pp. 30–33). Springer Verlag. https://doi.org/10.1007/978-3-540-73847-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free