Studia Logica 70 (1):131 - 156 (2002)
|Abstract||While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain a better understanding of the empirical efficiency of the algorithms involved, a fault diagnosis problem on combinational circuits is presented, implemented and evaluated.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Sven Ove Hansson & Renata Wassermann (2002). Local Change. Studia Logica 70 (1):49 - 76.
SvenOve Hansson (2000). Coherentist Contraction. Journal of Philosophical Logic 29 (3):315-330.
Ingvar Johansson (1998). Hume's Surprise and the Logic of Belief Changes. Synthese 117 (2):275-291.
Anthony S. Gillies (2006). What Might Be the Case After a Change in View. Journal of Philosophical Logic 35 (2):117 - 145.
Marcelo A. Falappa, Gabriele Kern-Isberner, Maurício D. L. Reis & Guillermo R. Simari (2012). Prioritized and Non-Prioritized Multiple Change on Belief Bases. Journal of Philosophical Logic 41 (1):77-113.
James P. Delgrande, Abhaya C. Nayak & Maurice Pagnucco (2005). Gricean Belief Change. Studia Logica 79 (1):97 - 113.
John Cantwell (1999). Some Logics of Iterated Belief Change. Studia Logica 63 (1):49-84.
Dongmo Zhang & Norman Foo (2001). Infinitary Belief Revision. Journal of Philosophical Logic 30 (6):525-570.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,602 of 549,013 )
Recent downloads (6 months)0
How can I increase my downloads?