Access the full text.
Sign up today, get DeepDyve free for 14 days.
G Kern-Isberner, T Lukasiewicz (2004)
Combining probabilistic logic programming with the power of maximum entropyArtif. Intell., Special Issue on Nonmonotonic Reasoning, 157
J Paris, A Vencovska (1997)
In defence of the maximum entropy inference processInt. J. Approx. Reason., 17
B Milch, L Zettlemoyer, K Kersting, M Haimes, LP Kaelbling (2008)
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008
EW Adams (1975)
The Logic of Conditionals
JP Delgrande (1998)
On first-order conditional logicsArtif. Intell., 105
G Kern-Isberner (1998)
Characterizing the principle of minimum cross-entropy within a conditional-logical frameworkArtif. Intell., 98
R Fagin, JY Halpern (1994)
Reasoning about knowledge and probabilityJ. ACM, 41
J Fisseler (2012)
First-order probabilistic conditional logic and maximum entropyIGPL, 20
M Finthammer, C Beierle (2012)
KI 2012: Advances in Artificial Intelligence, Proceedings on the 35th Annual German Conference on AI, LNAI, vol. 7526
W Rödder, G Kern-Isberner (1996)
Representation and extraction of information by probabilistic logicInformation Systems, 21
R Fagin, JY Halpern, N Megiddo (1990)
A logic for reasoning about probabilitiesInf. Comput., 87
JN Darroch, D Ratcliff (1972)
Generalized iterative scaling for log-linear modelsAnn. Math. Stat., 43
S Geman, D Geman (1984)
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of imagesIEEE Trans. Pattern Anal. Mach. Intell., 6
When extending probabilistic logic to a relational setting, it is desirable to still be able to use efficient computation mechanisms developed for the propositional case. In this paper, we investigate the relational probabilistic conditional logic FO-PCL whose semantics employs the principle of maximum entropy. While in general, this semantics is defined via the ground instances of the rules in an FO-PCL knowledge base ${\cal R}$ , the maximum entropy model can be computed on the level of rules rather than on the level of instances of the rules if ${\cal R}$ is parametrically uniform. We elaborate in detail the reasons that cause ${\cal R}$ to be not parametrically uniform. Based on this investigation, we derive a new syntactic criterion for parametric uniformity and develop an algorithm that transforms any FO-PCL knowledge base ${\cal R}$ into an equivalent knowledge base ${\cal R}^{\prime}$ that is parametrically uniform. This provides a basis for a simplified maximum entropy model computation since for this computation, ${\cal R}^{\prime}$ can be used instead of ${\cal R}$ .
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jul 20, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.