Home /Research /Plausible inference: A multi-valued logic for problem solving
LEARNING

Plausible inference: A multi-valued logic for problem solving

Leonard Friedman

Year
1979
Citations
7
Access
Open access

Abstract

A new logic is developed which permits continuously variable strength of belief in the truth of assertions. Four inference rules result, with formal logic as a limiting case. Quantification of belief is defined. Propagation of belief to linked assertions results from dependency-based techniques of truth maintenance so that local consistency is achieved or contradiction discovered in problem solving. Rules for combining, confirming, or disconfirming beliefs are given, and several heuristics are suggested that apply to revising already formed beliefs in the light of new evidence. The strength of belief that results in such revisions based on conflicting evidence are a highly subjective phenomenon. Certain quantification rules appear to reflect an orderliness in the subjectivity. Several examples of reasoning by plausible inference are given, including a legal example and one from robot learning. Propagation of belief takes place in directions forbidden in formal logic and this results in conclusions becoming possible for a given set of assertions that are not reachable by formal logic.

Keywords

InferenceNon-monotonic logicArtificial intelligenceComputer scienceBelief revisionConsistency (knowledge bases)HeuristicsProbabilistic logic networkContradictionPredicate logic

Related papers

Browse all LEARNING papers