%0 Journal Article %1 Wu2004 %A Wu, Guofu %A Coghill, George M. %D 2004 %J Proceedings of the 15th International Workshop on Principles of Diagnosis %K kiwi, tms %T A Propositional Root Antecedent ITMS %X Truth Maintenance Systems (TMSs) are im- portant tools for caching beliefs and inferences that support search and explanation tasks of general problem solvers. For embedded real-time systems, fast response from the TMSs is especially required. To achieve this, Nayak and Williams 9 presented an Incremental Truth Maintenance System (ITMS) based on depth-first numbering to avoid spending a signif- icant percentage of time on calculating labels that remain constant between contexts. However, the goal of incremental context switching is downgraded by the approximate method they chose, because it may miss qualified propositions or even choose the unqualified for resupport; it may also bring the propagation to stop unintentionally. The algorithm based on root antecedents shown in this paper serves exactly the same purpose, while it avoids the problems encountered in Nayak and Williams’ ITMS by adopting a mechanism based on propositional root antecedents that allows constant con- clusions to be identified precisely.

@article{Wu2004, abstract = {Truth Maintenance Systems (TMSs) are im- portant tools for caching beliefs and inferences that support search and explanation tasks of general problem solvers. For embedded real-time systems, fast response from the TMSs is especially required. To achieve this, Nayak and Williams [9] presented an Incremental Truth Maintenance System (ITMS) based on depth-first numbering to avoid spending a signif- icant percentage of time on calculating labels that remain constant between contexts. However, the goal of incremental context switching is downgraded by the approximate method they chose, because it may miss qualified propositions or even choose the unqualified for resupport; it may also bring the propagation to stop unintentionally. The algorithm based on root antecedents shown in this paper serves exactly the same purpose, while it avoids the problems encountered in Nayak and Williams’ ITMS by adopting a mechanism based on propositional root antecedents that allows constant con- clusions to be identified precisely.}, added-at = {2008-11-14T13:33:38.000+0100}, author = {Wu, Guofu and Coghill, George M.}, biburl = {https://www.bibsonomy.org/bibtex/2222af03f5022524359f2ceb949a0449e/fraktalek}, citeulike-article-id = {3508939}, interhash = {6979053cd47cce60a621739b76558dcd}, intrahash = {222af03f5022524359f2ceb949a0449e}, journal = {Proceedings of the 15th International Workshop on Principles of Diagnosis}, keywords = {kiwi, tms}, posted-at = {2008-11-13 14:14:02}, priority = {0}, timestamp = {2008-11-14T13:33:38.000+0100}, title = {A Propositional Root Antecedent ITMS}, year = 2004 }