Author:
Chen Li,Wu Jing-Zheng,Lv Yin-Run,Wang Yong-Ji
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference33 articles.
1. Barrett CW, Sebastiani R, Seshia S A, Tinelli C. Satisfiability modulo theories. In Handbook of Satisfiability: Volume 185 of Frontiers in Artificial Intelligence and Applications, Biere A, Heule M J H, Van Maaren H and Walsh T (eds.), IOS Press, 2009, pp.825-885.
2. Nelson G, Oppen D C. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 1979, 1(2): 245-257.
3. Armando A, Castellini C, Giunchiglia E. SAT-based procedures for temporal reasoning. In Proc. the 5th European Conference on Planning on Recent Advances in AI Planning, September 1999, pp.97-108.
4. Audemard G, Bertoli P, Cimatti A, Kornilowicz A, Sebastiani R. A SAT based approach for solving formulas over Boolean and linear mathematical propositions. In Proc. the 18th Int. Conf. Automated Deduction, July 2002, pp.195-210.
5. Armando A, Ranise S, Rusinowitch M. A rewriting approach to satisfiability procedures. Information and Computation, 2003, 183(2): 140-164.