A perspective on knowledge compilation

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 175-182

  Darwiche, Adnan ^a   Marquis, Pierre ^b  

^a Department of Civil and Environmental Engineering   (United States)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED ACYCLIC GRAPH (DAG); KEY DIMENSIONS; KNOWLEDGE COMPILATION; NESTED CLASS;

ARTIFICIAL INTELLIGENCE;

EID: 84880889873     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Manuel Blum, Ashok K. Chandra, and Mark N. Wegman. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters, 10(2):80-82, 1980.
2. Y. Boufkhad, E. Grégoire, P. Marquis, B. Mazure, and L. Saïs. Tractable cover compilations. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI'97), pages 122-127, 1997.
3. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
4. M. Cadoli and F.M. Donini. A survey on knowledge compilation. AI Communications, 10:137-150, 1997 (printed in 1998).
5. M. Cadoli, F.M. Donini, P. Liberatore, and M. Schaerf. Comparing space efficiency of propositional knowledge representation formalisms. In Proc. of International Conference on Knowledge Representation and Reasoning (KR'96), pages 364-373, 1996.
6. Adnan Darwiche and Pierre Marquis. A perspective on knowledge compilation. Technical Report D-116, Cognitive Systems Laboratory, UCLA, Ca 90095, 2001.
7. Adnan Darwiche. Compiling knowledge into decomposable negation normal form. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI'99), pages 284-289, 1999.
8. Adnan Darwiche. Decomposable negation normal form. Technical Report D-109, Cognitive Systems Laboratory, UCLA, Ca 90095, 1999. To appear in Journal of the ACM.
9. Adnan Darwiche. On the tractable counting of theory models and its application to belief revision and truth maintenance. Technical Report D-113, Cognitive Systems Laboratory, UCLA, Ca 90095, 2000. To appear in Journal of Applied Non-Classical Logics.
10. R. Dechter and I. Rish. Directional resolution: the Davis-Putnam procedure, revisited. In Proc. of International Conference on Knowledge Representation and Reasoning (KR'94), pages 134-145, 1994.
11. A. del Val. Tractable databases: How to make propositional unit resolution complete through compilation. In Proc. of International Conference on Knowledge Representation and Reasoning (KR'94), pages 551-561, 1994.
12. J. Gergov and Ch. Meinel. Efficient analysis and manipulation of OBDD's can be extended to FBDD's. IEEE Transactions on Computers, 43(10):1197-1209, 1994.
13. G. Gogic, H. Kautz, Ch. Papadimitriou, and B. Selman. The comparative linguistics of knowledge representation. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI'95), pages 862-869, 1995.
14. A. Herzig and O. Rifi. Propositional belief base update and minimal change. Artificial Intelligence, 115(1):107-138, 1999. (Pubitemid 30522973)
15. R.M. Karp and R.J. Lipton. Some connections between non-uniform and uniform complexity classes. In Proc. of ACM Symposium on Theory of Computing (STOC'80), pages 302-309, 1980.
16. R. Khardon and D. Roth. Learning to reason. Journal of the ACM, 44(5):697-725, 1997. (Pubitemid 127614257)
17. F. Lin and R. Reiter. Forget it! In Proc. of the AAAI Fall Symposium on Relevance, pages 154-159, New Orleans, 1994.
18. Pierre Marquis. Knowledge compilation using theory prime implicates. In Proc. of International Joint Conference on Artifical Intelligence (IJCAI'95), pages 837-843, 1995.
19. Ch. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
20. Ray Reiter and Johan de Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In Proc. of National Conference on Artificial Intelligence (AAAI'87), pages 183-188, 1987.
21. R. Schrag. Compilation for critically constrained knowledge bases. In Proc. of National Conference on Artificial Intelligence (AAAI'96), pages 510-515, 1996.
22. Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, 1996.