Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!nike!ucbcad!ucbvax!CIP.UCI.EDU!drose
From: drose@CIP.UCI.EDU (Don Rose)
Newsgroups: mod.ai
Subject: TMS, DDB and infinite loops
Message-ID: <8609171756.AA13313@ucbvax.Berkeley.EDU>
Date: Wed, 17-Sep-86 13:57:52 EDT
Article-I.D.: ucbvax.8609171756.AA13313
Posted: Wed Sep 17 13:57:52 1986
Date-Received: Fri, 19-Sep-86 22:09:02 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 8
Approved: ailist@sri-stripe.arpa

Does anyone know whether the standard algorithms for belief revision
(e.g. dependency-directed backtracking in TMS-like systems) are
guaranteed to halt? That is, is it possible for certain belief networks
to be arranged such that no set of mutually consistent beliefs can be found
(without outside influence)? --Donald Rose
                               drose@ics.uci.edu
                               ICS Dept
                               Irvine CA 92717