Anytime deduction for probabilistic logic
From MaRDI portal
Publication:1337678
DOI10.1016/0004-3702(94)90079-5zbMATH Open0809.03016OpenAlexW1999924358MaRDI QIDQ1337678
Publication date: 8 November 1994
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90079-5
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic logic
- A logic for reasoning about probabilities
- An analysis of first-order logics of probability
- On the uncertainties transmitted from premises to conclusions in deductive inferences
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- Variable precision logic
- Probabilistic logic revisited
- Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
- Incidence calculus: A mechanism for probabilistic reasoning
Cited In (46)
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- Probabilistic logic revisited
- Probabilistic semantics for Delgrande's conditional logic and a counterexample to his default logic
- Inconsistency measures for probabilistic logics
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Axiomatization of frequent itemsets
- Non-monotonic reasoning from an evolution-theoretic perspective: Ontic, logical and cognitive foundations
- Graphical models for imprecise probabilities
- On the complexity of inference about probabilistic relational models
- Multi-agent logics for reasoning about higher-order upper and lower probabilities
- Reasoning about knowledge and conditional probability
- Title not available (Why is that?)
- Weighted Deductive Parsing and Knuth's Algorithm
- Probabilized Sequent Calculus and Natural Deduction System for Classical Logic
- The complexity of satisfying constraints on databases of transactions
- Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
- Automatic derivation of probabilistic inference rules
- A probabilistic deontic logic
- Generalizing probabilistic material implication and Bayesian conditionals
- Fuzzy functional dependencies and Bayesian networks
- PROBLEM SOLVING WITH INSUFFICIENT RESOURCES
- Merging the local and global approaches to probabilistic satisfiability
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Logics with Probability Operators
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- Itemset frequency satisfiability: complexity and axiomatization
- Reasoning About Degrees of Confirmation
- A logic for reasoning about probabilities
- A probabilistic logic based on the acceptability of gambles
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Expressive probabilistic description logics
- A Survey of First-Order Probabilistic Models
- Logics with lower and upper probability operators
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
- Weak nonmonotonic probabilistic logics
- An epistemic probabilistic logic with conditional probabilities
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
- Syntactic reasoning with conditional probabilities in deductive argumentation
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Combining probabilistic logic programming with the power of maximum entropy
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Probabilistic logic under coherence: complexity and algorithms
- Sequent calculus for classical logic probabilized
- Probabilistic satisfiability and coherence checking through integer programming
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)
