Author:
Huang Jinbo,Darwiche Adnan
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 7(5), 394–397 (1962)
2. SAT Competitions, http://www.satlive.org/SATCompetition/
3. Birnbaum, E., Lozinskii, E.: The good old Davis-Putnam procedure helps counting models. Journal of Artificial Intelligence Research 10, 457–477 (1999)
4. Bayardo, R., Pehoushek, J.: Counting models using connected components. In: AAAI 2000, pp. 157–162 (2000)
5. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35, 677–691 (1986)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Configuring BDD Compilation Techniques for Feature Models;28th ACM International Systems and Software Product Line Conference;2024-09-02
2. Interval-based Counterexample Analysis for Error Explanation;Journal of Information Processing;2021
3. Evaluating #SAT solvers on industrial feature models;Proceedings of the 14th International Working Conference on Variability Modelling of Software-Intensive Systems;2020-02-05
4. Phase Transition Behavior in Knowledge Compilation;Lecture Notes in Computer Science;2020
5. Binary Decision Diagrams;Handbook of Model Checking;2018