1. Darwiche, A.: On the tractability of counting theory models and its application to belief revision and truth maintenance. J. Appl. Non-Class. Logics 11(1–2), 11–34 (2011)
2. Lecture Notes in Computer Science;O Angelsmark,2003
3. Distingished Dissertations;B Russ,2001
4. Zmazek, B.: Estimating the traffic on weighted cactus networks in linear time. In: 9th International Conference on Information Visualization, pp. 536–541 (2005)
5. Roth, D.: On the hardness of approximate reasoning. J. Artif. Intell. 82, 273–302 (1996)