Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Foreword

Foreword Math.Comput.Sci. (2019) 13:459–460 https://doi.org/10.1007/s11786-019-00411-w Mathematics in Computer Science James H. Davenport · Laura Kovacs · Daniela Zaharie Published online: 30 October 2019 © Springer Nature Switzerland AG 2019 This special issue contains a group of four papers which are extended versions of those presented at the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) held in Timisoara, Romania in September 2016. The content of these papers reflect rather well the focus of the SYNASC symposium which is organized in six tracks corresponding to Symbolic Computation, Numerical Computing, Logic and Programming, Artificial Intelligence, Distributed Computing and Advances in the Theory of Computation. The paper Optimal Symmetry Breaking for Graph Problems focuses on automating reasoning about graph problems. Such reasoning requires in general exploring and solving graph properties that are isomorphic, that is symmetric, to the graph problem under study. To avoid needless exploration of isomorphic subproblems in the search space while proving a given graph property, this paper studies symmetry breaking techniques and present several approaches to compute and analyze symmetry-breaking formulas. In particular, the paper introduces perfect/optimal approaches to symmetry breaking in SAT solving for graph problems of order up to five. The paper Using http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

Foreword

Download PDF
2 pages

Loading next page...
 
/lp/springer-journals/foreword-FRltJBzuM0

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Journals
Copyright
Copyright © 2019 by Springer Nature Switzerland AG
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-019-00411-w
Publisher site
See Article on Publisher Site

Abstract

Math.Comput.Sci. (2019) 13:459–460 https://doi.org/10.1007/s11786-019-00411-w Mathematics in Computer Science James H. Davenport · Laura Kovacs · Daniela Zaharie Published online: 30 October 2019 © Springer Nature Switzerland AG 2019 This special issue contains a group of four papers which are extended versions of those presented at the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) held in Timisoara, Romania in September 2016. The content of these papers reflect rather well the focus of the SYNASC symposium which is organized in six tracks corresponding to Symbolic Computation, Numerical Computing, Logic and Programming, Artificial Intelligence, Distributed Computing and Advances in the Theory of Computation. The paper Optimal Symmetry Breaking for Graph Problems focuses on automating reasoning about graph problems. Such reasoning requires in general exploring and solving graph properties that are isomorphic, that is symmetric, to the graph problem under study. To avoid needless exploration of isomorphic subproblems in the search space while proving a given graph property, this paper studies symmetry breaking techniques and present several approaches to compute and analyze symmetry-breaking formulas. In particular, the paper introduces perfect/optimal approaches to symmetry breaking in SAT solving for graph problems of order up to five. The paper Using

Journal

Mathematics in Computer Science – Springer Journals

Published: Oct 30, 2019

There are no references for this article.