Building Bridges between Symbolic Computation and Satisfiability Checking
From MaRDI portal
Publication:2819729
DOI10.1145/2755996.2756636zbMath1345.68279OpenAlexW2065429593MaRDI QIDQ2819729
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2755996.2756636
Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Satisfiability Checking: Theory and Applications ⋮ Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT ⋮ What does ``without loss of generality mean, and how do we detect it ⋮ Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings ⋮ The SAT+CAS method for combinatorial search with applications to best matrices ⋮ $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation ⋮ Editorial: Symbolic computation and satisfiability checking ⋮ Applying computer algebra systems with SAT solvers to the Williamson conjecture ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures ⋮ Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ Satisfiability checking and symbolic computation
Uses Software
