a Procedural Problem Solving Language, R. Kling, U.W.-Madison--All contemporary deductive problem solving paradigms deal with a world in which assertions are true (false) and action rules are valid (invalid). This simplified situation is inadequate for realistic applieations which inelude uncertain or inexact information. This talk describes a precise computationally specific method for coupling a particular manyvalued logic with a procedural problem solving system (PLANNER). Solutions to deductive problems can be found which meet specific criteria of reliability. This particular scheme enables the system to dynamically compute the truthvalue of a subgoal during the search process. Thus, the reliability of a subgoal may be used to direct the heuristic search process.
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=1125143.