暂无分享,去创建一个
Matthew England | James H. Davenport | Roberto Sebastiani | Patrick Trentin | J. Davenport | R. Sebastiani | M. England | P. Trentin
[1] Dejan Jovanović,et al. Solving Non-linear Arithmetic , 2012, IJCAR.
[2] Erika Ábrahám,et al. Building Bridges between Symbolic Computation and Satisfiability Checking , 2015, ISSAC.
[3] James H. Davenport,et al. A small OpenMath type system , 2000, SIGS.
[4] Daniel Kroening,et al. Satisfiability Checking meets Symbolic Computation (Project Paper) , 2016, CICM.
[5] Matthew England,et al. Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition , 2016, SC²@SYNASC.
[6] Peter Horn,et al. OpenMath in SCIEnce: SCSCP and POPCORN , 2009, Calculemus/MKM.
[7] Roberto Sebastiani,et al. OptiMathSAT: A Tool for Optimization Modulo Theories , 2015, Journal of Automated Reasoning.
[8] Daniel Kroening,et al. SC2: Satisfiability Checking Meets Symbolic Computation - (Project Paper) , 2016, CICM.
[9] Steve Linton,et al. Easy composition of symbolic computation software using SCSCP: A new Lingua Franca for symbolic computation , 2013, J. Symb. Comput..
[10] Paolo Aluffi,et al. Algebra: Chapter 0 , 2009 .
[11] Clark W. Barrett,et al. The SMT-LIB Standard Version 2.0 , 2010 .