Editorial: Symbolic computation and satisfiability checking (Q2307620): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Lynx / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QEPCAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCLID / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2019.07.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966279456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building Bridges between Symbolic Computation and Satisfiability Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Non-uniform Cylindrical Algebraic Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial cylindrical algebraic decomposition for quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model-Constructing Satisfiability Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Non-linear Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Integration in Finite Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier elimination for real algebra -- the quadratic case and beyond / rank
 
Normal rank

Latest revision as of 02:50, 22 July 2024

scientific article
Language Label Description Also known as
English
Editorial: Symbolic computation and satisfiability checking
scientific article

    Statements

    Editorial: Symbolic computation and satisfiability checking (English)
    0 references
    24 March 2020
    0 references
    satisfiability checking
    0 references
    symbolic computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references