Editorial: Symbolic computation and satisfiability checking
From MaRDI portal
Publication:2307620
DOI10.1016/j.jsc.2019.07.017zbMath1444.68006OpenAlexW2966279456MaRDI QIDQ2307620
No author found.
Publication date: 24 March 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2019.07.017
Symbolic computation and algebraic computation (68W30) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten, Deciding first-order formulas involving univariate mixed trigonometric-polynomials, Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings, A nonexistence certificate for projective planes of order ten with weight 15 codewords
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Partial cylindrical algebraic decomposition for quantifier elimination
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
- Building Bridges between Symbolic Computation and Satisfiability Checking
- Open Non-uniform Cylindrical Algebraic Decompositions
- Solving Non-linear Arithmetic
- A Model-Constructing Satisfiability Calculus
- GRASP: a search algorithm for propositional satisfiability
- Computer Aided Verification
- The Problem of Integration in Finite Terms
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
