Satisfiability Checking and Symbolic Computation

被引：3

作者：

Abraham, E. ^{[1
]}

Abbott, J. ^{[11
]}

Becker, B. ^{[2
]}

Bigatti, A. M. ^{[3
]}

Brain, M. ^{[10
]}

Buchberger, B. ^{[4
]}

Cimatti, A. ^{[5
]}

Davenport, J. H. ^{[6
]}

England, M. ^{[7
]}

Fontaine, P. ^{[8
]}

Forrest, S. ^{[9
]}

Griggio, A. ^{[5
]}

Kroening, D. ^{[10
]}

Seiler, W. M. ^{[11
]}

Sturm, T. ^{[12
,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] Univ Lorraine, Inria, LORIA, Nancy, France

[9] Maplesoft Europe Ltd, Cambridge, England

[10] Univ Oxford, Oxford, England

[11] Univ Kassel, Kassel, Germany

[12] LORIA, CNRS, Nancy, France

[13] Max Planck Inst Informat, Saarbrucken, Germany

来源：

ACM COMMUNICATIONS IN COMPUTER ALGEBRA | 2016年 / 50卷 / 04期

基金：

欧盟地平线“2020”;

关键词：

Formal methods;

D O I：

10.1145/3055282.3055285

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC2 to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.

引用

页码：145 / 147

页数：3

共 4 条

[1]

Abraham E., P CICM 2016 IN PRESS

[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] Satisfiability modulo theories [J].

Barrett, Clark ;

Sebastiani, Roberto ;

Seshia, Sanjit A. ;

Tinelli, Cesare .

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

[4]

Platzer A, 2009, LECT NOTES ARTIF INT, V5663, P485, DOI 10.1007/978-3-642-02959-2_35

← 1 →