Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano italiano
CORDIS - Risultati della ricerca dell’UE
CORDIS

SC-square - Satisfiability Checking and Symbolic Computation: uniting two communities to solve real problems

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Risultati finali

Action Check Meeting 1 (si apre in una nuova finestra)

D6.4 Action Check Meeting 1 (mid term). To include draft agenda and presentations.

Report on Prototype B (si apre in una nuova finestra)

D2.1 (responsible: UGE, delivery date: M12): Report on the progress on the prototype integration of CoCoALib with MathSAT.

School Syllabus (si apre in una nuova finestra)

D5.2 (responsible: MPII, delivery date: M10): Syllabus for the school described in T5.3.

Mid-Term Report (si apre in una nuova finestra)

D6.3 (responsible: UBAH, delivery date: M12): Mid-term report, including updated dissemination and exploitation plan.

Final Report (si apre in una nuova finestra)

D6.6 (responsible: UBAH, delivery date: M26): Final report, including updated dissemination and exploitation plan.

Prototype A Report (si apre in una nuova finestra)

D1.2 (responsible: RWTH, delivery date: M24): A prototype integrating SMT-RAT with Symbolic Computation tools.

Industry Report (si apre in una nuova finestra)

D4.4 (responsible: UL, delivery date: M26): A report with recommendations corresponding to T4.4.

Action Check Meeting 2 (si apre in una nuova finestra)

D6.7 Action Check Meeting (Final). Deliverable in month after relevant reporting period (RP2) M27.

Workshop Proceedings (si apre in una nuova finestra)

D5.1 (responsible: UBAH, delivery date: M26): Proceedings for the workshops in T5.2.

Report on Prototype C (si apre in una nuova finestra)

D3.1 (responsible: MPII, delivery date: M12): A report on the progress on the prototype integration of Redlog with veriT.

Dissemination & exploitation updated (si apre in una nuova finestra)

D6.8 Dissemination & exploitation plan updated.

Dissemination & exploitation plan (si apre in una nuova finestra)

D6.5 Dissemination and exploitation plan deliverable at end of RP1.

Route to SMT-LIB Proposal (si apre in una nuova finestra)

Route to SMT-LIB Proposal.

Proceedings (si apre in una nuova finestra)

D5.3 (responsible: UBAH, delivery date: M26): Formal proceedings (possibly Springer Lecture Notes in Computer Science, possibly Electronic Notes in Theoretical Computer Science, possibly Leibniz Proceedings)(z) including the scientific results of the whole project. (z) Any decision will have to take into account the mandate for Open Access, but at this stage it is unwise to guess the state of the Open Access process in three years time.

Report on Prototype D (si apre in una nuova finestra)

D2.3 (responsible: UBAH, delivery date: M12): Report on the progress on making Maple’s cylindrical algebraic decomposition “SMT-compliant”.

Report on Prototype A (si apre in una nuova finestra)

D1.1 (responsible: RWTH, delivery date: M12): A report on the progress on the prototype integration of SMT-RAT with Symbolic Computation tools.

SMT-LIB Proposal (si apre in una nuova finestra)

D4.2 (responsible: UL, delivery date: M14): Proposal for a standard input language, corresponding to T4.1.

Website and logo (si apre in una nuova finestra)

D6.1 (responsible: UBAH, delivery date: M2): Project website and logo.

Prototype D (si apre in una nuova finestra)

D2.4 (responsible: UBAH, delivery date: M24): Final report, with demonstrations, on making Maple’s cylindrical algebraic decomposition “SMT-compliant”. This prototype relies on Maple’s (and others’) background IPR, so will not be generally available.

Benchmarks (si apre in una nuova finestra)

D4.3 (responsible: UOXF, delivery date: M26): A benchmark collection corresponding to T4.2.

Prototype B (si apre in una nuova finestra)

D2.2 (responsible: UGE, delivery date: M24): A prototype integration of CoCoALib with MathSAT.

Prototype C (si apre in una nuova finestra)

D3.2 (responsible: MPII, delivery date: M24): The prototype integrating Redlog with veriT.

Pubblicazioni

$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (si apre in una nuova finestra)

Autori: Erika Ábrahám, John Abbott, Bernd Becker, Anna M. Bigatti, Martin Brain, Bruno Buchberger, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Alberto Griggio, Daniel Kroening, Werner M. Seiler, Thomas Sturm
Pubblicato in: Intelligent Computer Mathematics, 2016, Pagina/e 28-43, ISBN 978-3-319-42547-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-42547-4_3

The complexity of cylindrical algebraic decomposition with respect to polynomial degree (si apre in una nuova finestra)

Autori: Matthew England, James H. Davenport
Pubblicato in: V.P. Gerdt, W. Koepf, W.M. Seiler and E.V. Vorozhtsov, eds. Computer Algebra in Scientific Computing, pp. 172-192. (Lecture Notes in Computer Science, 9890)., 2016, Pagina/e 172-192
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-45641-6_12

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks (si apre in una nuova finestra)

Autori: Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber
Pubblicato in: Proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing (CASC '17)., 2017, Pagina/e 93-108
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-66320-3_8

Revisiting Enumerative Instantiation (si apre in una nuova finestra)

Autori: Andrew Reynolds, Haniel Barbosa, Pascal Fontaine
Pubblicato in: Tools and Algorithms for the Construction and Analysis of Systems, 2018, Pagina/e 112-131
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-89963-3_7

Subtropical Satisfiability (si apre in una nuova finestra)

Autori: Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Tung Vu
Pubblicato in: International Symposium on Frontiers of Combining Systems, 2017, Pagina/e 189-206
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-66167-4_11

Scalable Fine-Grained Proofs for Formula Processing (si apre in una nuova finestra)

Autori: Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine
Pubblicato in: International Conference on Automated Deduction (CADE), 2017, Pagina/e 398-412
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-63046-5_25

Congruence Closure with Free Variables (si apre in una nuova finestra)

Autori: Haniel Barbosa, Pascal Fontaine, Andrew Reynolds
Pubblicato in: Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2017, Pagina/e 214-230
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54580-5_13

OpenMath and SMT-LIB

Autori: Davenport, James H.; England, Matthew; Sebastiani, Roberto; Trentin, Patrick
Pubblicato in: Proceedings of the 2017 OpenMath Workshop, 2017
Editore: Local Proceedings

Machine Learning for Mathematical Software (si apre in una nuova finestra)

Autori: England, M.
Pubblicato in: In: J.H. Davenport, M. Kauers, G. Labahn and J. Urban, eds. Mathematical Software - ICMS 2018. (Lecture Notes in Computer Science 10931)., 2018, Pagina/e 165-174
Editore: Springer
DOI: 10.1007/978-3-319-96418-8_20

Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics

Autori: C. Mulligan, R. Bradford, J.H. Davenport, M.England and Z. Tonks
Pubblicato in: In: A. Bigatti and M. Brain eds. Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 '18), pp. 48-60. CEUR Workshop Proceedings 2189, 2018., Numero 2189, 2018, Pagina/e 48-60
Editore: CEUR

The Potential and Challenges of CAD with Equational Constraints for SC-Square. (si apre in una nuova finestra)

Autori: James H. Davenport, Matthew England
Pubblicato in: n: Blomer J., Kotsireas I., Kutsia T., Simos D. (eds) Mathematical Aspects of Computer and Information Sciences (Proc. MACIS '17), pp. 280-285. (Lecture Notes in Computer Science 10693). Springer International, 2017., Numero 10693, 2018, Pagina/e 280-285
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-72453-9_22

TheoryGuru: A Mathematica Package to apply Quantifier Elimination (si apre in una nuova finestra)

Autori: Casey B. Mulligan, James H. Davenport, Matthew England
Pubblicato in: In: J.H. Davenport, M. Kauers, G. Labahn and J. Urban, eds. Mathematical Software - ICMS 2018, pp. 369-378. (Lecture Notes in Computer Science 10931). Springer, 2018., Numero 10931, 2018, Pagina/e 369-378
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96418-8_44

Towards Incremental Cylindrical Algebraic Decomposition in Maple

Autori: Cowen-Rivers, Alexander Imani; England, Matthew
Pubblicato in: In: A. Bigatti and M. Brain eds. Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 '18), pp. 3-18. CEUR Workshop Proceedings 2189, Numero 1, 2018, Pagina/e 3-18
Editore: CEUR

New in CoCoA-5.2.2 and CoCoALib-0.99560 for SC-Square

Autori: John Abbott, Anna Maria Bigatti
Pubblicato in: In: M. England, V. Ganesh eds.: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, Numero 1974, 2017
Editore: CEUR

New in CoCoA-5.2.4 and CoCoALib-0.99600 for SC-Square

Autori: John Abbott, Anna Maria Bigatti, Elisa Palezzato
Pubblicato in: In: A. Bigatti and M. Brain eds.: Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 '18), Numero 2189, 2018, Pagina/e 88-94
Editore: CEUR

CoCoA and CoCoALib: Fast prototyping and flexible C++ library for computations in commutative Algebra

Autori: Abbott, JOHN ANTHONY; Bigatti, ANNA MARIA
Pubblicato in: In: E.Ábrahám, J. H. Davenport, P. Fontaine eds.: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation (SC2 2016), Numero 1804, 2016, Pagina/e 1--3
Editore: CEUR

Symbolic Computation Techniques in Satisfiability Checking (si apre in una nuova finestra)

Autori: Erika Abraham
Pubblicato in: 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016, Pagina/e 3-10, ISBN 978-1-5090-5707-8
Editore: IEEE
DOI: 10.1109/SYNASC.2016.014

Comparing Different Projection Operators in the Cylindrical Algebraic Decomposition for SMT Solving

Autori: Tarik Viehmann, Gereon Kremer, Erika Ábrahám
Pubblicato in: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, 2017
Editore: sc-square.org

A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (si apre in una nuova finestra)

Autori: Gereon Kremer, Florian Corzilius, Erika Ábrahám
Pubblicato in: Proceedings of the 18th International Workshop on Computer Algebra in Scientific Computing, CASC 2016, Bucharest, Romania, September 19-23, 2016, 2016, Pagina/e 315-335, ISBN 978-3-319-45640-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-45641-6_21

Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework

Autori: Erika Ábrahám, Jasper Nalbach, Gereon Kremer
Pubblicato in: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, 2017
Editore: sc-square.org

Satisfiability Checking: Theory and Applications (si apre in una nuova finestra)

Autori: Erika Ábrahám, Gereon Kremer
Pubblicato in: Proceedings of the 14th International Conference on Software Engineering and Formal Methods, SEFM 2016, Vienna, Austria, July 4-8, 2016, 2016, Pagina/e 9-23, ISBN 978-3-319-41590-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-41591-8_2

Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition with Groebner Bases (si apre in una nuova finestra)

Autori: Zongyan Huang, Matthew England, James H. Davenport, Lawrence C. Paulson
Pubblicato in: 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016, Pagina/e 45-52, ISBN 978-1-5090-5707-8
Editore: IEEE
DOI: 10.1109/SYNASC.2016.020

A Case Study on the Parametric Occurrence of Multiple Steady States (si apre in una nuova finestra)

Autori: Russell Bradford, Thomas Sturm, Andreas Weber, James H. Davenport, Matthew England, Hassan Errami, Vladimir Gerdt, Dima Grigoriev, Charles Hoyt, Marek Košta, Ovidiu Radulescu
Pubblicato in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17, 2017, Pagina/e 45-52, ISBN 9781450350648
Editore: ACM Press
DOI: 10.1145/3087604.3087622

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

Autori: M. England and J.H. Davenport
Pubblicato in: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation, Numero CEUR Workshop Proceedings 1804, 2016
Editore: CEUR Workshop Proceedings

Need Polynomial Systems be Doubly-exponential? (si apre in una nuova finestra)

Autori: James H. Davenport, Matthew England
Pubblicato in: In: G.M. Greuel, T. Koch, P. Paule and A. Sommese, eds. Mathematical Software - ICMS 2016, pp.167-164, (Lecture Notes in Computer Science, 9725)., 2016, Pagina/e 157-164
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-42432-3_20

Using Machine Learning to Improve Cylindrical Algebraic Decomposition

Autori: Huang, Zongyan; England, Matthew; Wilson, David; Davenport, James H.; Paulson, Lawrence C.
Pubblicato in: To appear in: Mathematics in Computer Science, 2018, ISSN 1661-8270
Editore: Birkhauser Verlag

Satisfiability checking and symbolic computation (si apre in una nuova finestra)

Autori: E. Ábrahám, P. Fontaine, S. Forrest, A. Griggio, D. Kroening, W. M. Seiler, T. Sturm, J. Abbott, B. Becker, A. M. Bigatti, M. Brain, B. Buchberger, A. Cimatti, J. H. Davenport, M. England
Pubblicato in: ACM Communications in Computer Algebra, Numero 50/4, 2017, Pagina/e 145-147, ISSN 1932-2240
Editore: ACM
DOI: 10.1145/3055282.3055285

SC-Square 2018 Satisfiability Checking and Symbolic Computation Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation

Autori: Anna M. Bigatti, Martin Brain
Pubblicato in: Numero 2189, 2018
Editore: CEUR

Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation

Autori: Erika Ábrahám, James H. Davenport, Pascal Fontaine (eds.)
Pubblicato in: 2016
Editore: CEUR-WS

CoCoALib and CoCoA-5

Autori: J.Abbott, A.M.Bigatti
Pubblicato in: Der Computeralgebra-Rundbrief, Numero 61, 2017, Pagina/e 13-17, ISSN 0933-5994
Editore: Computer Algebra Division of Gesellschaft fur Informatik e.V.

software CoCoALib 0.99600: a C++ library for doing Computations in Commutative Algebra.

Autori: John Abbott and Anna Maria Bigatti
Pubblicato in: 2018
Editore: http://cocoa.dima.unige.it

software CoCoA 5.2.4 Computations in Commutative Algebra

Autori: J. Abbott, A.M. Bigatti
Pubblicato in: 2018
Editore: http://cocoa.dima.unige.it

Computing and Using Minimal Polynomials

Autori: John Abbott, Anna Maria Bigatti, Elisa Palezzato, Lorenzo Robbiano
Pubblicato in: arXiv.org, 2017
Editore: arXiv.org

È in corso la ricerca di dati su OpenAIRE...

Si è verificato un errore durante la ricerca dei dati su OpenAIRE

Nessun risultato disponibile

Il mio fascicolo 0 0