Do Portfolio Solvers Harm? Christoph Weidenbach Max Planck Insitute for Informatics Saarland Informatics CampusSaarbr¨ ucken, Germany

First Page		Document Content
Date: 2017-08-02 07:37:32 Theoretical computer science Logic in computer science Formal methods Automated reasoning Constraint programming Automated theorem proving Satisfiability modulo theories Solver Answer set programming Satz Model checking Algorithm selection		Do Portfolio Solvers Harm? Christoph Weidenbach Max Planck Insitute for Informatics Saarland Informatics CampusSaarbr¨ ucken, Germany Add to Reading List Source URL: www.cs.man.ac.uk Download Document from Source Website File Size: 187,20 KB Share Document on Facebook

	Satisfiability Modulo Theories Competition (SMT-COMP) 2014: Rules and Procedures David R. Cok GrammaTech, Inc. Ithaca, NY (USA) DocID: 1xVTO - View Document
	10th International Satisfiability Modulo Theories Competition (SMT-COMP 2015): Rules and Procedures Sylvain Conchon Paris-Sud University France DocID: 1xVRN - View Document
	13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg Germany DocID: 1xVxR - View Document
	Challenges in Satisfiability Modulo Theories Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio? Abstract. Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo DocID: 1xVwT - View Document
	11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures Sylvain Conchon Paris-Sud University France DocID: 1xVsn - View Document