U NIVERSITAT DE G IRONA ` ` D EPARTAMENT D ’I NFORM ATICA , M ATEM ATICA

First Page		Document Content
Date: 2016-06-09 08:09:17 Theoretical computer science Logic Mathematical logic Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Automated planning and scheduling Solver Planning Domain Definition Language		U NIVERSITAT DE G IRONA ` ` D EPARTAMENT D ’I NFORM ATICA , M ATEM ATICA Add to Reading List Source URL: icaps16.icaps-conference.org Download Document from Source Website File Size: 114,42 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