Decomposable negation normal form

Journal of the ACM

Volumn 48, Issue 4, 2001, Pages 608-647

  Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Boolean functions; Knowledge compilation; Model based diagnosis; Prepositional logic; Satisfiability

Indexed keywords

COMPILATION LANGUAGE; DECOMPOSITION NEGATION NORMAL FORM (DNNF); KNOWLEDGE COMPILATION; MODEL-BASED DIAGNOSIS; PROPOSITIONAL LOGIC; SATISFIABILITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; FORMAL LOGIC; FUNCTION EVALUATION; LARGE SCALE SYSTEMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

FORMAL LANGUAGES;

EID: 2942697066     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/502090.502091     Document Type: Article

References (42)

1. ARNBORG, S. 1985. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT 25, 2-33.
2. ARNBORG, S., CORNEIL, D., AND PROSKUROWSKI, A. 1987. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Dis. Meth. 8, 277-284.
3. ARNBORG, S., AND PROSKUROWSKI, A. 1985. Characterization and recognition of partial k-trees. Congr. Numer. 47, 69-75.
4. BARWISE, J., Ed. 1977. Handbook of Mathematical Logic. North-Holland, Amsterdam, The Netherlands.
5. BEGLEZ, F., AND FUJIWARA, H. 1985. A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN. In Proceedings of the IEEE symposium on Circuits and Systems. http://www.cbl.ncsu.edu/www/CBL.Docs/ iscas85.html.
6. BERN, J., GEROOV, J., MEINEL, C., AND SLOBODOVA, A. 1994. Boolean manipulation with free bdds: first experimental results. In Proceedings of European Design Automation Conference (EDAC'94). (Paris, France). IEEE Computer Society Press, Los Alamitos, Calif., pp. 200-207.
7. BODLAENDER, H. L. 1993. A tourist guide through treewidth. ACTA CYBERNETICA 11, 1-2, 1-22.
8. BODLAENDER, H. L. 1996. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305-1317.
9. BOLLING, B., AND WEGENER, I. 1998. A very simple function that requires exponential size read-once branching programs. Inf. Proc. Lett. 66, 2, 53-57.
10. BOUFKHAD, Y., GREGOIRE, E., MARQUIS, P., MAZURE, B., AND SAIS, L. 1997. Tractable cover compilations. In Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI). Morgan-Kaufmann, San Francisco, Calif., pp. 122-127.
11. BRYANT, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 677-691.
12. BRYANT, R. E. 1991. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40, 205-213.
13. BRYANT, R. E. 1992. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv. 24, 3, 293-318.
14. CADOLI, M., AND DONINI, F. M. 1997. A survey on knowledge compilation. AI Commun. 10, 137-150.
15. DARWICHE, A. 1992. A Symbolic Generalization of Probability Theory. Ph.D. Dissertation, Stanford Univ., Stanford, Calif.
16. DARWICHE, A. 1998a. Compiling devices: A structure-based approach. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR98). Morgan-Kaufmann, San Francisco, Calif., pp. 156-166.
17. DARWICHE, A. 1998b. Model-based diagnosis using structured system descriptions. J. Art. Intell. Res. 8, 165-222.
18. DARWICHE, A. 1999. Compiling knowledge into decomposable negation normal form. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). Morgan-Kaufmann, San Francisco, Calif., pp. 284-289.
19. DARWICHE, A. 2000a. Model-based diagnosis under real-world constraints. AI Mag. 21, 2, 57-73.
20. DARWICHE, A. 2000b. On the tractable counting of theory models and its application to belief revision and truth maintenance. Appl. Non-Classi. Logi, 11, 1-2.
21. DARWICHE, A. 2001. Recursive conditioning. Artif. Intell. 126, 1-2, 5-41.
22. DARWICHE, A., AND GINSBERG, M. L. 1992. A symbolic generalization of probability theory. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park, Calif., pp. 622-627.
23. DE KLEER, J. 1990. Compiling devices and processes. Presented at 4th International Workshop on Qualitative Physics, Lugano, Switzerland.
24. DE KLEER, J., MACKWORTH, A. K., AND REITER, R. 1992. Characterizing diagnoses and systems. Artif. Intell. 56, 2-3, 197-222.
25. DE KLEER, J., AND WILLIAMS, B. C. 1987. Diagnosing multiple faults. Artif. Intell. J. 32, 97-130.
26. DECHTER, R. 1992. Constraint networks. In Encyclopedia of Artificial Intelligence, S. Shapiro, Ed., Wiley, New York, pp. 276-285.
27. DECHTER, R., AND RISK, I. 1994. Directional resolution: The Davis-Putnam procedure, revisited. In Proceedings of the International Conference on Principles of Knowledge Representation and reasoning (KR94). Morgan-Kaufmann, San Mateo, Calif., pp. 134-145.
28. DEL VAL, A. 1994. Tractable databases: How to make prepositional unit resolution complete through compilation. In Proceedings of the International Conference on Principles of Knowledge Representation and reasoning (KR94). Morgan-Kaufmann, San Mateo, Calif., pp. 551-561.
29. DEL VAL, A. 2000. On some tractable classes in deduction and abduction. Artif. Intel. 116, 297-313.
30. EL FATTAH, Y., AND DECHTER, R. 1996. An evaluation of structural paramters for probabilistic reasoning: Results on benchmark circuits. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI). pp. 244-251.
31. FORBUS, K. D., AND DE KLEER, J. 1993. Building Problem Solvers. MIT Press, Cambridge, Mass.
32. GERGOV, J., AND MEINEL, C. 1994. Efficient analysis and manipulation of OBDDs can be extended to FBDDs. IEEE Trans. Compute. 43, 10, 1197-1209.
33. HAMSCHER, W., CONSOLE, L., AND DE KLEER, J. 1992. Readings in Model-Based Diagnosis. Morgan-Kaufmann, San Mateo, Calif.
34. KHARDON, R., AND ROTH, D. 1997. Learning to reason. J. ACM 44, 5 (Sept.), 697-725.
35. LIN, F., AND REITER, R. 1994. Forget it! In Working notes: AAAI Fall Symposium on Relevance. AAAI Press, Menlo Park, Calif.
36. MARQUIS, P. 1995. Knowledge compilation using theory prime implicates. In Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI). Morgan-Kaufmann, San Mateo, Calif., pp. 837-843.
37. MEINEL, C., AND SLOBODOVA, A. 1998. Sample method for minimization of obdds. In Proceedings of the Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'98) (Jasna, Slowakia). Lecture Notes in Computer Science, Vol. 1521. Springer-Verlag, New York, pp. 419-428.
38. REITER, R. 1987. A theory of diagnosis from first principles. Artifi. Intell. 32, 57-95.
39. ROBERTSON, N., AND SEYMOUR, P. D. 1986. Graph minors II: Algorithmic aspects of tree-width. J. Algorithms 7, 309-322.
40. SELMAN, B., AND KAUTZ, H. 1996. Knowledge compilation and theory approximation. J. ACM 43, 2, 193-224.
41. SIBLING, D., AND WEGENER, I. 1995, Graph driven BDDs - a new data structure for Boolean functions. Theoreti. Comput. Sci. 141, 283-310.
42. WILLIAMS, B.C., AND NAYAK, P. P. 1997. A reactive planner for a model-based executive. In Proceedings of the International Joint Conference on Artifical Intelligence (IJCAI'97). Morgan-Kaufmann, San Mateo, Calif.