An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

First Page		Document Content
Date: 2010-05-19 04:29:26 Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz		An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract Add to Reading List Source URL: ceur-ws.org Download Document from Source Website File Size: 87,56 KB Share Document on Facebook

	2015 IEEE Symposium on Security and Privacy TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits Ebrahim M. Songhori∗ , Siam U. Hussain∗ , Ahmad-Reza Sadeghi† , Thomas Schneider† , Farinaz Kous DocID: 1rrYP - View Document
	Managing Open Access Publication: a system specification Contents 1. Executive Summary DocID: 1rqwT - View Document
	Proc. Asia South Pacific Design Automation Conf. (ASP-DAC), Shanghai, China, vol. 1, Jan. 2005, pp. I/2-I/7. Opportunities and Challenges for Better Than Worst-Case Design Todd Austin, Valeria Bertacco, David Blaauw, an DocID: 1rqwy - View Document
	Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone: DocID: 1roWY - View Document
	The 11th Annual ~ Lines on the Pines The ABC’s of the Pine Barrens Authors & Artists of the NJ Pine Barrens Event ~ Sunday, March 13, 2016 Grand Ballroom at the Renault Winery 72 North Bremen Avenue , Egg Harbor City, DocID: 1rhle - View Document