DocumentCode
1593199
Title
A partitioned ATMS
Author
D´Ambrosio, Bruce ; Edwards, James
Author_Institution
Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
fYear
1991
Firstpage
330
Lastpage
336
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
Keywords
knowledge based systems; problem solving; assumption-based truth maintenance system; completeness; decomposition; efficiency gains; hierarchically related set; label consistency; large-scale problem solving; minimality; node labels; partitioned ATMS; problem tractability; soundness; subproblems; Computer science; Digital circuits; Problem-solving; Size measurement; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence Applications, 1991. Proceedings., Seventh IEEE Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-2135-4
Type
conf
DOI
10.1109/CAIA.1991.120889
Filename
120889
Link To Document