Anytime deduction for probabilistic logic
From MaRDI portal
The authors present a set of inference rules that in any reasoning on probabilistic logic (in the sense of Nilsson) based on conditional probabilities will yield the tightest interval of confidence given the information processed up to that point, under the proposed rules. In contrast to Nilsson's approach, all arguments are based directly on these rules, no systems of linear equations are solved. The rules are based on the familiar ways of assigning intervals in probabilistic logic; however, no consistency proof is offered.
Recommendations
Cites work
- A logic for reasoning about probabilities
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- An analysis of first-order logics of probability
- Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
- scientific article; zbMATH DE number 4176499 (Why is no real title available?)
- scientific article; zbMATH DE number 3984614 (Why is no real title available?)
- scientific article; zbMATH DE number 4079381 (Why is no real title available?)
- scientific article; zbMATH DE number 41270 (Why is no real title available?)
- Incidence calculus: A mechanism for probabilistic reasoning
- On the uncertainties transmitted from premises to conclusions in deductive inferences
- Probabilistic logic
- Probabilistic logic revisited
- Variable precision logic
Cited in
(50)- Probabilistic semantics for Delgrande's conditional logic and a counterexample to his default logic
- Fuzzy functional dependencies and Bayesian networks
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Sequent calculus for classical logic probabilized
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- A logic for reasoning about probabilities
- Axiomatization of frequent itemsets
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- On the complexity of inference about probabilistic relational models
- An epistemic probabilistic logic with conditional probabilities
- A probabilistic deontic logic
- Multi-agent logics for reasoning about higher-order upper and lower probabilities
- Merging the local and global approaches to probabilistic satisfiability
- Probabilistic satisfiability and coherence checking through integer programming
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Graphical models for imprecise probabilities
- Expressive probabilistic description logics
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
- Logics with lower and upper probability operators
- Weak nonmonotonic probabilistic logics
- The complexity of satisfying constraints on databases of transactions
- Itemset frequency satisfiability: complexity and axiomatization
- Non-monotonic reasoning from an evolution-theoretic perspective: Ontic, logical and cognitive foundations
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
- Probabilistic logic revisited
- Weighted Deductive Parsing and Knuth's Algorithm
- A Survey of First-Order Probabilistic Models
- Inconsistency measures for probabilistic logics
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
- PROBLEM SOLVING WITH INSUFFICIENT RESOURCES
- Logics with Probability Operators
- Probabilized Sequent Calculus and Natural Deduction System for Classical Logic
- Reasoning About Degrees of Confirmation
- Inference in conditional probability logic
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- Automatic derivation of probabilistic inference rules
- Reasoning about knowledge and conditional probability
- Generalizing probabilistic material implication and Bayesian conditionals
- Syntactic reasoning with conditional probabilities in deductive argumentation
- A logic with probabilistic Jaccard similarity
- Probability and natural deduction
- A novel similarity measure between classical propositions and its applications
- Combining probabilistic logic programming with the power of maximum entropy
- Probabilistic logic under coherence: complexity and algorithms
- A probabilistic logic based on the acceptability of gambles
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- An anytime deduction algorithm for the probabilistic logic and entailment problems
This page was built for publication: Anytime deduction for probabilistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337678)
