SC2: Satisfiability Checking Meets Symbolic Computation

Ábrahám, Erika; Abbott, John; Becker, Bernd; Bigatti, Anna M.; Brain, Martin; Buchberger, Bruno; Cimatti, Allesandro; Davenport, James H.; England, Matthew; Fontaine, Pascal; Forrest, Stephen; Griggio, Alberto; Kroening, Daniel; Seiler, Werner M.; Sturm, Thomas

doi:10.1007/978-3-319-42547-4_3

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2320859_4

DetailsSummary

Released

Conference Paper

SC2: Satisfiability Checking Meets Symbolic Computation

MPS-Authors

/persons/resource/persons73108

Sturm, Thomas
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Ábrahám, E., Abbott, J., Becker, B., Bigatti, A. M., Brain, M., Buchberger, B., et al. (2016). SC2: Satisfiability Checking Meets Symbolic Computation. In M. Kohlhase, M. Johansson, B. Miller, L. de Moura, & F. Tompa (Eds.), Intelligent Computer Mathematics (pp. 28-43). Berlin: Springer. doi:10.1007/978-3-319-42547-4_3.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002B-0A83-3

Abstract

There is no abstract available