Probabilistic logic under coherence: complexity and algorithms

DOI10.1007/s10472-005-9005-yzbMath1083.03027OpenAlexW2044620906MaRDI QIDQ819942

Giuseppe Sanfilippo, Thomas Lukasiewicz, Angelo Gilio, Veronica Biazzo

Publication date: 4 April 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-9005-y

zbMATH Keywords

algorithmscomputational complexityconditional constraintconditional probability assessmentg-coherenceg-coherent entailmentlogical constraintmodel-theoretic probabilistic logicprobabilistic logic under coherence

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (29)

Coherence graphs ⋮ Transitive Reasoning with Imprecise Probabilities ⋮ Possibilistic and Probabilistic Logic under Coherence: Default Reasoning and System P ⋮ Transitivity in coherence-based probability logic ⋮ A logic with approximate conditional probabilities that can model default reasoning ⋮ Iterated conditionals and characterization of P-entailment ⋮ Expressive probabilistic description logics ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Probabilistic squares and hexagons of opposition under coherence ⋮ Probabilities of conditionals and previsions of iterated conditionals ⋮ Generalizing inference rules in a coherence-based probabilistic default reasoning ⋮ Generalized Bayesian inference in a fuzzy context: from theory to a virtual reality application ⋮ Probabilistic entailment in the setting of coherence: the role of quasi conjunction and inclusion relation ⋮ Algebraic aspects and coherence conditions for conjoined and disjoined conditionals ⋮ Conditional \(p\)-adic probability logic ⋮ Probabilistic inferences from conjoined to iterated conditionals ⋮ Weak nonmonotonic probabilistic logics ⋮ Quasi conjunction, quasi disjunction, t-norms and t-conorms: probabilistic aspects ⋮ Compound conditionals, Fréchet-Hoeffding bounds, and Frank \(t\)-norms ⋮ Envelopes of conditional probabilities extending a strategy and a prior probability ⋮ Compatibility, desirability, and the running intersection property ⋮ Algorithms for possibility assessments: coherence and extension ⋮ Probabilistic abduction without priors ⋮ Conditional random quantities and compounds of conditionals ⋮ Modeling agent's conditional preferences under objective ambiguity in Dempster-Shafer theory ⋮ Coherent T-conditional Possibility Envelopes and Nonmonotonic Reasoning ⋮ A Propositional CONEstrip Algorithm ⋮ Unnamed Item ⋮ Probabilistic satisfiability and coherence checking through integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing functions with parallel queries to NP
• Notes on conditional previsions
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Probabilistic satisfiability
• More complicated questions about maxima and minima, and some closures of NP
• On the consistency of defeasible databases
• A taxonomy of complexity classes of functions
• Anytime deduction for probabilistic logic
• Nonmonotonic reasoning, conditional objects and possibility theory
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Probabilistic reasoning under coherence in System P
• Probabilistic default reasoning with conditional constraints
• On the linear structure of betting criterion and the checking of coherence
• Stochastic independence in a coherent setting
• A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
• Coherence checking and propagation of lower probability bounds
• Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
• A logic for reasoning about probabilities
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• CHARACTERIZATION OF COHERENT CONDITIONAL PROBABILITIES AS A TOOL FOR THEIR ASSESSMENT AND EXTENSION
• Probabilistic logic programming with conditional constraints
• Column Generation Methods for Probabilistic Logic
• Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
• Programming with linear fractional functionals
• Conditional events in probability assessment and revision
• Coherent numerical and ordinal probabilistic assessments
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis

This page was built for publication: Probabilistic logic under coherence: complexity and algorithms