Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference30 articles.
1. Barrett, C.: Checking validity of quantifier-free formulas in combinations of first-order theories. Ph.D. thesis, Stanford University (2003)
2. Biere, A.: PicoSAT essentials. JSAT 4, 75–97 (2008)
3. Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: a comparative survey. ACM Comput. Surv. 38(4) (2006)
4. Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. JAIR 22, 319–351 (2004)
5. Baptista, L., Marques-Silva, J.P.: Using randomization and learning to solve hard real-world instances of satisfiability. In: CP ’00. LNCS 1894, pp. 489–494, Singapore, 18–22 September 2000
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Handling Automotive Hardware/Software Co-Configurations with Integer Difference Logic;Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems;2024-02-07
2. A Verified Implementation of the DPLL Algorithm in Dafny;Mathematics;2022-06-28
3. Anomaly detection in Context-aware Feature Models;15th International Working Conference on Variability Modelling of Software-Intensive Systems;2021-02-09
4. Verifying the Conversion into CNF in Dafny;Logic, Language, Information, and Computation;2021
5. Cognification of Program Synthesis—A Systematic Feature-Oriented Analysis and Future Direction;Computers;2020-04-12