Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A new approach to hybrid probabilistic logic programs

A new approach to hybrid probabilistic logic programs Ann Math Artif Intell (2007) 50:417–418 DOI 10.1007/s10472-007-9082-1 ERRATUM Emad Saad · Enrico Pontelli Published online: 10 August 2007 © Springer Science + Business Media B.V. 2007 1. On page 219, item 4 of Definition 28 should be changed to h satisfies the ground h-program P = R,τ  iff h satisfies every h-rule in R and for every formula F ∈ bf ( B ), we have S L • If F = A is atomic then c {{μ| A : μ ← Body ∈ Rsuchthat h |= Body}} ≤ h( A). τ( A) t • If F = A ∗ ... ∗ A is not atomic then 1 ρ ρ n c {{(h( A ), ..., h( A )}} ≤ h( F ). ρ 1 n t 2. On page 223, the last item of Definition 34 should be changed to h satisfies P iff h satisfies every nh-rule in R and: • If A ∈ dom(h) is atomic, then we have c {{μ| A : μ ← Body ∈ Rand h |= Body}} ≤ h( A). τ( A) t The article was published in Annals of Mathematics and Artificial Intelligence 48, 187–243. The online version of http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

A new approach to hybrid probabilistic logic programs

Download PDF
2 pages

Loading next page...
 
/lp/springer-journals/a-new-approach-to-hybrid-probabilistic-logic-programs-tuUU0HN9Yu

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media B.V.
Subject
Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-007-9082-1
Publisher site
See Article on Publisher Site

Abstract

Ann Math Artif Intell (2007) 50:417–418 DOI 10.1007/s10472-007-9082-1 ERRATUM Emad Saad · Enrico Pontelli Published online: 10 August 2007 © Springer Science + Business Media B.V. 2007 1. On page 219, item 4 of Definition 28 should be changed to h satisfies the ground h-program P = R,τ  iff h satisfies every h-rule in R and for every formula F ∈ bf ( B ), we have S L • If F = A is atomic then c {{μ| A : μ ← Body ∈ Rsuchthat h |= Body}} ≤ h( A). τ( A) t • If F = A ∗ ... ∗ A is not atomic then 1 ρ ρ n c {{(h( A ), ..., h( A )}} ≤ h( F ). ρ 1 n t 2. On page 223, the last item of Definition 34 should be changed to h satisfies P iff h satisfies every nh-rule in R and: • If A ∈ dom(h) is atomic, then we have c {{μ| A : μ ← Body ∈ Rand h |= Body}} ≤ h( A). τ( A) t The article was published in Annals of Mathematics and Artificial Intelligence 48, 187–243. The online version of

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Aug 10, 2007

There are no references for this article.