The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from algebraic statistics, specifically the computation of elimination ideals and Gröbner bases. A very brief introduction to algebraic statistics is given. Consideration is given to cases where shortcuts to proving/disproving model equivalence are available.
|Title of host publication||Proceedings of the Dagstuhl seminar: Probabilistic, Logical and Relational Learning - A Further Synthesis|
|Publication status||Published - 2007|