A logic for reasoning about probabilities

From MaRDI portal
Publication:1813497

DOI10.1016/0890-5401(90)90060-UzbMath0811.03014MaRDI QIDQ1813497

Joseph Y. Halpern, Nimrod Megiddo, Ronald Fagin

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)




Related Items

Probabilistic Common Knowledge Among Infinite Number of Agents, QUANTUM TEAM LOGIC AND BELL’S INEQUALITIES, Unnamed Item, Unnamed Item, Reasoning with Global Assumptions in Arithmetic Modal Logics, Reasoning About Degrees of Confirmation, Probabilistic concurrent constraint programming, Logical perspectives on the foundations of probability, Reasoning about knowledge and conditional probability, Quantifying over events in probability logic: an introduction, Counterfactuals as modal conditionals, and their probability, Elementary invariants for quantified probability logic, Qualitative reasoning in a two-layered framework, On counting propositional logic and Wagner's hierarchy, Probability logics for reasoning about quantum observations, Two-layered logics for paraconsistent probabilities, IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?, INTERLEAVING LOGIC AND COUNTING, Measure Logic, Unnamed Item, Unnamed Item, Unnamed Item, Probabilistic logic over equations and domain restrictions, QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS, Interpolative Boolean Logic, Why Bother with Syntax?, Quantitative Logic Reasoning, Logical Foundations of Evidential Reasoning with Contradictory Information, Intuitive Probability Logic, A Survey of First-Order Probabilistic Models, Using Histograms to Better Answer Queries to Probabilistic Logic Programs, Probabilistic Logic over Paths, Quantified beliefs and believed quantities, Probability logic for type spaces, Automatic derivation of probabilistic inference rules, Temporalization of Probabilistic Propositional Logic, Conditional Probability Logic over Conditional Probability Spaces, How to Predict Consistently?, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP, Qualitative Possibilities and Necessities, Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs, Unnamed Item, How to Restore Compactness into Probabilistic Logics?, AN OVERVIEW OF ROUGH SET SEMANTICS FOR MODAL AND QUANTIFIER LOGICS, A Roadmap to Decidability, Logics with Probability Operators, Probabilistic Temporal Logics, Some New Probability Operators, Applications of Logics About Simple Probabilities, Justification Logics with Probability Operators, Probabilistic logic under coherence: complexity and algorithms, A quantitative approach to belief revision in structured probabilistic argumentation, Anytime deduction for probabilistic logic, Direct algorithms for checking consistency and making inferences from conditional probability assessments, Reasoning about probabilistic sequential programs, Constraint tableaux for two-dimensional fuzzy logics, Probabilistic description logic programs under inheritance with overriding for the semantic Web, Specifying and reasoning about uncertain agents, A logic with approximate conditional probabilities that can model default reasoning, A probabilistic deontic logic, A logic and computation for Popper's conditional probabilities, The relationship between knowledge, belief, and certainty, A p-adic probability logic, Fundamental concepts of qualitative probabilistic networks, Graphical models for imprecise probabilities, Rational acceptance and conjunctive/disjunctive absorption, Subjective reasoning -- dynamic games, Expressive probabilistic description logics, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Probabilistic argumentation, \(p\)-adic probability logics, Models, coproducts and exchangeability: notes on states on Baire functions, A probabilistic logic between \(LPP_1\) and \(LPP_2\), NP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach, A probabilistic logic based on the acceptability of gambles, Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation, Logics with lower and upper probability operators, Collapsing probabilistic hierarchies. I, Super-Solutions, A propositional probabilistic logic with discrete linear time for reasoning about evidence, Multi-agent logics for reasoning about higher-order upper and lower probabilities, An Equation-Based Classical Logic, Probabilistic logics with independence and confirmation, An infinitary probability logic for type spaces, Rules of proof for maximal entropy inference, Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities, Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds, Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs, Sequent calculus for classical logic probabilized, Probability logic of finitely additive beliefs, Focused most probable world computations in probabilistic logic programs, Linking theories in probabilistic programming, A propositional dynamic logic with qualitative probabilities, SLAP: specification logic of actions with probability, Populational announcement logic (PPAL), Hierarchies of probabilistic logics, Conditional \(p\)-adic probability logic, Consistency checking and querying in probabilistic databases under integrity constraints, Complexity of fuzzy probability logics. II, Weak nonmonotonic probabilistic logics, Conditional belief types, Belief functions on distributive lattices, On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events, Logics of imprecise comparative probability, Query evaluation in probabilistic relational databases, Deciding Koopman's qualitative probability, Aggregating disparate estimates of chance, Generalized probabilistic satisfiability, Towards classifying propositional probabilistic logics, Inconsistency as qualified truth: a probability logic approach, Probabilization of logics: completeness and decidability, Achieving parametric uniformity for knowledge bases in a relational probabilistic conditional logic with maximum entropy semantics, Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm, Itemset frequency satisfiability: complexity and axiomatization, Quantification over propositional formulas in probability logic: decidability issues, Dealing with logical omniscience: expressiveness and pragmatics, The well-designed logical robot: learning and experience from observations to the Situation Calculus, Logics for reasoning about cryptographic constructions, Reasoning about rationality, A modal logic for mixed strategies, Weakly complete axiomatization of exogenous quantum propositional logic, Merging the local and global approaches to probabilistic satisfiability, The complexity of satisfiability in non-iterated and iterated probabilistic logics, Probabilistic unawareness, Completeness theorems for \(\sigma \)-additive probabilistic semantics, Automated non-monotonic reasoning in System \textbf{P}, Modal logic interpretation of Dempster-Shafer theory: An infinite case, An epistemic probabilistic logic with conditional probabilities, A probabilistic approach to navigation in Hypertext, Reasoning about knowledge of unawareness, A dynamic epistemic framework for reasoning about conformant probabilistic plans, The logic of qualitative probability, A probabilistic semantics for belief logic, The theory of interval probabilistic logic programs, The probability nesting game, Some first-order probability logics, Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding, Complexity results for structure-based causality., Axiomatization of frequent itemsets, Knowledge, awareness and probabilistic beliefs, Probabilistic satisfiability and coherence checking through integer programming, A semantical framework for supporting subjective and conditional probabilities in deductive databases, Exogenous Probabilistic Computation Tree Logic, Logics for reasoning about processes of thinking with information coded by \(p\)-adic numbers, Probabilistic satisfiability with imprecise probabilities, A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments, Characterizing the common prior assumption., A simple logic for reasoning about incomplete knowledge, Combining probabilistic logic programming with the power of maximum entropy, On measure quantifiers in first-order arithmetic



Cites Work