Author:
Simon Laurent,Le Berre Daniel,Hirsch Edward A.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference68 articles.
1. P.A. Abdulla, P. Bjesse and N. Eén, Symbolic reachability analysis based on SAT-solvers, in: Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2000) (2000).
2. F. Bacchus, Enhancing Davis Putnam with extended binary clause reasoning, in: Proceedings of National Conference on Artificial Intelligence (AAAI-2002) (2002).
3. F. Bacchus, Exploring the computational tradeoff of more reasoning and less searching, in: [49, pp. 7–16] (2002).
4. L. Baptista and J.P. Marques-Silva, Using randomization and learning to solve hard real-world instances of satisfiability, in: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP) (2000).
5. R.J.J. Bayardo and R.C. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI’97) (AMS, Providence, RI, 1997) pp. 203–208.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献