On the equivalence between CP-logic and LPADs
We give a detailed proof of the fact that the probabilistic logics of Logic Programs with Annotated Disjunctions (LPADs) and CP-logic are equivalent. This report contains a detailed proof of the fact that Logic Programs with Annotated Disjunctions (LPADs) (6) and CP-logic (5) are equivalent. Before moving on to this proof, we first present some preliminaries from lattice theory and logic programming, and summarize the definition of LPADs and CP-logic.