3 Complexity of Reasoning Francesco M. Donini

First Page		Document Content
Date: 2011-09-08 09:53:48 Complexity classes Finite model theory Boolean algebra Predicate logic Boolean satisfiability problem True quantified Boolean formula NP-complete Description logic FO Theoretical computer science Computational complexity theory Applied mathematics		3 Complexity of Reasoning Francesco M. Donini Add to Reading List Source URL: www.inf.unibz.it Download Document from Source Website File Size: 339,30 KB Share Document on Facebook

	Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007 DocID: 1xVOl - View Document
	System Feature Description: Importing Refutations into the GAPT Framework PxTP Workshop, Manchester Cvetan Dunchev, Alexander Leitsch, Tomer Libal, Martin Riener, Mikheil Rukhaia, Daniel Weller and Bruno Woltzenlogel-Pal DocID: 1xVjW - View Document
	System Description: GAPT 2.0? Gabriel Ebner1 , Stefan Hetzl1 , Giselle Reis2 , Martin Riener3 , Simon Wolfsteiner1 , and Sebastian Zivota1 1 Vienna University of Technology DocID: 1xUHR - View Document
	System Feature Description: Importing Refutations into the GAPT Framework Cvetan Dunchev Alexander Leitsch Tomer Libal DocID: 1xUgI - View Document
	Transforming Fuzzy Description Logic ALCFL into Classical Description Logic ALCH Yining Wu Overseeing Professor: Prof. Steffen H¨olldobler DocID: 1veZ0 - View Document