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

	A Case for Query-driven Predicate Answer Set Programming (Position Paper) Gopal Gupta Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin Department of Computer Science The University of Texas at Dallas DocID: 1xVE0 - View Document
	Answer Set Programming in a Nutshell Torsten Schaub University of Potsdam Torsten Schaub (KRR@UP) DocID: 1trGw - View Document
	Theory and Practice of Answer Set Programming Esra Erdem1 , Joohyung Lee2 , and Yuliya Lierler3 1 Sabanci 2 Arizona 3 University DocID: 1tnHD - View Document
	Towards a Type Discipline for Answer Set Programming Camillo Fiorentini, Alberto Momigliano, and Mario Ornaghi Dipartimento di Scienze dell’Informazione, Universit`a degli Studi di Milano, Italy {fiorenti,momiglia,orna DocID: 1tnpQ - View Document
	Technical Communications of the International Conference on Logic Programming, 2010 (Edinburgh), pp. 265–269 http://www.floc-conference.org/ICLP-home.html TOWARDS A GENERAL ARGUMENTATION SYSTEM BASED ON ANSWER-SET PROG DocID: 1tmTo - View Document