Combining probabilistic logic programming with the power of maximum entropy
From MaRDI portal
(Redirected from Publication:814608)
Recommendations
Cites work
- scientific article; zbMATH DE number 1594541 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1251883 (Why is no real title available?)
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1149433 (Why is no real title available?)
- scientific article; zbMATH DE number 1531962 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 3321248 (Why is no real title available?)
- scientific article; zbMATH DE number 3058269 (Why is no real title available?)
- scientific article; zbMATH DE number 3060434 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- A formal analysis of relevance
- A linear programming approach to reasoning about probabilities
- A logic for reasoning about probabilities
- A note on conditional logics and entropy
- A note on the inevitability of maximum entropy
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- An analysis of first-order logics of probability
- Answering queries from context-sensitive probabilistic knowledge bases
- Anytime deduction for probabilistic logic
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Belief functions and default reasoning
- Characterizing the principle of minimum cross-entropy within a conditional-logical framework
- Column Generation Methods for Probabilistic Logic
- 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.]
- Concerning measures in first order calculi
- Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- From information to probability: An axiomatic approach-Inference is information processing
- From statistical knowledge bases to degrees of belief
- Hybrid probabilistic programs
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- In defense of the maximum entropy inference process
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the complexity of inference about probabilistic relational models
- Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
- Probabilistic Horn abduction and Bayesian networks
- Probabilistic argumentation systems
- Probabilistic default reasoning with conditional constraints
- Probabilistic logic
- Probabilistic logic programming
- Programming with linear fractional functionals
- Properties of cross-entropy minimization
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- Representation and extraction of information by probabilistic logic
- SPIRIT and Léa Sombé: A study in probabilistic reasoning
- The Uncertain Reasoner's Companion
- The logical foundations of statistical inference
- The possibilistic handling of irrelevance in exception-tolerant reasoning
- What does a conditional knowledge base entail?
Cited in
(25)- A polynomial-time fragment of epistemic probabilistic argumentation
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- scientific article; zbMATH DE number 2063231 (Why is no real title available?)
- Relational probabilistic conditional reasoning at maximum entropy
- Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
- A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics
- Inconsistency measures for probabilistic logics
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
- Probabilistic description logic programs
- Towards lifted inference under maximum entropy for probabilistic relational FO-PCL knowledge bases
- Towards the entropy-limit conjecture
- Semantics for possibilistic disjunctive programs
- Weak nonmonotonic probabilistic logics
- How to exploit parametric uniformity for maximum entropy reasoning in a relational probabilistic logic
- Using histograms to better answer queries to probabilistic logic programs
- An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version)
- Objective Bayesian Nets for Integrating Consistent Datasets
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory
- Focused most probable world computations in probabilistic logic programs
- Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
- Optimizing group learning: an evolutionary computing approach
This page was built for publication: Combining probabilistic logic programming with the power of maximum entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814608)
