License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07161.7
URN: urn:nbn:de:0030-drops-13808
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1380/
Go to the corresponding Portal


Cussens, James

Model equivalence of PRISM programs

pdf-format:
07161.CussensJames.Paper.1380.pdf (0.2 MB)


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.


BibTeX - Entry

@InProceedings{cussens:DagSemProc.07161.7,
  author =	{Cussens, James},
  title =	{{Model equivalence of PRISM programs}},
  booktitle =	{Probabilistic, Logical and Relational Learning - A Further Synthesis},
  pages =	{1--21},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7161},
  editor =	{Luc de Raedt and Thomas Dietterich and Lise Getoor and Kristian Kersting and Stephen H. Muggleton},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1380},
  URN =		{urn:nbn:de:0030-drops-13808},
  doi =		{10.4230/DagSemProc.07161.7},
  annote =	{Keywords: PRISM programs, model equivalence, model inclusion, algebraic statistics, algebraic geometry, ideals, varieties, Gr"\{o\}bner bases, polynomials}
}

Keywords: PRISM programs, model equivalence, model inclusion, algebraic statistics, algebraic geometry, ideals, varieties, Gr"{o}bner bases, polynomials
Collection: 07161 - Probabilistic, Logical and Relational Learning - A Further Synthesis
Issue Date: 2008
Date of publication: 06.03.2008


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI