Author:
Chatalic Philippe,Simon Laurent
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Bryant, R.E.: Graph - based algorithms for boolean function manipulation. IEEE Trans. on Comp. 35(8), 677–691 (1986)
2. Chatalic, P., Simon, L.: Davis and putnam 40 years later: a first experimentation. Technical Report 1237, LRI, Orsay, France (2000), submitted to the Journal of Automated Reasoning
3. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM, 201–215 (1960)
4. de Kleer, J.: An improved incremental algorithm for generating prime implicates. In: AAAI 1992, pp. 780–785 (1992)
5. Dechter, R., Rish, I.: Directional resolution: The Davis–Putnam procedure, revisited. In: Proceedings of KR 1994, pp. 134–145 (1994)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SAT-Inspired Eliminations for Superposition;ACM Transactions on Computational Logic;2023-01-18
2. Clausal Proofs for Pseudo-Boolean Reasoning;Tools and Algorithms for the Construction and Analysis of Systems;2022
3. ZDD Boolean Synthesis;Tools and Algorithms for the Construction and Analysis of Systems;2022
4. Introduction to Zero-Suppressed Decision Diagrams;Synthesis Lectures on Digital Circuits & Systems;2015
5. SAT encodings of a classical problem: a case study;Artificial Intelligence: Foundations, Theory, and Algorithms;2015