Sciweavers

313 search results - page 1 / 63
» Model equivalence of PRISM programs
Sort
View
DAGSTUHL
2007
13 years 6 months ago
Model equivalence of PRISM programs
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 a...
James Cussens
ICLP
2009
Springer
14 years 5 months ago
Generative Modeling by PRISM
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data. After reviewing ...
Taisuke Sato
ATVA
2006
Springer
123views Hardware» more  ATVA 2006»
13 years 8 months ago
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
Alastair F. Donaldson, Alice Miller
BMCBI
2006
137views more  BMCBI 2006»
13 years 5 months ago
Bounded search for de novo identification of degenerate cis-regulatory elements
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
Jonathan M. Carlson, Arijit Chakravarty, Radhika S...
LANMR
2007
13 years 6 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...