$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation |
scientific article |
Statements
$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (English)
0 references
30 August 2016
0 references
logical problems
0 references
symbolic computation
0 references
computer algebra systems
0 references
satisfiability checking
0 references
satisfiability modulo theories
0 references
0 references
0 references
