Satisfiability Checking meets Symbolic Computation (Project Paper)
arXiv:1607.08028 · doi:10.1007/978-3-319-42547-4_3
Abstract
Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC-square project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and (industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC-square community.
References in corpus (3)
Cited by in corpus (20)
- Deciding the Consistency of Non-Linear Real Arithmetic Constraints with a Conflict Driven Search Using Cylindrical Algebraic Coverings
- Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture
- Cylindrical Algebraic Decomposition with Equational Constraints
- Using Machine Learning to Improve Cylindrical Algebraic Decomposition
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
- Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT
- Efficiently and Effectively Recognizing Toricity of Steady State Varieties
- Algorithmically generating new algebraic features of polynomial systems for machine learning
- New Opportunities for the Formal Proof of Computational Real Geometry?
- The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices
- The Potential and Challenges of CAD with Equational Constraints for SC-Square
- The DEWCAD Project: Pushing Back the Doubly Exponential Wall of Cylindrical Algebraic Decomposition
- Quantifier Elimination for Reasoning in Economics
- Enumeration of Complex Golay Pairs via Programmatic SAT
- First-Order Tests for Toricity
- Positive Solutions of Systems of Signed Parametric Polynomial Inequalities
- Summer Research Report: Towards Incremental Lazard Cylindrical Algebraic Decomposition
- Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
- Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic
- Proof-of-work certificates that can be efficiently computed in the cloud