Author:
Brauer Jörg,King Andy,Kriener Jael
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Aloul, F.A., Markov, I.L., Sakallah, K.A.: Faster SAT and Smaller BDDs via Common Function Structure. In: ICCAD, pp. 443–448 (2001)
2. Armstrong, T., Marriott, K., Schachte, P., Søndergaard, H.: Two Classes of Boolean Functions for Dependency Analysis. Sci. Comp. Program. 31(1), 3–45 (1998)
3. Barrett, E., King, A.: Range and Set Abstraction Using SAT. Electronic Notes in Theoretical Computer Science 267(1), 17–27 (2010)
4. Blake, A.: Canonical expressions in Boolean algebra. University of Chicago, Chicago (1938)
5. Lecture Notes in Computer Science;J. Brauer,2010
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Quantifier Elimination and Property Generation;Computer Aided Verification;2023
2. Accelerating all-SAT computation with short blocking clauses;Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering;2020-12-21
3. Definability for model counting;Artificial Intelligence;2020-04
4. Four Flavors of Entailment;Theory and Applications of Satisfiability Testing – SAT 2020;2020
5. How we designed winning algorithms for abstract argumentation and which insight we attained;Artificial Intelligence;2019-11