Abstract

Describes an extension to deKleer's (1986) assumption-based truth maintenance system (ATMS) that shows promise in making large-scale problem solving more tractable. The approach assumes a problem can be decomposed into a hierarchically related set of subproblems, each of which is represented within its own ATMS partition. It is shown how this decomposition can be used to circumvent the exponential growth in the size of node labels which often occurs in attempting to apply the ATMS. The authors present some experimental results showing efficiency gains, and discuss the impact of partitioning on label consistency, soundness, minimality, and completeness. >

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.