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


Cussens, James

Model equivalence of PRISM programs

pdf-format:
Document 1.pdf (192 KB)


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:DSP:2008:1380,
  author =	{James Cussens},
  title =	{Model equivalence of PRISM programs},
  booktitle =	{Probabilistic, Logical and Relational Learning - A Further Synthesis},
  year =	{2008},
  editor =	{Luc de Raedt and Thomas Dietterich and Lise Getoor and Kristian Kersting and Stephen H. Muggleton},
  number =	{07161},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1380},
  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
Seminar: 07161 - Probabilistic, Logical and Relational Learning - A Further Synthesis
Issue Date: 2008
Date of publication: 06.03.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI