Combining probabilistic logic programming with the power of maximum entropy

DOI10.1016/j.artint.2004.04.003zbMath1085.68170OpenAlexW2120853830MaRDI QIDQ814608

Gabriele Kern-Isberner, Thomas Lukasiewicz

Publication date: 7 February 2006

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

Full work available at URL: https://doi.org/10.1016/j.artint.2004.04.003

zbMATH Keywords

AlgorithmsNonmonotonic reasoningProbabilistic reasoningConditional constraintMaximum entropyProbabilistic logic programming

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items (23)

Towards Lifted Inference Under Maximum Entropy for Probabilistic Relational FO-PCL Knowledge Bases ⋮ Probabilistic description logic programs under inheritance with overriding for the semantic Web ⋮ How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic ⋮ Inconsistency measures for probabilistic logics ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds ⋮ A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics ⋮ Focused most probable world computations in probabilistic logic programs ⋮ Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction ⋮ Towards the entropy-limit conjecture ⋮ On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability ⋮ Weak nonmonotonic probabilistic logics ⋮ An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version) ⋮ Relational Probabilistic Conditional Reasoning at Maximum Entropy ⋮ Using Histograms to Better Answer Queries to Probabilistic Logic Programs ⋮ Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics ⋮ Probabilistic description logic programs ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Optimizing group learning: an evolutionary computing approach ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Answering queries from context-sensitive probabilistic knowledge bases
• Representation and extraction of information by probabilistic logic
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• An analysis of first-order logics of probability
• A note on the inevitability of maximum entropy
• Probabilistic logic
• Characterizing the principle of minimum cross-entropy within a conditional-logical framework
• Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
• Nonmonotonic reasoning, preferential models and cumulative logics
• What does a conditional knowledge base entail?
• Probabilistic logic programming
• The logical foundations of statistical inference
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Probabilistic Horn abduction and Bayesian networks
• Anytime deduction for probabilistic logic
• A linear programming approach to reasoning about probabilities
• SPIRIT and Léa Sombé: A study in probabilistic reasoning
• Belief functions and default reasoning
• A formal analysis of relevance
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Probabilistic default reasoning with conditional constraints
• The possibilistic handling of irrelevance in exception-tolerant reasoning
• Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
• In defense of the maximum entropy inference process
• A logic for reasoning about probabilities
• A note on conditional logics and entropy
• On the complexity of inference about probabilistic relational models
• Qualitative probabilities for default reasoning, belief revision, and causal modeling
• Concerning measures in first order calculi
• From statistical knowledge bases to degrees of belief
• Comments on and correction to "Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy" (Jan 80 26-37) [Corresp.]
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Properties of cross-entropy minimization
• Column Generation Methods for Probabilistic Logic
• The Uncertain Reasoner's Companion
• From information to probability: An axiomatic approach-Inference is information processing
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Hybrid probabilistic programs
• Programming with linear fractional functionals
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents

This page was built for publication: Combining probabilistic logic programming with the power of maximum entropy