Explaining by evidence
From MaRDI portal
Publication:4779486
Recommendations
- Explaining evidential analyses
- Reasoning about evidence
- Understanding evidential reasoning
- Explaining the most probable explanation
- scientific article; zbMATH DE number 1508253
- scientific article; zbMATH DE number 269851
- Evidence, explanation and enhanced indispensability
- A logic for reasoning about evidence
Cites work
- scientific article; zbMATH DE number 4152345 (Why is no real title available?)
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 67860 (Why is no real title available?)
- scientific article; zbMATH DE number 3511413 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Mathematical Theory of Communication
- A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
- A logic for default reasoning
- A simple test improves checking satisfiability
- A theory of diagnosis from first principles
- Algorithms for testing the satisfiability of propositional formulae
- An algorithm for region filling using two-dimensional grammars
- Approximate inclusion-exclusion
- Average time analyses of simplified Davis-Putnam procedures
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Circumscription - a form of non-monotonic reasoning
- Cost-based abduction and MAP explanation
- Counting propositional models
- Counting the number of solutions for instances of satisfiability
- Diagnosing multiple faults
- Explanatory diagnoses and their characterization by circumscription
- Further contributions to characterizing diagnosis
- Information Theory and Statistical Mechanics
- Information and evidence in logic systems
- Is there an alternative to parsimonious semantics?
- Knowledge in flux. Modeling the dynamics of epistemic states
- Number of models and satisfiability of sets of clauses
- Planning for conjunctive goals
- Probabilistic logic
- The Pure Literal Rule and Polynomial Average Time
- The complexity of computing the permanent
- Upper and Lower Probabilities Induced by a Multivalued Mapping
Cited in
(3)
This page was built for publication: Explaining by evidence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779486)