Possible worlds semantics for probabilistic logic programs
From MaRDI portal
Recommendations
Cited in
(20)- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- The theory of interval probabilistic logic programs
- On the representation and querying of sets of possible worlds
- Probabilistic logic programming
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- A logic with imprecise probabilities and an application to automated reasoning using rewriting techniques
- The distribution semantics for normal programs with function symbols
- A Logical Approach to Qualitative and Quantitative Reasoning
- Focused most probable world computations in probabilistic logic programs
- Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
- Who shaves the barber, and with what probability?
- Using histograms to better answer queries to probabilistic logic programs
- Probabilistic finite domains: A brief overview
- Negative probabilities in probabilistic logic programs
- Imprecise probabilistic Horn clause logic
- Logic programs with annotated disjunctions
- Logic Programming and Nonmonotonic Reasoning
- Semantics for Possibilistic Disjunctive Programs
- A fibrational framework for possible-world semantics of \textsc{Algol}-like languages
This page was built for publication: Possible worlds semantics for probabilistic logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313179)
