Pages that link to "Item:Q757340"

The following pages link to An analysis of first-order logics of probability (Q757340):

Displaying 50 items.

• A sequent calculus for urn logic (Q302242) (← links)
• A logical theory of localization (Q310092) (← links)
• Collapsing probabilistic hierarchies. I (Q384407) (← links)
• Reasoning defeasibly about probabilities (Q411577) (← links)
• Reference classes and relational learning (Q432965) (← links)
• Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
• Completion-based generalization inferences for the description logic \(\mathcal{ELOR}\) with subjective probabilities (Q465595) (← links)
• An overview of algorithmic approaches to compute optimum entropy distributions in the expert system shell MECore (extended version) (Q507545) (← links)
• The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
• Possibilistic logic: a retrospective and prospective view (Q598572) (← links)
• Query evaluation in probabilistic relational databases (Q673389) (← links)
• Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
• Probabilistic modelling, inference and learning using logical theories (Q841641) (← links)
• Improving expressivity of inductive logic programming by learning different kinds of fuzzy rules (Q882801) (← links)
• Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation (Q899162) (← links)
• Robot location estimation in the situation calculus (Q901076) (← links)
• A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics (Q901077) (← links)
• A continuum-valued logic of degrees of probability (Q907883) (← links)
• Learning probabilistic logic models from probabilistic examples (Q1009281) (← links)
• In conjunction with qualitative probability (Q1295377) (← links)
• Formal frameworks for approximate reasoning (Q1311748) (← links)
• Decidability and expressiveness for first-order logics of probability (Q1327387) (← links)
• Anytime deduction for probabilistic logic (Q1337678) (← links)
• Inferences in probability logic (Q1342214) (← links)
• A natural prior probability distribution derived from the propositional calculus (Q1344630) (← links)
• The independent choice logic for modelling multiple agents under uncertainty (Q1391346) (← links)
• Dynamic reasoning with qualified syllogisms (Q1402719) (← links)
• The emergence of reasons conjecture. (Q1427348) (← links)
• Some first-order probability logics (Q1583250) (← links)
• Probabilities for two properties (Q1595321) (← links)
• Tableau reasoning for description logics and its extension to probabilities (Q1653448) (← links)
• Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
• PR-OWL - a language for defining probabilistic ontologies (Q1679648) (← links)
• Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems (Q1711885) (← links)
• Probabilistic generalization of formal concepts (Q1758720) (← links)
• Paraconsistent informational logic (Q1775866) (← links)
• Structured probabilistic inference (Q1951286) (← links)
• Model-based exception mining for object-relational data (Q1987183) (← links)
• Speeding up parameter and rule learning for acyclic probabilistic logic programs (Q1999576) (← links)
• Multi-agent logics for reasoning about higher-order upper and lower probabilities (Q2183579) (← links)
• Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
• Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination (Q2215958) (← links)
• A quantified coalgebraic van Benthem theorem (Q2233433) (← links)
• Logics of imprecise comparative probability (Q2237162) (← links)
• Towards classifying propositional probabilistic logics (Q2250552) (← links)
• Modelling relational statistics with Bayes nets (Q2251452) (← links)
• A general approach to reasoning with probabilities (Q2283285) (← links)
• Probabilistic sentence satisfiability: an approach to PSAT (Q2287193) (← links)
• Completeness theorems for \(\sigma \)-additive probabilistic semantics (Q2291370) (← links)
• On the relative expressiveness of Bayesian and neural networks (Q2302782) (← links)