Filters








62,884 Hits in 4.8 sec

Predicate transformers for extended probability and non-determinism

KLAUS KEIMEL, GORDON D. PLOTKIN
2009 Mathematical Structures in Computer Science  
We investigate laws for predicate transformers for the combination of non-deterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended non-negative  ...  These predicate transformers correspond to state transformers, which are functions to conical powerdomains, which are the appropriate powerdomains for the combined forms of non-determinism.  ...  of ordinary and probabilistic non-determinism.  ... 
doi:10.1017/s0960129509007555 fatcat:szyaxvnvrbgjzkstoz32pi3g3q

1BC: A First-Order Bayesian Classifier [chapter]

Peter Flach, Nicolas Lachiche
1999 Lecture Notes in Computer Science  
Our approach is to view individuals as structured terms, and to distinguish between structural predicates referring to subterms घe.g. atoms from moleculesङ, and properties applying to one or several of  ...  We describe an individual in terms of elementary features consisting of zero or more structural predicates and one property; these features are considered conditionally independent following the usual  ...  A functional structural predicate, or structural function, r efers to a unique subterm, while a non-determinate structural predicate is non-functional.  ... 
doi:10.1007/3-540-48751-4_10 fatcat:q3bokxkbbbdgxf4ds434wrko7q

From PRISM to ProbLog and Back Again

Alexander Vandenbroucke, Tom Schrijvers
2017 International Conference on Inductive Logic Programming  
PRISM and ProbLog are two prominent languages for Probabilistic Logic Programming.  ...  This paper aims to shed more light on the differences by developing two source-to-source transformations, from PRISM to ProbLog and back.  ...  Acknowledgments We are grateful to Angelika Kimmig, Anton Dries, Wannes Meert and Luc De Raedt, and the anonymous reviewers for their helpful comments.  ... 
dblp:conf/ilp/VandenbrouckeS17 fatcat:6iz6o7mzlrbrhe7l27dy76adee

Page 22 of Mathematical Reviews Vol. , Issue 2000a [page]

2000 Mathematical Reviews  
Likewise, a probability measure (MP) on & is determined by its values on B, and these values must sum to 1.  ...  {For the entire collection see MR 99m:03039. } 2000a:03034 03B45 PliuSkevitiené, Aida (LI-AOS; Vilnius) Extended disjunction and existence properties for some predicate modal logics.  ... 

Probabilistic Inference in SWI-Prolog

Fabrizio Riguzzi, Jan Wielemaker, Riccardo Zese
2018 International Conference on Inductive Logic Programming  
In particular, BDDs are used to compactly encode explanations for goals and efficiently compute their probability.  ...  This paper shows how SWI-Prolog has been extended to include correct answer subsumption and how the PITA transformation has been changed to use SWI-Prolog implementation.  ...  The modified table/1 directive is used to determine the term that is used for call variant detection and compile a combined aggregation predicate that is called for each answer that is added to the table  ... 
dblp:conf/ilp/RiguzziWZ18 fatcat:p42celpygjf7nchdws6uozw5dq

Non-discriminating Arguments and Their Uses [chapter]

Henning Christiansen, John P. Gallagher
2009 Lecture Notes in Computer Science  
We present a technique for identifying predicate arguments that play no role in determining the control flow of a logic program with respect to goals satisfying given mode and sharing restrictions.  ...  Following this, we define a transformation procedure, called discriminator slicing, that removes the non-discriminating arguments, resulting in a program whose computation trees are isomorphic to those  ...  We thank Yoshitaka Kamaya, Ole Torp Lassen, Pedro López-García and Manuel V. Hermenegildo for useful discussions.  ... 
doi:10.1007/978-3-642-02846-5_10 fatcat:omesdn645ja2tdhkrwnwaptuli

Of Probabilistic wp and CSP—and Compositionality [chapter]

Carroll Morgan
2005 Lecture Notes in Computer Science  
A probabilistic sequential semantics for pGCL [31] is "inserted underneath" an existing but non-probabilistic link between action systems and CSP.  ...  In the meantime, however, we probably raise more questions than we answer: in particular, the issue of compositionality-for the moment-remains as delicate as ever.  ...  Acknowledgements We thank the Australian Research Council for their support under their Discovery Grants Programme, and Christine Paulin-Mohring and the Laboratoire de Recherche en Informatique (LRI )  ... 
doi:10.1007/11423348_12 fatcat:gkyobre2aje7loytzyk6elkaeq

Learning along a Channel: the Expectation part of Expectation-Maximisation

Bart Jacobs
2019 Electronical Notes in Theoretical Computer Science  
It is shown that M and C forms exist for validity of data, for learning from data, and for learning along a channel.  ...  It is redescribed as a natural transformation from multisets to distributions that commutes with marginalisation and disintegration.  ...  It is described here as as a natural transformation of the form M * ⇒ D, where M * is the (sub)monad of non-empty multisets, and where D is the discrete probability distribution monad.  ... 
doi:10.1016/j.entcs.2019.09.008 fatcat:rb7tc6kpivgdpdc73ewk4utaba

Learnability of constrained logic programs [chapter]

Sašo Džeroski, Stephen Muggleton, Stuart Russell
1993 Lecture Notes in Computer Science  
This paper defines the ILP problem and describes several syntactic restrictions that are often used in ILP.  ...  More specifically, k-literal predicate definitions consisting of constrained, function-free, nonrecursive program clauses are polynomially PAC-learnable under arbitrary distributions.  ...  Thanks to Luc De Raedt for his comments on the paper.  ... 
doi:10.1007/3-540-56602-3_148 fatcat:yjwrdw5hvjcbzo6fkspjq6dhcu

A Channel-based Exact Inference Algorithm for Bayesian Networks [article]

Bart Jacobs
2018 arXiv   pre-print
The paper concentrates on the ideas behind this algorithm, involving a linearisation ('stretching') of the Bayesian network, followed by a combination of forward state transformation and backward predicate  ...  transformation, while evidence is accumulated along the way.  ...  Acknoledgements Thanks are due to Kenta Cho, Fabio Zanasi and Marco Gaboardi for discussions and feedback.  ... 
arXiv:1804.08032v1 fatcat:agdw4ahvw5aotaflb2byigjvry

An expectation transformer approach to predicate abstraction and data independence for probabilistic programs

Ukachukwu Ndukwu, Annabelle McIver
2010 Electronic Proceedings in Theoretical Computer Science  
We recast the theory using expectation transformers, and identify transformer properties which correspond to abstractions that yield nevertheless exact bound on the performance of infinite state probabilistic  ...  In this paper we revisit the well-known technique of predicate abstraction to characterise performance attributes of system models incorporating probability.  ...  Acknowledgement: The authors are grateful to the anonymous reviewers for their helpful comments. Uk Ndukwu and AK McIver  ... 
doi:10.4204/eptcs.28.9 fatcat:de73afhw5ncgbbkbicckrxoqoa

A UTP Semantics of pGCL as a Homogeneous Relation [chapter]

Riccardo Bresciani, Andrew Butterfield
2012 Lecture Notes in Computer Science  
Our contribution is a UTP encoding that captures pGCL programs as predicate-transformers, on predicates over probability distributions on before-and after-states: these predicates capture the same information  ...  as the models traditionally used to give semantics to pGCL; in addition our formulation allows us to define a generic choice construct, that covers conditional, probabilistic and non-deterministic choice  ...  Acknowledgements We wish to thank (some of) the anonymous referees who have reviewed previous versions of this paper for their insightful comments and suggestions.  ... 
doi:10.1007/978-3-642-30729-4_14 fatcat:nl3c677pmjhcxpwjeqqirhvdyi

Value-based predicate filtering of XML documents

Joonho Kwon, Praveen Rao, Bongki Moon, Sukho Lee
2008 Data & Knowledge Engineering  
The pFiST system supports equality and non-equality operators, and in addition can handle logical operators such as AND and OR in the value-based predicates.  ...  However, existing techniques provide limited or no support for twig patterns that contain various operators in the value-based predicates.  ...  Acknowledgements We are grateful to the anonymous referees for their valuable comments.  ... 
doi:10.1016/j.datak.2008.06.012 fatcat:ay3uvkczk5at3cvrrvcf4s3mki

Reasoning Algebraically About Probabilistic Loops [chapter]

Larissa Meinicke, Ian J. Hayes
2006 Lecture Notes in Computer Science  
In particular, our probabilistic action system data refinement rules are new. 1 McIver and Morgan have extended their work on expectation transformer semantics to deal with infinite state spaces [11] .  ...  We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems.  ...  This research was supported by Australian Research Council (ARC) Discovery Grant DP0558408, Analysing and generating fault-tolerant real-time systems.  ... 
doi:10.1007/11901433_21 fatcat:xend4bqv4zaz7mcdyutokrh3ka

PAC-learnability of determinate logic programs

Sašo Džeroski, Stephen Muggleton, Stuart Russell
1992 Proceedings of the fifth annual workshop on Computational learning theory - COLT '92  
Acknowledgements Szulo Diieroski is on leave from Institut Joief Stefan, Ljubljana, Slovenia and is supported by a scholarship from the British Council and the Slovene Ministry of Science and Technology  ...  Stuart Russell is on sabbatical from the Computer Science Division, University of California, Berkeley and is supported by a Visiting Fellowship from the UK Science and Engineering Research Council and  ...  We first present the transformation algorithm and then illustrate its operation on the example given above. For the moment, we consider only the problem of learning non-recursive clauses.  ... 
doi:10.1145/130385.130399 dblp:conf/colt/DzeroskiMR92 fatcat:znvsqnaubzgnrlgmgsxmdngxmq
« Previous Showing results 1 — 15 out of 62,884 results