DOCSLIB.ORG

Rapid Mathematical Programming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Rapid Mathematical Programming Rapid Mathematical Programming vorgelegt von Diplom-Mathematiker Thorsten Koch Flensburg Fakultät II – Mathematik und Naturwissenschaften der Technischen Universität Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften genehmigte Dissertation Promotionsausschuß Vorsitzender Prof. Dr. Fredi Tröltzsch Berichter/Gutachter Prof. Dr. Martin Grötschel Berichter/Gutachter Prof. Dr. Alexander Martin Tag der wissenschaftlichen Aussprache: 6. Dezember 2004 Berlin 2004 D83 Rapid Mathematical Programming Thorsten Koch Copyright © 2004 by Thorsten Koch All rights reserved. This book was typeset with TEX using LATEX and many further formatting packages. The pictures were prepared using pstricks, xfig, gnuplot and gmt. All numerals in this text are recycled. Für meine Eltern Preface Avoid reality at all costs — fortune(6) As the inclined reader will find out soon enough, this thesis is not about deeply involved mathematics as a mean in itself, but about how to apply mathematics to solve real-world problems. We will show how to shape, forge, and yield our tool of choice to rapidly answer questions of concern to people outside the world of mathematics. But there is more to it. Our tool of choice is software. This is not unusual, since it has become standard practice in science to use software as part of experiments and sometimes even for proofs. But in order to call an experiment scientific it must be reproducible. Is this the case? Regarding software experiments, we have first to distinguish between reproducing and repeating results. The latter means that given the same data and the same programs, running on a similar computer, the results are identical. Reproducing results means to use the same data, but diVerent programs and an arbitrary computer. Today we can reproduce experiments conducted by Leonardo da Vinci in the fif- teenth century. But can we expect even to repeat an experiment that involves a 20-year- old (commercial) program? Or in case we try to reproduce it, using diVerent software and get dissenting results, can we make any conclusions why the results diVer? Software is getting more complex all the time. And by no means it is usually possible to prove the correctness of a specific implementation even if the algorithm employed is known to be correct. But what can we do if the source code of the program is not available at all? How could we assert what the program is really doing? Science is about using the work of fellows. If a proof or experiment is published anybody can use it as part of their work, assumed due credit is given to the author. But how can we build on software that is not freely available? The same questions can be asked for the input data. Without the precise data, com- putational experiments can neither be repeated nor reproduced. Surely part of the prob- lem is that there is no accepted or even adequate way to publish software and data for review in the same way as articles are published. While this thesis by no means gives answers to the above questions1, considerable eVorts were taken to set a good example regarding the correctness of the software and to improve the possibilities for the reader to repeat or reproduce the results shown. Acknowledgements I am deeply indebted to all my friends and colleagues at zib, who supported me in writing this thesis. They showed me that teamwork does not mean to work in a crowd, but to improve the quality of the work by combining the knowledge of many people. I would especially like to thank my supervisor Prof. Martin Grötschel, who started his work in Berlin just at the right time to attract me to combinatorics and optimization. 1 For more information on these topics, see Borwein and Bailey (2004), Greve (2003), Johnson (2002). The environment and challenges he has provided me are the most fertile and stimulating I have encountered so far. This thesis would not have happened without Prof. Alexander Martin, who re- cruited me two times and taught me much of what I know about optimization. Many thanks go to my brave proof readers Monica Ahuna, Andreas Eisenblätter, Sven Krumke, Roland Wessäly and especially Tobias Achterberg, Volkmar Gronau, Syl- wia Markwardt, and Tuomo Takkula. And last but not least, I would like to thank Ines for her inexhaustible support and Keiken for inexhaustibly trying to distract me. Berlin, October 2004 Thorsten Koch Contents 1 Introduction 1 1.1 Three steps to solve a problem . 2 1.1.1 Mathematical workbench . 3 1.1.2 Modeling Language with out-of-the-box solver . 4 1.1.3 Framework . 4 1.1.4 Doing it all yourself . 5 1.2 What's next? . 5 I Design and Implementation 7 2 The Zimpl Modeling Language 9 2.1 Introduction . 9 2.2 Invocation . 16 2.3 Format . 17 2.3.1 Expressions . 17 2.3.2 Sets . 19 2.3.3 Parameters . 21 2.3.4 Variables . 22 2.3.5 Objective . 23 2.3.6 Constraints . 23 2.3.7 Details on sum and forall . 23 2.3.8 Details on if in constraints . 24 2.3.9 Initializing sets and parameters from a file . 24 2.3.10 Function definitions . 26 2.3.11 Extended constraints . 26 2.3.12 Extended functions . 27 2.3.13 The do print and do check commands . 27 2.4 Modeling examples . 27 2.4.1 The diet problem . 28 2.4.2 The traveling salesman problem . 29 2.4.3 The capacitated facility location problem . 30 ix x 2.4.4 The n-queens problem . 32 2.5 Further developments . 36 3 Implementing Zimpl 37 3.1 Notes on software engineering . 37 3.2 Zimpl overview . 40 3.3 The parser . 41 3.3.1 BISON as parser generator . 41 3.3.2 Reserved words . 43 3.3.3 Type checking . 43 3.4 Implementation of sets . 44 3.5 Implementation of hashing . 47 3.6 Arithmetic . 48 3.6.1 Floating-point arithmetic . 48 3.6.2 Rational arithmetic . 51 3.7 Extended modeling . 52 3.7.1 Boolean operations on binary variables . 54 3.7.2 Conditional execution . 54 3.8 The history of Zimpl . 55 3.9 Quality assurance and testing . 56 3.9.1 Regression tests . 56 3.9.2 Software metrics . 58 3.9.3 Statistics . 59 3.9.4 Program checking tools . 59 II Applications 63 4 Facility Location Problems in Telecommunications 65 4.1 TraYc . 66 4.1.1 Erlang linearization . 67 4.1.2 Switching network vs. transport network . 68 4.2 A linear mixed integer model for hierarchical multicommodity capacitated facility location problems . 69 4.3 Planning the access network for the G-WiN . 72 4.4 Planning mobile switching center locations . 78 4.5 Planning fixed network switching center locations . 82 4.5.1 Demands and capacities . 83 4.5.2 Costs . 84 4.5.3 Model . 86 4.5.4 Results . 87 4.6 Conclusion . 93 xi 5 MOMENTUM 95 5.1 UMTS radio interface planning . 95 5.2 Coverage or how to predict pathloss . 97 5.2.1 How much freedom do the choices give us? . 100 5.3 Capacity or how to cope with interference . 102 5.3.1 The CIR inequality . 103 5.3.2 Assumptions and simplifications . 105 5.3.3 Cell load . 105 5.3.4 Pathloss revisited . 106 5.3.5 Assessment . 107 5.4 Models . 109 5.4.1 Site selection . 109 5.4.2 Azimuth (and a little tilting) . 111 5.4.3 Snapshots . 114 5.5 Practice . 118 5.5.1 Conclusion . 122 5.5.2 Acknowledgements . 122 6 Steiner Tree Packing Revisited 123 6.1 Introduction . 123 6.2 Integer programming models . 127 6.2.1 Undirected partitioning formulation . 127 6.2.2 Multicommodity flow formulation . 128 6.2.3 Comparison of formulations . 130 6.3 Valid inequalities . 131 6.4 Computational results . 133 6.4.1 Choosing the right LP solver algorithm . 133 6.4.2 Results for the Knock-knee one-layer model . 135 6.4.3 Results for the node disjoint multi-aligned-layer model . 137 6.5 Outlook . 141 7 Perspectives 147 Appendix 149 A Notation 149 A.1 Decibel explained . 150 B Zimpl Internals 151 B.1 The grammar of the Zimpl parser . 151 B.2 Detailed function statistics . 159 xii C Zimpl Programs 177 C.1 Facility location model with discrete link capacities . 177 C.2 Facility location model with configurations . 178 C.3 UMTS site selection . 179 C.4 UMTS azimuth setting . 180 C.5 UMTS snapshot model . 180.
Load more

Recommended publications
  • The Algebra of Open and Interconnected Systems
    The Algebra of Open and Interconnected Systems Brendan Fong Hertford College University of Oxford arXiv:1609.05382v1 [math.CT] 17 Sep 2016 A thesis submitted for the degree of Doctor of Philosophy in Computer Science Trinity 2016 For all those who have prepared food so I could eat and created homes so I could live over the past four years. You too have laboured to produce this; I hope I have done your labours justice. Abstract Herein we develop category-theoretic tools for understanding network- style diagrammatic languages. The archetypal network-style diagram- matic language is that of electric circuits; other examples include signal flow graphs, Markov processes, automata, Petri nets, chemical reaction networks, and so on. The key feature is that the language is comprised of a number of components with multiple (input/output) terminals, each possibly labelled with some type, that may then be connected together along these terminals to form a larger network. The components form hyperedges between labelled vertices, and so a diagram in this language forms a hypergraph. We formalise the compositional structure by intro- ducing the notion of a hypergraph category. Network-style diagrammatic languages and their semantics thus form hypergraph categories, and se- mantic interpretation gives a hypergraph functor. The first part of this thesis develops the theory of hypergraph categories. In particular, we introduce the tools of decorated cospans and corela- tions. Decorated cospans allow straightforward construction of hyper- graph categories from diagrammatic languages: the inputs, outputs, and their composition are modelled by the cospans, while the `decorations' specify the components themselves.
    [Show full text]
  • IT Project Quality Management
    10 IT Project Quality Management CHAPTER OVERVIEW The focus of this chapter will be on several concepts and philosophies of quality man- agement. By learning about the people who founded the quality movement over the last fifty years, we can better understand how to apply these philosophies and teach- ings to develop a project quality management plan. After studying this chapter, you should understand and be able to: • Describe the Project Management Body of Knowledge (PMBOK) area called project quality management (PQM) and how it supports quality planning, qual ity assurance, quality control, and continuous improvement of the project's products and supporting processes. • Identify several quality gurus, or founders of the quality movement, and their role in shaping quality philosophies worldwide. • Describe some of the more common quality initiatives and management sys tems that include ISO certification, Six Sigma, and the Capability Maturity Model (CMM) for software engineering. • Distinguish between validation and verification activities and how these activi ties support IT project quality management. • Describe the software engineering discipline called configuration management and how it is used to manage the changes associated with all of the project's deliverables and work products. • Apply the quality concepts, methods, and tools introduced in this chapter to develop a project quality plan. GLOBAL TECHNOLOGY SOLUTIONS It was mid-afternoon when Tim Williams walked into the GTS conference room. Two of the Husky Air team members, Sitaraman and Yan, were already seated at the 217 218 CHAPTER 10 / IT PROJECT QUALITY MANAGEMENT conference table. Tim took his usual seat, and asked "So how did the demonstration of the user interface go this morning?" Sitaraman glanced at Yan and then focused his attention on Tim's question.
    [Show full text]
  • Computer Algebra and Mathematics with the HP40G Version 1.0
    Computer Algebra and Mathematics with the HP40G Version 1.0 Renée de Graeve Lecturer at Grenoble I Exact Calculation and Mathematics with the HP40G Acknowledgments It was not believed possible to write an efficient program for computer algebra all on one’s own. But one bright person by the name of Bernard Parisse didn’t know that—and did it! This is his program for computer algebra (called ERABLE), built for the second time into an HP calculator. The development of this calculator has led Bernard Parisse to modify his program somewhat so that the computer algebra functions could be edited and cause the appropriate results to be displayed in the Equation Editor. Explore all the capabilities of this calculator, as set out in the following pages. I would like to thank: • Bernard Parisse for his invaluable counsel, his remarks on the text, his reviews, and for his ability to provide functions on demand both efficiently and graciously. • Jean Tavenas for the concern shown towards the completion of this guide. • Jean Yves Avenard for taking on board our requests, and for writing the PROMPT command in the very spirit of promptness—and with no advance warning. (refer to 6.4.2.). © 2000 Hewlett-Packard, http://www.hp.com/calculators The reproduction, distribution and/or the modification of this document is authorised according to the terms of the GNU Free Documentation License, Version 1.1 or later, published by the Free Software Foundation. A copy of this license exists under the section entitled “GNU Free Documentation License” (Chapter 8, p. 141).
    [Show full text]
  • CAS, an Introduction to the HP Computer Algebra System
    CAS, An introduction to the HP Computer Algebra System Background Any mathematician will quickly appreciate the advantages offered by a CAS, or Computer Algebra System1, which allows the user to perform complex symbolic algebraic manipulations on the calculator. Algebraic integration by parts and by substitution, the solution of differential equations, inequalities, simultaneous equations with algebraic or complex coefficients, the evaluation of limits and many other problems can be solved quickly and easily using a CAS. Importantly, solutions can be obtained as exact values such as 5−1, 25≤ x < or 4π rather than the usual decimal values given by numeric methods of successive approximation. Values can be displayed to almost any degree of accuracy required, allowing the user to view, for example, the exact value of a number such as 100 factorial. The HP CAS The HP CAS system was created by Bernard Parisse, Université de Grenoble, for the HP 49g calculator. It was improved and adapted for inclusion on the HP 40g with the help of Renée De Graeve, Jean-Yves Avenard and Jean Tavenas2. The HP CAS system offers the user a vast array of functions and abilities as well as an easy user interface which displays equations as they appear on the page. It also includes the ability to display many algebraic calculations in ‘step-by-step’ mode, making it an invaluable teaching tool in universities and schools. Functions are grouped by category and accessed via menus at the bottom of the screen. Copyright© 2005, Applications in Mathematics Learning to use the CAS Learning to use the CAS is very easy but, as with any powerful tool, truly effective use requires familiarity and time.
    [Show full text]
  • Access to Communications Technology
    A Access to Communications Technology ABSTRACT digital divide: the Pew Research Center reported in 2019 that 42 percent of African American adults and Early proponents of digital communications tech- 43 percent of Hispanic adults did not have a desk- nology believed that it would be a powerful tool for top or laptop computer at home, compared to only disseminating knowledge and advancing civilization. 18 percent of Caucasian adults. Individuals without While there is little dispute that the Internet has home computers must instead use smartphones or changed society radically in a relatively short period public facilities such as libraries (which restrict how of time, there are many still unable to take advantage long a patron can remain online), which severely lim- of the benefits it confers because of a lack of access. its their ability to fill out job applications and com- Whether the lack is due to economic, geographic, or plete homework effectively. demographic factors, this “digital divide” has serious There is also a marked divide between digital societal repercussions, particularly as most aspects access in highly developed nations and that which of life in the twenty-first century, including banking, is available in other parts of the world. Globally, the health care, and education, are increasingly con- International Telecommunication Union (ITU), a ducted online. specialized agency within the United Nations that deals with information and communication tech- DIGITAL DIVIDE nologies (ICTs), estimates that as many as 3 billion people living in developing countries may still be In its simplest terms, the digital divide refers to the gap unconnected by 2023.
    [Show full text]
  • SMT Solving in a Nutshell
    SAT and SMT Solving in a Nutshell Erika Abrah´ am´ RWTH Aachen University, Germany LuFG Theory of Hybrid Systems February 27, 2020 Erika Abrah´ am´ - SAT and SMT solving 1 / 16 What is this talk about? Satisfiability problem The satisfiability problem is the problem of deciding whether a logical formula is satisfiable. We focus on the automated solution of the satisfiability problem for first-order logic over arithmetic theories, especially using SAT and SMT solving. Erika Abrah´ am´ - SAT and SMT solving 2 / 16 CAS SAT SMT (propositional logic) (SAT modulo theories) Enumeration Computer algebra DP (resolution) systems [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62] Decision procedures NP-completeness [Cook’71] for combined theories CAD Conflict-directed [Shostak’79] [Nelson, Oppen’79] backjumping Partial CAD Virtual CDCL [GRASP’97] [zChaff’04] DPLL(T) substitution Watched literals Equalities and uninterpreted Clause learning/forgetting functions Variable ordering heuristics Bit-vectors Restarts Array theory Arithmetic Decision procedures for first-order logic over arithmetic theories in mathematical logic 1940 Computer architecture development 1960 1970 1980 2000 2010 Erika Abrah´ am´ - SAT and SMT solving 3 / 16 SAT SMT (propositional logic) (SAT modulo theories) Enumeration DP (resolution) [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62] Decision procedures NP-completeness [Cook’71] for combined theories Conflict-directed [Shostak’79] [Nelson, Oppen’79] backjumping CDCL [GRASP’97] [zChaff’04]
    [Show full text]
  • Programming for Computations – Python
    15 Svein Linge · Hans Petter Langtangen Programming for Computations – Python Editorial Board T. J.Barth M.Griebel D.E.Keyes R.M.Nieminen D.Roose T.Schlick Texts in Computational 15 Science and Engineering Editors Timothy J. Barth Michael Griebel David E. Keyes Risto M. Nieminen Dirk Roose Tamar Schlick More information about this series at http://www.springer.com/series/5151 Svein Linge Hans Petter Langtangen Programming for Computations – Python A Gentle Introduction to Numerical Simulations with Python Svein Linge Hans Petter Langtangen Department of Process, Energy and Simula Research Laboratory Environmental Technology Lysaker, Norway University College of Southeast Norway Porsgrunn, Norway On leave from: Department of Informatics University of Oslo Oslo, Norway ISSN 1611-0994 Texts in Computational Science and Engineering ISBN 978-3-319-32427-2 ISBN 978-3-319-32428-9 (eBook) DOI 10.1007/978-3-319-32428-9 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2016945368 Mathematic Subject Classification (2010): 26-01, 34A05, 34A30, 34A34, 39-01, 40-01, 65D15, 65D25, 65D30, 68-01, 68N01, 68N19, 68N30, 70-01, 92D25, 97-04, 97U50 © The Editor(s) (if applicable) and the Author(s) 2016 This book is published open access. Open Access This book is distributed under the terms of the Creative Commons Attribution-Non- Commercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, duplication, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, a link is provided to the Creative Commons license and any changes made are indicated.
    [Show full text]
  • Modeling and Analysis of Hybrid Systems
    Building Bridges between Symbolic Computation and Satisfiability Checking Erika Abrah´ am´ RWTH Aachen University, Germany in cooperation with Florian Corzilius, Gereon Kremer, Stefan Schupp and others ISSAC’15, 7 July 2015 Photo: Prior Park, Bath / flickr Liam Gladdy What is this talk about? Satisfiability problem The satisfiability problem is the problem of deciding whether a logical formula is satisfiable. We focus on the automated solution of the satisfiability problem for first-order logic over arithmetic theories, especially on similarities and differences in symbolic computation and SAT and SMT solving. Erika Abrah´ am´ - SMT solving and Symbolic Computation 2 / 39 CAS SAT SMT (propositional logic) (SAT modulo theories) Enumeration Computer algebra DP (resolution) systems [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62] Decision procedures NP-completeness [Cook’71] for combined theories CAD Conflict-directed [Shostak’79] [Nelson, Oppen’79] backjumping Partial CAD Virtual CDCL [GRASP’97] [zChaff’04] DPLL(T) substitution Watched literals Equalities and uninterpreted Clause learning/forgetting functions Variable ordering heuristics Bit-vectors Restarts Array theory Arithmetic Decision procedures for first-order logic over arithmetic theories in mathematical logic 1940 Computer architecture development 1960 1970 1980 2000 2010 Erika Abrah´ am´ - SMT solving and Symbolic Computation 3 / 39 SAT SMT (propositional logic) (SAT modulo theories) Enumeration DP (resolution) [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62]
    [Show full text]
  • Easy-To-Use Chinese MTEX Suite Hongbin Ma
    The PracTEX Journal, 2012, No. 1 Article revision 2012/06/25 Easy-to-use Chinese MTEX Suite Hongbin Ma Email cnedu.bit.mathmhb@ Address School of Automation, Beijing Institute of Technology, Beijing 100081, P. R. China 1 Motivation of Developing MTEX As the main developer of Chinese MTEX Suite , or simply MTEX [1], I started to fall in love with TEX[2] and LATEX[3] in 2002 when I was still a graduate student major- ing in mathematics and cybernetics at the Academy of Mathematics and Systems Science, Chinese Academy of Sciences. At that time, recommended by some se- nior students, I started to use Chinese CTEX Suite , or simply CTEX[4], which was maintained by Dr. Lingyun Wu[5], a researcher in our academy, and is roughly a collection of pre-configured MiKTEX system[6] packaged with other tools such as customized WinEdt[7] for Chinese TEXers. CTEX brings significant benefits to China TEX users and it helps much to popularize the use of LATEX in China, es- pecially in the educational and academic areas with large requirement on mathe- matics typesetting. Furthermore, at that time, CTEX provides one way to typeset Chinese documents easily with LATEX and CCT [8](Chinese-Typesetting-System ), which was initially developed by another researcher Prof. Linbo Zhang[9] in our academy since 1998 for the purpose of typesetting Chinese with LATEX. Besides CCT system, another system called TY (Tian-Yuan ) system [10] was invented by a group in Eastern China Normal University so as to overcome the difficulties of typesetting Chinese with LATEX using different idea.
    [Show full text]
  • Robust Computer Algebra, Theorem Proving, and Oracle AI
    Robust Computer Algebra, Theorem Proving, and Oracle AI Gopal P. Sarma∗ Nick J. Hayyz School of Medicine, Emory University, Atlanta, GA USA Vicarious FPC, San Francisco, CA USA Abstract In the context of superintelligent AI systems, the term “oracle” has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research problems related to oracles which align with long-term research goals of AI safety. We examine existing question answering systems and argue that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles. On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem provers, systems which have largely been developed independent of one another, provide a concrete set of problems related to the notion of provable safety that has emerged in the AI safety community. We review approaches to interfacing CASs with theorem provers, describe well-defined architectural deficiencies that have been identified with CASs, and suggest possible lines of research and practical software projects for scientists interested in AI safety. I. Introduction other hand, issues of privacy and surveillance, access and inequality, or economics and policy are Recently, significant public attention has been also of utmost importance and are distinct from drawn to the consequences of achieving human- the specific technical challenges posed by most level artificial intelligence.
    [Show full text]
  • On the Atkinson Formula for the Ζ Function
    On the Atkinson formula for the ζ function Daniele Dona, Sebastian Zuniga Alterman June 23, 2021 Abstract Thanks to Atkinson (1938), we know the first two terms of the asymptotic for- mula for the square mean integral value of the Riemann zeta function ζ on the criti- cal line. Following both his work and the approach of Titchmarsh (1986), we present an explicit version of the Atkinson formula, improving on a recent bound by Simoniˇc 1 3 (2020). Moreover, we extend the Atkinson formula to the range ℜ(s) ∈ 4 , 4 , giv- ing an explicit bound for the square mean integral value of ζ and improving on a bound by Helfgott and the authors (2019). We use mostly classical tools, such as the approximate functional equation and the explicit convexity bounds of the zeta function given by Backlund (1918). 1 Introduction The search for meaningful bounds for ζ(s) in the range 0 < (s) < 1 has spanned more ℜ than a century. The classical conjecture on L∞ bounds, called the Lindel¨of hypothesis, 1 ε states that ζ 2 + it = oε( t ) for any ε > 0; by Hadamard’s three-line theorem and | | ε the functional equation of ζ, this implies in particular that ζ(τ + it) = oε( t ) for 1 | | | | 1 2 τ+ε 1 2 <τ< 1 and ζ(τ + it) = oε( t − ) for 0 <τ< 2 . | 1 | τ | | − +ε Bounds of order t 2 are called convexity bounds, and bounds with even lower exponent are called subconvexity| | bounds. The current best bound is due to Bourgain [6], 13 1 84 +ε who showed that ζ 2 + it = oε( t ).
    [Show full text]
  • Satisfiability Checking and Symbolic Computation
    Satisfiability Checking and Symbolic Computation E. Abrah´am´ 1, J. Abbott11, B. Becker2, A.M. Bigatti3, M. Brain10, B. Buchberger4, A. Cimatti5, J.H. Davenport6, M. England7, P. Fontaine8, S. Forrest9, A. Griggio5, D. Kroening10, W.M. Seiler11 and T. Sturm12 1RWTH Aachen University, Aachen, Germany; 2Albert-Ludwigs-Universit¨at, Freiburg, Germany; 3Universit`adegli studi di Genova, Italy; 4Johannes Kepler Universit¨at, Linz, Austria; 5Fondazione Bruno Kessler, Trento, Italy; 6University of Bath, Bath, U.K.; 7Coventry University, Coventry, U.K.; 8LORIA, Inria, Universit´ede Lorraine, Nancy, France; 9Maplesoft Europe Ltd; 10University of Oxford, Oxford, U.K.; 11Universit¨at Kassel, Kassel, Germany; 12CNRS, LORIA, Nancy, France and Max-Planck-Institut f¨ur Informatik, Saarbr¨ucken, Germany. Abstract 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 con- nected. 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, identi- fying 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. 1 Introduction We describe a new project to bring together the communities of Symbolic Computation and Satisfiability Checking into a new joint community, SC2. Both communities have long histories, as illustrated by the tool development timeline in Figure 1, but traditionally they do not interact much even though they are now individually addressing similar problems in non-linear algebra.
    [Show full text]