Proceedings

Compact Propositional Encodings of First-Order Theories

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1579-1579.

© 2005 International Joint Conferences on Artificial Intelligence

Abstract

  1. [Amir and McIlraith, 2004] E. Amir and S. McIlraith. Partition- based logical reasoning for first-order and propositional theories. Artificial Intelligence, 2004. Accepted for publication.
  2. [Amir, 2001] E. Amir. Efficient approximation for triangulation of minimum treewidth. In UAI'01, pages 7-15.
  3. Morgan Kaufmann, 2001.
  4. [Börger et al., 1996] E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer-Verlag, 1996.
  5. [Gilmore, 1960] P.C. Gilmore. A proof method for quantification theory: It's justification and realization. IBM Journal of Research and Development, 4(1):28-35, January 1960.
  6. [Kautz and Selman, 1996] H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In AAAI'96, 1996.
  7. [Krogel et al., 2003] M. Krogel, N. Lavrac, and S. Wrobel. Com- parative evaluation of approaches to propositionalization. In ILP, pages 197-214, 2003.
  8. [Kropf, 1999] T. Kropf, editor. Introduction to Formal Hardware Verification. Springer, 1999.
  9. [Moskewicz et al., 2001] M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an effi- cient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards