Abstract
Truth maintenance systems (TMSs) offer the most elaborate approach to the belief revision problem and are thus ideal candidates for automating belief revision during the course of plausibility-driven design evolution. However, the theory of plausible design (TPD) necessitates multivalued belief propagation while conventional TMSs are two-valued (IN/OUT) systems. Due to this mismatch, the encoding of constraint dependency graphs (CDGs) in conventional TMSs requires an exponential number of justifications. A belief revision system for TPD called the theory of plausible design belief revision system (TPD-BRS) is proposed. TPD-BRS uses a modified version of the assumption-based TMS label propagation algorithm in conjunction with a label interpreter to support automated belief revision in TPD efficiently.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
