How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic

DOI10.1007/978-3-642-33353-8_15zbMath1361.68226OpenAlexW185452875MaRDI QIDQ2915071

Christoph Beierle, Marc Finthammer

Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_15

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Probability and inductive logic (03B48)

Related Items (2)

Towards Lifted Inference Under Maximum Entropy for Probabilistic Relational FO-PCL Knowledge Bases ⋮ Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics

Uses Software

• KReator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining probabilistic logic programming with the power of maximum entropy
• Characterizing the principle of minimum cross-entropy within a conditional-logical framework
• On first-order conditional logics
• First-order probabilistic conditional logic and maximum entropy
• An integrated development environment for probabilistic relational reasoning
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The Uncertain Reasoner's Companion
• Generalized Iterative Scaling for Log-Linear Models
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents

This page was built for publication: How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic