Model Equivalence of PRISM programs

James Cussens

Model Equivalence of PRISM programs

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	Proceedings of the Dagstuhl seminar: Probabilistic, Logical and Relational Learning - A Further Synthesis
Publication status	Published - 2007

Access to Document

http://d-nb.info/99532459X/34

Cite this

@inproceedings{60db7ffafe6a406c9fa3c07315ae1f0b,

title = "Model Equivalence of PRISM programs",

abstract = "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{\"o}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.",

author = "James Cussens",

year = "2007",

language = "English",

booktitle = "Proceedings of the Dagstuhl seminar: Probabilistic, Logical and Relational Learning - A Further Synthesis",

}

TY - GEN

T1 - Model Equivalence of PRISM programs

AU - Cussens, James

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

M3 - Conference contribution

BT - Proceedings of the Dagstuhl seminar: Probabilistic, Logical and Relational Learning - A Further Synthesis

ER -