2-EXPTIME

#	Item
1	An ExpTime Tableau Method for Dealing with Nominals and Quantified Number Restrictions in Deciding the Description Logic SHOQ Linh Anh Nguyen1,2 and Joanna Goli´ nska-Pilarek3 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2013-09-03 07:12:26 Automated theorem proving Method of analytic tableaux
2	Lecture 5: Introduction to Complexity TheoryComplexity Theory Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2014-10-16 13:22:26 Applied mathematics P EXPTIME EXPSPACE L FO 2-EXPTIME Theoretical computer science Computational complexity theory Complexity classes
3	IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE arXiv:1402.0705v2 [cs.LO] 25 Sep[removed]SYLVAIN SCHMITZ Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2015-03-04 05:44:40 Deduction Rules of inference Converse Traditional logic Entailment Reachability Sequent calculus Implicational propositional calculus Logic Propositional calculus Proof theory
4	PDF Document Add to Reading List Source URL: www.informatik.uni-freiburg.de Language: English - Date: 2003-05-27 08:56:44 Applied mathematics EXPSPACE 2-EXPTIME NP Automated planning and scheduling EXPTIME Non-deterministic Turing machine DSPACE Alternating Turing machine Theoretical computer science Computational complexity theory Complexity classes