-
Notifications
You must be signed in to change notification settings - Fork 13
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Get proof trees for queries on probabilistic logic programs? #50
Comments
Hi Jean Christophe, Best |
Thanks for the information and the suggestion. |
I re-opened the issue because I started considering writing code that automatically converts an LPAD to a program with CLPR constraints. For example, given the LPAD:
Automatically generate (where the X's are probabilities):
One advantage could be to facilitate generating proof trees such as the following (in addition to the BDDs you suggested).
Another advantage is that it would be possible to reason bidirectionally (curtesy of CLPR), e.g. "Given that Josh is happy, that he is friends with mark who is nice, what is the probability that Josh is rich?" And it would be cool be be able to go from a SLIPCOVER generated LPAD to a CLPR version. On the other hand I am not sure if the semantics associated with CLPR adequately captures LPADS... These are just some thoughts (not an issue with CPLINT per se)... I am curious about if you think that this is a good idea or not before I embark on such a project :-) |
Hi,
Replace and, or and not computations with CLPR computations and you would get what you want. |
Aha I see. Maybe more tricky than I thought initially. Thank you for suggesting where to look in Pita! |
Hi!
Is it possible to get proof trees for queries on probabilistic logic programs? I.e. like SLDNF draw or s(CASP) but with a PLP.
Kind regards, JC
The text was updated successfully, but these errors were encountered: