dpasp
dpasp copied to clipboard
Maximum a Posteriori Inference
Implement algorithms for maximum a posteriori inference, that is, finding the probable interpretation of a selected set of facts. Implement at least a brute-force algorithm and an algorithm that calls clingo or plingo for optimization/sampling. Can start with simple cases (acyclic/stratified programs) then move to programs with cycles and max-ent semantics.
I Would like to work on this issue
Hi Kaustubh,
Any help is appreciated. You can submit a merge request, once you have something. Please let me know if you need/want any guidance.
Best Regards, Denis
On 1 Oct 2023, at 11:58, Kaustubh Ratwadkar @.***> wrote:
I Would like to work on this issue
— Reply to this email directly, view it on GitHub https://github.com/kamel-usp/dpasp/issues/2#issuecomment-1742168762, or unsubscribe https://github.com/notifications/unsubscribe-auth/AB5N3MGLR5ZI7TVOSJE6UHDX5G4OHANCNFSM6AAAAAA4Y65RA4. You are receiving this because you authored the thread.