CORDIS

EU research results

CORDIS

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

Fact Sheet

Reporting

Results

Objective

The use of advanced methods to solve practical and industrially relevant problems by computers has a long history. Whereas Symbolic Computation is concerned with the algorithmic determination of exact solutions to complex mathematical problems, more recent developments in the area of Satisfiability Checking tackle similar problems but with different algorithmic and technological solutions.

Though both communities have made remarkable progress in the last decades, they still need to be strengthened to tackle practical problems of rapidly increasing size and complexity. Their separate tools (computer algebra systems and SMT solvers) are urgently needed to examine prevailing problems with a direct effect to our society. For example, Satisfiability Checking is an essential backend for assuring the security and the safety of computer systems. In various scientific areas, Symbolic Computation enables dealing with large mathematical problems out of reach of pencil and paper developments.

Currently the two communities are largely disjoint and unaware of the achievements of each other, despite strong reasons for them to discuss and collaborate, as they share many central interests. However, researchers from these two communities rarely interact, and also their tools lack common, mutual interfaces for unifiying their strengths. Bridges between the communities in the form of common platforms and roadmaps are necessary to initiate an exchange, and to support and to direct their interaction. These are the main objectives of this CSA. We will initiate a wide range of activities to bring the two communities together, identify common challenges, offer global events and bilateral visits, propose standards, and so on.

We believe that these activities will initiate cross-fertilisation of both fields and bring mutual improvements. Combining the knowledge, experience and the technologies in these communities will enable the development of radically improved software tools

Programme(s)

H2020-EU.1.2.1. - FET Open

Topic(s)

FETOPEN-CSA-FETEXCHANGE-2015 - FET Exchange Coordination and Support Activities 2015

Call for proposal

H2020-FETOPEN-2015-CSA

See other projects for this call

Funding Scheme

CSA - Coordination and support action

Leaflet | Map data © OpenStreetMap contributors, Credit: EC-GISCO, © EuroGeographics for the administrative boundaries

Coordinator

UNIVERSITY OF BATH

Address

Claverton Down
Ba2 7ay Bath

United Kingdom

Activity type

Higher or Secondary Education Establishments

EU Contribution

€ 114 456,25

Website

Contact the organisation

Participants (10)

Sort alphabetically

Sort by EU Contribution

Expand all

RHEINISCH-WESTFAELISCHE TECHNISCHE HOCHSCHULE AACHEN

Germany

EU Contribution

€ 55 000

FONDAZIONE BRUNO KESSLER

Italy

EU Contribution

€ 45 000

UNIVERSITA DEGLI STUDI DI GENOVA

Italy

EU Contribution

€ 45 000

MAPLESOFT EUROPE LIMITED

United Kingdom

EU Contribution

€ 23 750

UNIVERSITE DE LORRAINE

France

EU Contribution

€ 36 250

COVENTRY UNIVERSITY

United Kingdom

EU Contribution

€ 43 272,50

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD

United Kingdom

EU Contribution

€ 36 250

UNIVERSITAET KASSEL

Germany

EU Contribution

€ 36 250

MAX-PLANCK-GESELLSCHAFT ZUR FORDERUNG DER WISSENSCHAFTEN EV

Germany

EU Contribution

€ 28 125

UNIVERSITAT LINZ

Austria

EU Contribution

€ 36 250

Project information

SC-square

Grant agreement ID: 712689

Project website

Start date

1 July 2016
End date

31 August 2018

Funded under:

H2020-EU.1.2.1.

Overall budget:

€ 499 603,75
EU contribution

€ 499 603,75

Coordinated by:

UNIVERSITY OF BATH

United Kingdom

Periodic Reporting for period 2 - SC-square (SC-square - Satisfiability Checking and Symbolic Computation: uniting two communities to solve real problems)

Reporting period: 2017-07-01 to 2018-08-31

Summary of the context and overall objectives of the project

In summary, this proposal was motivated by the following four main problems.

Problem 1 Disjoint communities
The two communities of Satisfiability Checking and Symbolic Computation share interests and
challenges, but they are currently not well connected: there are no common communication platforms
(journals, conferences etc.), cross-community cooperations are rare, and they do not join their forces
to offer powerful solutions to challenging industrial problems.
Problem 2 Missing research roadmap
Both communities would profit from cross-community interactions, however, the potentials are
not clearly identified. Discussions are needed on what the communities can learn from each other,
what are the common challenges which they can solve together.
Problem 3 Missing standards
Though in Satisfiability Checking the standard input language allows large benchmark sets, benchmarks for non-linear arithmetic theories are still rare, and harder to describe without ambiguity.
Problem 4 Visibility
Both areas are highly relevant in many theoretic as well as practical application domains, however, though their visibility in other areas is increasing, it still does not reflect their importance.

Why is it important for society?
Expected Impacts:
• European thought-leadership on new and emerging technologies with a strong engagement of scientists, citizens,innovators and policy makers
• Improved long-term innovation potential in Europe both from the abundance of novel ideas and the range of actors ready to take them forward
• Improved readiness across Europe to engage in silo-breaking research collaboration and to take up new research and innovation practices
• Increased take-up of long-term science and technology research results

What are the overall objectives?
The overall aim of this project is to create a new research community bridging the gap between
Satisfiability Checking and Symbolic Computation, whose members will ultimately be well
informed about both fields, and thus able to combine the knowledge and techniques of both
fields to develop new research and to resolve problems (both academic and industrial) currently
beyond the scope of either individual field.
We call the new community SC2 (SC-square in ASCII, e.g. for the web site), as it will join the communities of
Satisfiability Checking and Symbolic Computation.
O1 Build a joint SC2 community
Build a community of researchers interested in developing technologies at the boundary of the traditionally separate areas of Satisfiability Checking and Symbolic Computation.
O2 Create a research roadmap
Create a research roadmap of potentials and challenges, both to the two traditional silos of Satisfiability Checking and Symbolic Computation, but also challenges that only the new joined SC2 community
can address.
O3 Initiate SC2 standards
Create standards and benchmark libraries such that the SC2 community can share challenges and measure its progress.
O4 Increase the visibility of SC2
Disseminate research topics and results to other related research areas and to the public, with a special
focus on young researchers and aiming at gender and geographic balance.

Work performed from the beginning of the project to the end of the period covered by the report and main results achieved so far

Progress beyond the state of the art and expected potential impact (including the socio-economic impact and the wider societal implications of the project so far)

SC square logo

Project information

SC-square

Grant agreement ID: 712689

Project website

Start date

1 July 2016
End date

31 August 2018

Funded under:

H2020-EU.1.2.1.

Overall budget:

€ 499 603,75
EU contribution

€ 499 603,75

Coordinated by:

UNIVERSITY OF BATH

Deliverables

Documents, reports (9)

Action Check Meeting 1

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

Report on Prototype B

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

School Syllabus

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

Mid-Term Report

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

Report on Prototype C

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

Dissemination & exploitation plan

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

Route to SMT-LIB Proposal

Route to SMT-LIB Proposal.

Report on Prototype D

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

Report on Prototype A

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

Websites, patent fillings, videos etc. (1)

Open Research Data Pilot (1)

Publications

Peer reviewed articles (2)

Using Machine Learning to Improve Cylindrical Algebraic Decomposition

Author(s): Huang, Zongyan; England, Matthew; Wilson, David; Davenport, James H.; Paulson, Lawrence C.

Published in: To appear in: Mathematics in Computer Science, 2018, ISSN 1661-8270

Satisfiability checking and symbolic computation

Author(s): 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

Published in: ACM Communications in Computer Algebra, Issue 50/4, 2017, Page(s) 145-147, ISSN 1932-2240

DOI: 10.1145/3055282.3055285

Conference proceedings (17)

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

Author(s): Tarik Viehmann, Gereon Kremer, Erika Ábrahám

Published in: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, 2017

Revisiting Enumerative Instantiation

Author(s): Andrew Reynolds, Haniel Barbosa, Pascal Fontaine

Published in: Tools and Algorithms for the Construction and Analysis of Systems, 2018, Page(s) 112-131

DOI: 10.1007/978-3-319-89963-3_7

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

Author(s): Erika Ábrahám, Jasper Nalbach, Gereon Kremer

Published in: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, 2017

Congruence Closure with Free Variables

Author(s): Haniel Barbosa, Pascal Fontaine, Andrew Reynolds

Published in: Tools and Algorithms for Construction and Analysis of Systems (TACAS), 2017, Page(s) 214-230

DOI: 10.1007/978-3-662-54580-5_13

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

Author(s): C. Mulligan, R. Bradford, J.H. Davenport, M.England and Z. Tonks

Published 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., Issue 2189, 2018, Page(s) 48-60

Experience with Heuristics, Benchmarks & Standards for Cylindrical Algebraic Decomposition

Author(s): M. England and J.H. Davenport

Published in: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation, Issue CEUR Workshop Proceedings 1804, 2016

Towards Incremental Cylindrical Algebraic Decomposition in Maple

Author(s): Cowen-Rivers, Alexander Imani; England, Matthew

Published 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, Issue 1, 2018, Page(s) 3-18

OpenMath and SMT-LIB

Author(s): Davenport, James H.; England, Matthew; Sebastiani, Roberto; Trentin, Patrick

Published in: Proceedings of the 2017 OpenMath Workshop, 2017

TheoryGuru: A Mathematica Package to apply Quantifier Elimination

Author(s): Casey B. Mulligan, James H. Davenport, Matthew England

Published 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., Issue 10931, 2018, Page(s) 369-378

DOI: 10.1007/978-3-319-96418-8_44

Scalable Fine-Grained Proofs for Formula Processing

Author(s): Haniel Barbosa, Jasmin Christian Blanchette, Pascal Fontaine

Published in: International Conference on Automated Deduction (CADE), 2017, Page(s) 398-412

DOI: 10.1007/978-3-319-63046-5_25

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

Author(s): John Abbott, Anna Maria Bigatti, Elisa Palezzato

Published in: In: A. Bigatti and M. Brain eds.: Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (SC2 '18), Issue 2189, 2018, Page(s) 88-94

Machine Learning for Mathematical Software

Author(s): England, M.

Published in: In: J.H. Davenport, M. Kauers, G. Labahn and J. Urban, eds. Mathematical Software - ICMS 2018. (Lecture Notes in Computer Science 10931)., 2018, Page(s) 165-174

DOI: 10.1007/978-3-319-96418-8_20

The Potential and Challenges of CAD with Equational Constraints for SC-Square.

Author(s): James H. Davenport, Matthew England

Published 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., Issue 10693, 2018, Page(s) 280-285

DOI: 10.1007/978-3-319-72453-9_22

Need Polynomial Systems be Doubly-exponential?

Author(s): James H. Davenport, Matthew England

Published 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, Page(s) 157-164

DOI: 10.1007/978-3-319-42432-3_20

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

Author(s): John Abbott, Anna Maria Bigatti

Published in: In: M. England, V. Ganesh eds.: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation, Issue 1974, 2017

Subtropical Satisfiability

Author(s): Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan Tung Vu

Published in: International Symposium on Frontiers of Combining Systems, 2017, Page(s) 189-206

DOI: 10.1007/978-3-319-66167-4_11

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

Author(s): Abbott, JOHN ANTHONY; Bigatti, ANNA MARIA

Published in: In: E.Ábrahám, J. H. Davenport, P. Fontaine eds.: Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation (SC2 2016), Issue 1804, 2016, Page(s) 1--3

Monographic books (2)

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

Author(s): Anna M. Bigatti, Martin Brain

Published in: Issue 2189, 2018

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

Author(s): Erika Ábrahám, James H. Davenport, Pascal Fontaine (eds.)

Published in: 2016

Non-peer reviewed articles (1)

CoCoALib and CoCoA-5

Author(s): J.Abbott, A.M.Bigatti

Published in: Der Computeralgebra-Rundbrief, Issue 61, 2017, Page(s) 13-17, ISSN 0933-5994

Other (3)

Computing and Using Minimal Polynomials

Author(s): John Abbott, Anna Maria Bigatti, Elisa Palezzato, Lorenzo Robbiano

Published in: arXiv.org, 2017

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

Author(s): John Abbott and Anna Maria Bigatti

Published in: 2018

software CoCoA 5.2.4Computations in Commutative Algebra

Author(s): J. Abbott, A.M. Bigatti

Published in: 2018

Book chapters (2)

The complexity of cylindrical algebraic decomposition with respect to polynomial degree

Author(s): Matthew England, James H. Davenport

Published 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, Page(s) 172-192

DOI: 10.1007/978-3-319-45641-6_12

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks

Author(s): Matthew England, Hassan Errami, Dima Grigoriev, Ovidiu Radulescu, Thomas Sturm, Andreas Weber

Published in: Proceedings of the 19th International Workshop on Computer Algebra in Scientific Computing (CASC '17)., 2017, Page(s) 93-108

DOI: 10.1007/978-3-319-66320-3_8

Datasets

Datasets via OpenAire

Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions

Author(s): Cimatti, Alessandro,Griggio, Alberto,Irfan, Ahmed,Roveri, Marco,Sebastiani, Roberto

Published in: Zenodo

Datset of automated economic reasoning problems for QE / SMT

Author(s): Mulligan, Casey,Bradford, Russell,Davenport, James H.,England, Matthew,Tonks, Zak

Published in: Zenodo

Dataset supporting 'What Does "Without Loss of Generality" Mean (And How Do We Detect It)'

Author(s): Davenport, James

Published in: Figshare

Dataset supporting the paper: "A Case Study on the Parametric Occurrence of Multiple Steady States"

Author(s): Bradford, Russell,Davenport, James H.,England, Matthew,Errami, Hassan,Gerdt, Vladimir,Grigoriev, Dima,Hoyt, Charles,Košta, Marek,Radulescu, Ovidiu,Sturm, Thomas,Weber, Andreas

Published in: Zenodo

Dataset supporting the paper: "Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks"

Author(s):

Published in: Zenodo

Dataset supporting the paper: Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks

Author(s): England, Matthew,Errami, Hassan,Grigoriev, Dima,Radulescu, Ovidiu,Sturm, Thomas,Weber, Andreas

Published in: Figshare

Dataset supporting the paper 'Integration of SMT-LIB Support into Maple'

Author(s): Forrest, Stephen A

Published in: Zenodo

Dataset supporting the paper: "Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks"

Author(s): Bradford, R.,Davenport, J.H.,England, M.,Erramii, H.,Gerdt, V.,Grigoriev, G.,Hoyt, C.,Kosta, M.,Radulescu, O.,Sturm, T.,Weber, A.

Published in: Zenodo

Dataset supporting "Using Machine Learning to decide when to Precondition Cylindrical Algebraic Decomposition with Groebner Bases"

Author(s): Huang, Zongyan,England, Matthew,Davenport, James H.,Paulson, Lawrence C.

Published in: Figshare

Project information

SC-square

Grant agreement ID: 712689

Project website

Start date

1 July 2016
End date

31 August 2018

Funded under:

H2020-EU.1.2.1.

Overall budget:

€ 499 603,75
EU contribution

€ 499 603,75

Coordinated by:

UNIVERSITY OF BATH

Project information

SC-square

Grant agreement ID: 712689

Project website

Start date

1 July 2016
End date

31 August 2018

Funded under:

H2020-EU.1.2.1.

Overall budget:

€ 499 603,75
EU contribution

€ 499 603,75

Coordinated by:

UNIVERSITY OF BATH

Download

PDF

XML

Last update: 17 August 2017

Record number: 203540

CORDIS

Objective

Coordinator

Participants (10)

Project information

Periodic Reporting for period 2 - SC-square (SC-square - Satisfiability Checking and Symbolic Computation: uniting two communities to solve real problems)

Project information

Deliverables

Publications

Datasets

Project information

Project information

Share this page

Download