A plausible logic which detects loops

Unlike most non-monotonic logics Plausible Logic was designed from the very beginning with computer implementation in mind. But one aspect of implementation was neglected, namely loop detection. When using Plausible Logic choices must be made. Typically all choices are explored and then the best one is chosen. If one choice loops then this needs to be detected so that the other choices can be explored. The version of Plausible Logic defined in this paper is called Loop-detecting Plausible Logic (LPL), and it explicitly builds the detection of loops into the logic. This paper presents LPL, considers looping in a slightly more general context, shows that LPL is wellbehaved and that looping is unavoidable.

• Type: Conference
• Year: 2004
• Where: NMR
• Authors: David Billington
• Keywords: Artificial Intelligence, Logic, Logics Plausible Logic, NMR 2004, Plausible Logic