Author:
Hamadi Youssef,Jabbour Saïd,Saïs Lakhdar
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference59 articles.
1. Audemard G, Bordeaux L, Hamadi Y, Jabbour S, Sais L (2008) A generalized framework for conflict analysis. In: SAT, pp 21–27
2. Audemard G, Bordeaux L, Hamadi Y, Jabbour S, Sais L (2008) A generalized framework for conflict analysis. Technical Report MSR-TR-2008-34, Microsoft Research, Feb 2008
3. Audemard G, Lagniez J-M, Mazure B, Sais L (2011) On freezing and reactivating learnt clauses. In: Proceedings of the 14th international conference on theory and applications of satisfiability testing (SAT’2011), pp 188–200
4. Bayardo RJ, Miranker DP (1996) A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In: In Proceedings of the 13th national conference on artificial intelligence, pp 298–304
5. Bayardo RJ Jr, Schrag RC (1997) Using CSP look-back techniques to solve real-world SAT instances. In: AAAI, pp 203–208
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sixty-one surveys in operations research;Annals of Operations Research;2022-06-22
2. Surveys in operations research;Annals of Operations Research;2018-09-01
3. Sweet sixteen;4OR;2018-02-26
4. Twelve surveys in operations research;Annals of Operations Research;2016-04-28
5. What we can learn from conflicts in propositional satisfiability;Annals of Operations Research;2015-10-01