Model equivalence of PRISM programs

James Cussens

doi:10.4230/DagSemProc.07161.7

Model equivalence of PRISM programs

James Cussens

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

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 emph{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.

Original language	English
Title of host publication	Probabilistic, Logical and Relational Learning - A Further Synthesis
Subtitle of host publication	Dagstuhl Seminar Proceedings
Pages	1-21
Volume	7161
DOIs	https://doi.org/10.4230/DagSemProc.07161.7
Publication status	Published - 6 Mar 2008

Access to Document

10.4230/DagSemProc.07161.7

Handle.net

Persistent link

Cite this

@inproceedings{989cbe6183c049f089fe59e9bb59e3b7,

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 emph{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 = "2008",

month = mar,

day = "6",

doi = "10.4230/DagSemProc.07161.7",

language = "English",

volume = "7161",

pages = "1--21",

booktitle = "Probabilistic, Logical and Relational Learning - A Further Synthesis",

}

TY - GEN

T1 - Model equivalence of PRISM programs

AU - Cussens, James

PY - 2008/3/6

Y1 - 2008/3/6

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 emph{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.

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 emph{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.

U2 - 10.4230/DagSemProc.07161.7

DO - 10.4230/DagSemProc.07161.7

M3 - Conference Contribution (Conference Proceeding)

VL - 7161

SP - 1

EP - 21

BT - Probabilistic, Logical and Relational Learning - A Further Synthesis

ER -

Model equivalence of PRISM programs

Abstract

Access to Document

Handle.net

Fingerprint

Cite this