SC2: Satisfiability Checking Meets Symbolic Computation (Project Paper)

被引：23

作者：

Abraham, Erika ^{[1
]}

Abbott, John ^{[12
]}

Becker, Bernd ^{[2
]}

Bigatti, Anna M. ^{[3
]}

Brain, Martin ^{[11
]}

Buchberger, Bruno ^{[4
]}

Cimatti, Alessandro ^{[5
]}

Davenport, James H. ^{[6
]}

England, Matthew ^{[7
]}

Fontaine, Pascal ^{[9
]}

Forrest, Stephen ^{[10
]}

Griggio, Alberto ^{[5
]}

Kroening, Daniel ^{[11
]}

Seiler, Werner M. ^{[12
]}

Sturm, Thomas ^{[8
,13
]}

机构：

[1] Rhein Westfal TH Aachen, Aachen, Germany

[2] Albert Ludwigs Univ, Freiburg, Germany

[3] Univ Genoa, Genoa, Italy

[4] Johannes Kepler Univ Linz, Linz, Austria

[5] Fdn Bruno Kessler, Trento, Italy

[6] Univ Bath, Bath, Avon, England

[7] Coventry Univ, Coventry, W Midlands, England

[8] CNRS, LORIA, Inria, Nancy, France

[9] Univ Lorraine, LORIA, Inria, Nancy, France

[10] Maplesoft Europe Ltd, Aachen, Germany

[11] Univ Oxford, Oxford, England

[12] Univ Kassel, Kassel, Germany

[13] Max Planck Inst Informat, Saarbrucken, Germany

来源：

INTELLIGENT COMPUTER MATHEMATICS | 2016年 / 9791卷

关键词：

Logical problems; Symbolic computation; Computer algebra systems; Satisfiability checking; Satisfiability modulo theories; QUANTIFIER ELIMINATION; ALGORITHM;

D O I：

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

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Symbolic Computation and Satisfiability Checking are two research areas, both having their individual scientific focus but sharing also common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite their commonalities, the two communities are rather weakly connected. The aim of our newly accepted SC2 project (H2020-FETOPEN-CSA) is to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap from theory along the way to tools and ( industrial) applications. In this paper we report on the aims and on the first activities of this project, and formalise some relevant challenges for the unified SC2 community.

引用

页码：28 / 43

页数：16

共 58 条

[1]

Abbott J., COCOA 5 SYSTEM DOING

[2] Building Bridges between Symbolic Computation and Satisfiability Checking [J].

Abraham, Erika .

PROCEEDINGS OF THE 2015 ACM ON INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC'15), 2015, :1-6

[3]

[Anonymous], THESIS

[4]

[Anonymous], 2012, P 37 INT S SYMBOLIC

[5]

[Anonymous], MACAULAY2 SOFTWARE S

[6]

Arai N.H., 2014, P 39 INT S SYMB ALG, P1, DOI [10.1145/2608628.2627488., DOI 10.1145/2608628.2627488]

[7]

Barrett Clark, 2011, Computer Aided Verification. Proceedings 23rd International Conference, CAV 2011, P171, DOI 10.1007/978-3-642-22110-1_14

[8]

Barrett C, 2014, 3 SMITH I IND MATH S

[9]

Barrett C., 2010, The satisfiability modulo theories library (SMT-LIB)

[10] Satisfiability modulo theories [J].

Barrett, Clark ;

Sebastiani, Roberto ;

Seshia, Sanjit A. ;

Tinelli, Cesare .

Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) :825-885

← 1 2 3 4 5 6 →