

Author: Cussens J.
Publisher: Springer Publishing Company
ISSN: 0885-6125
Source: Machine Learning, Vol.44, Iss.3, 2001-09, pp. : 245-271
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Stochastic logic programs (SLPs) are logic programs with parameterised clauses which define a log-linear distribution over refutations of goals. The log-linear distribution provides, by marginalisation, a distribution over variable bindings, allowing SLPs to compactly represent quite complex distributions. We analyse the fundamental statistical properties of SLPs addressing issues concerning infinite derivations, ‘unnormalised’ SLPs and impure SLPs. After detailing existing approaches to parameter estimation for log-linear models and their application to SLPs, we present a new algorithm called failure-adjusted maximisation (FAM). FAM is an instance of the EM algorithm that applies specifically to normalised SLPs and provides a closed-form for computing parameter updates within an iterative maximisation approach. We empirically show that FAM works on some small examples and discuss methods for applying it to bigger problems.
Related content


On logic programs that do not fail
Electronic Notes in Theoretical Computer Science, Vol. 30, Iss. 1, 2004-01 ,pp. :


On logic programs that always succeed
Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. :


Transforming constraint logic programs
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :


Scenarios for Multistage Stochastic Programs
By Dupačová J.
Annals of Operations Research, Vol. 100, Iss. 1-4, 2000-12 ,pp. :


A splitting method for stochastic programs
By Pennanen Teemu Kallio Markku
Annals of Operations Research, Vol. 142, Iss. 1, 2006-02 ,pp. :