Towards Conflict-Driven Learning for Virtual Substitution

  • Konstantin Korovin
  • Marek Kos̆ta
  • Thomas Sturm
Conference paper

DOI: 10.1007/978-3-319-10515-4_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8660)
Cite this paper as:
Korovin K., Kos̆ta M., Sturm T. (2014) Towards Conflict-Driven Learning for Virtual Substitution. In: Gerdt V.P., Koepf W., Seiler W.M., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2014. Lecture Notes in Computer Science, vol 8660. Springer, Cham

Abstract

We consider satisfiability modulo theory-solving for linear real arithmetic. Inspired by related work for the Fourier–Motzkin method, we combine virtual substitution with learning strategies. For the first time, we present virtual substitution—including our learning strategies—as a formal calculus. We prove soundness and completeness for that calculus. Some standard linear programming benchmarks computed with an experimental implementation of our calculus show that the integration of learning techniques into virtual substitution gives rise to considerable speedups. Our implementation is open-source and freely available.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Konstantin Korovin
    • 1
  • Marek Kos̆ta
    • 2
  • Thomas Sturm
    • 2
  1. 1.The University of ManchesterUK
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations