Pages that link to "Item:Q814608"
From MaRDI portal
The following pages link to Combining probabilistic logic programming with the power of maximum entropy (Q814608):
Displaying 23 items.
- Inconsistency measures for probabilistic logics (Q360045) (← links)
- Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
- Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction (Q454147) (← links)
- An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version) (Q507545) (← links)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
- A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics (Q901077) (← links)
- Probabilistic description logic programs (Q997050) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Towards the entropy-limit conjecture (Q2216027) (← links)
- Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics (Q2254631) (← links)
- A polynomial-time fragment of epistemic probabilistic argumentation (Q2302822) (← links)
- Optimizing group learning: an evolutionary computing approach (Q2321327) (← links)
- Probabilistic description logic programs under inheritance with overriding for the semantic Web (Q2379312) (← links)
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds (Q2426104) (← links)
- Weak nonmonotonic probabilistic logics (Q2457653) (← links)
- Semantics for Possibilistic Disjunctive Programs (Q2845121) (← links)
- How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic (Q2915071) (← links)
- Relational Probabilistic Conditional Reasoning at Maximum Entropy (Q3011965) (← links)
- Towards Lifted Inference Under Maximum Entropy for Probabilistic Relational FO-PCL Knowledge Bases (Q3451211) (← links)
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability (Q3534675) (← links)
- Using Histograms to Better Answer Queries to Probabilistic Logic Programs (Q4649723) (← links)
- Objective Bayesian Nets for Integrating Consistent Datasets (Q5094018) (← links)
- Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy (Q5268422) (← links)