D. Bibliography, H. Achlioptas, C. Jia, and ?. Moore, Hiding satisfying assignments: Two are better than one, pp.503046-138, 2005.

M. Agrawal, N. Kayal, N. Saxena, and ?. , PRIMES is in P, Annals of Mathematics, vol.160, issue.2, pp.781-793, 2004.
DOI : 10.4007/annals.2004.160.781

M. Alekhnovich, E. A. Hirsch, D. Itsykson, and ?. , Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas, Journal of Automated Reasoning, vol.8, issue.1/2, pp.51-72, 2005.
DOI : 10.1007/s10817-005-9006-x

. Areces, Logic engineering. the case of description and hybrid logics, p.48, 2000.

C. Areces, D. Gorín, and ?. , Coinductive models and normal forms for modal logics, Logic Journal of the IGPL, p.93, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00519038

C. Areces, D. Gorín, and ?. , Ordered resolution with selection for h(@), Proceedings of LPAR 2004, pp.125-141, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000332

C. Areces, J. Heguiabehere, and ?. , hGen: A random CNF formula generator for hybrid languages, Methods for Modalities 3 -M4M-3, p.139, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00000317

C. Areces, J. Heguiabehere, and ?. , HyLoRes 1.0: Direct Resolution for Hybrid Logics, Proceedings of Methods for Modalities, p.107, 2001.
DOI : 10.1007/3-540-45620-1_14
URL : https://hal.archives-ouvertes.fr/inria-00000322

C. Areces, P. Blackburn, and M. Marx, A Road-Map on Complexity for Hybrid Logics, Proceedings of the 8th Annual Conference of the EACSL, pp.307-321, 1999.
DOI : 10.1007/3-540-48168-0_22
URL : https://hal.archives-ouvertes.fr/inria-00000337

C. Areces, P. Blackburn, and M. Marx, The computational complexity of hybrid temporal logics, Logic Journal of IGPL, vol.8, issue.5, pp.653-679, 2000.
DOI : 10.1093/jigpal/8.5.653
URL : https://hal.archives-ouvertes.fr/inria-00000304

C. Areces, P. Blackburn, M. Marx, and ?. , Abstract, The Journal of Symbolic Logic, vol.XLI, issue.03, pp.977-1010, 2001.
DOI : 10.1093/jigpal/8.5.653

C. Areces, D. Gorín, A. Lorenzo, and M. P. Rodríguez, Testing provers on a grid -framework description, Proceedings of the 22nd International Workshop on Description Logics CEUR Workshop Proceedings, p.127, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423068

C. Areces, D. Gorín, A. Lorenzo, and M. P. Rodriguez, Testing Provers on a Grid -Framework Description, Proceedings of the 22nd International Workshop on Description Logics -DL 2009, p.124, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423068

S. Arora and B. , Barak ? Computational complexity: A modern approach, pp.31-32, 2009.
DOI : 10.1017/cbo9780511804090

F. Baader and U. Sattler, An overview of tableau algorithms for description logics, Studia Logica, vol.69, pp.2001-78, 2000.

F. Baader and M. , Cardinality restrictions on concepts, Artificial Intelligence, vol.88, issue.1-2, pp.195-213, 1996.
DOI : 10.1016/S0004-3702(96)00010-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.9948

P. Balbiani, S. Demri, and ?. , Prefixed tableaux systems for modal logics with enriched languages, Proceedings of the fifteenth international joint conference on artificial intelligence , IJCAI-97, pp.190-195, 1997.

P. Balbiani, A. Herzig, and ?. , Talkin'bout Kripke models, p.138, 2007.

F. Bassino, J. David, and C. Nicaud, Enumeration and random generation of possibly incomplete deterministic automata, Pure Mathematics and Applications, p.139, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00452748

E. W. Beth, Semantic entailment and formal derivability, Proceedings of the Section of Sciences, pp.309-342, 1955.

T. Bittner, M. Donnelly, and ?. , Logical properties of foundational relations in bio-ontologies, Artificial Intelligence in Medicine, vol.39, issue.3, pp.197-216, 2007.
DOI : 10.1016/j.artmed.2006.12.005

. Blackburn, Internalizing labelled deduction, Journal of Logic and Computation, vol.10, issue.1, pp.137-168, 2000.
DOI : 10.1093/logcom/10.1.137
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.5616

. Blackburn, Nominal tense logic., Notre Dame Journal of Formal Logic, vol.34, issue.1, pp.56-83, 1993.
DOI : 10.1305/ndjfl/1093634564

P. Blackburn, J. Seligman, and ?. , Hybrid languages, Journal of Logic, Language and Information, vol.57, issue.3, pp.251-272, 1995.
DOI : 10.1007/BF01049415

P. Blackburn and M. , de Rijke and Y. Venema ? Modal logic, p.92, 2001.

P. Blackburn, J. Van-benthem, and ?. , 1 Modal logic: a semantic perspective, Handbook of Modal Logic, p.50, 2006.
DOI : 10.1016/S1570-2464(07)80004-8

P. Blackburn and M. , de Rijke and Y. Venema ? Modal logic, Cambridge Tracts in Theoretical Computer Scie, vol.53, p.42, 2001.

T. Bolander, P. Blackburn, and ?. , Termination for Hybrid Tableaus, Journal of Logic and Computation, vol.17, issue.3, pp.517-554, 2007.
DOI : 10.1093/logcom/exm014
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9672

T. Bolander and P. Blackburn, Terminating Tableau Calculi for Hybrid Logics Extending K, Electronic Notes in Theoretical Computer Science, vol.231, issue.58, p.87, 2007.
DOI : 10.1016/j.entcs.2009.02.027

T. Bolander, T. Brä-uner, and ?. , Tableau-based Decision Procedures for Hybrid Logic, Journal of Logic and Computation, vol.16, issue.6, pp.737-763, 2006.
DOI : 10.1093/logcom/exl008

R. Brummayer and A. Biere, Fuzzing and delta-debugging SMT solvers, Proceedings of the 7th International Workshop on Satisfiability Modulo Theories, SMT '09, pp.1-5, 2009.
DOI : 10.1145/1670412.1670413
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.625

S. Cerrito, M. C. Mayer, and ?. , Terminating tableaux for HL(@) without loopchecking, p.58, 2007.

S. Cerrito, M. C. Mayer, and ?. , An efficient approach to nominal equalities in hybrid logic tableaux, Journal of Applied Non-Classical Logics, vol.1617, issue.4, p.58, 2010.
DOI : 10.1093/logcom/9.3.385
URL : https://hal.archives-ouvertes.fr/hal-00666645

A. Cobham and ?. , The intrinsic computational difficulty of functions " , Logic, Methodology and Philosophy of Science, proceedings of the second International Congress, Jerusalem, p.34, 1964.

S. A. Cook and ?. , The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. , Stein ? Introduction to algorithms, p.69, 2001.

M. Davis, H. Putnam, and ?. , A Computing Procedure for Quantification Theory, Journal of the ACM, vol.7, issue.3, pp.201-215, 1960.
DOI : 10.1145/321033.321034

M. Davis, G. Logemann, D. Loveland, and ?. , A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

G. , D. Giacomo, and M. Lenzerini, Description logics with inverse roles, functional restrictions, and n-ary relations, Proc. of JELIA-94, pp.332-346, 1994.

D. Giacomo and F. Massacci, Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL, Information and Computation, vol.162, issue.1-2, pp.117-137, 2000.
DOI : 10.1006/inco.1999.2852

M. De-rijke, Abstract, The Journal of Symbolic Logic, vol.36, issue.02, pp.566-584, 1992.
DOI : 10.1007/978-94-009-8384-7_3

?. De-rijke, A note on graded modal logic, Studia Logica, vol.64, issue.2, pp.271-283, 2000.
DOI : 10.1023/A:1005245900406

. Demri, A simple tableau system for the logic of elsewhere, Lecture Notes in Computer Science, vol.1071, issue.42, pp.177-192, 1996.
DOI : 10.1007/3-540-61208-4_12

J. Faddoul, N. Farsinia, V. Haarslev, and R. , A hybrid tableau algorithm for ALCQ, Proc. of ECAI, pp.725-726, 2008.

L. F. Del-cerro, D. Fauthoux, O. Gasquet, A. Herzig, D. Longin et al., Lotrec: The Generic Tableau Prover for Modal and Description Logics, International Joint Conference on Automated Reasoning, pp.453-458, 2001.
DOI : 10.1007/3-540-45744-5_38

S. Figueira, D. Gorín, and ?. , On the size of shortest modal descriptions, Proceedings of AIML 2010, p.56, 2010.

?. Fine, In so many possible worlds., Notre Dame Journal of Formal Logic, vol.13, issue.4, pp.516-520, 1972.
DOI : 10.1305/ndjfl/1093890715
URL : http://projecteuclid.org/download/pdf_1/euclid.ndjfl/1093890715

T. Gardiner, I. Horrocks, D. Tsarkov, and ?. , Automated benchmarking of description logic reasoners, Proceedings of the 2006 Description Logic Workshop CEUR, p.138, 2006.

T. Gardiner and D. , Framework for an Automated Comparison of Description Logic Reasoners, Proceedings of the 5th International Semantic Web Conference, pp.654-667, 2006.
DOI : 10.1007/11926078_47

G. Gargov, V. Goranko, and ?. , Modal logic with names, Journal of Philosophical Logic, vol.57, issue.2, pp.607-636, 1993.
DOI : 10.1007/BF01054038

O. Gasquet, A. Herzig, D. Longin, M. Sahade, and ?. , LoTREC: Logical Tableaux Research Engineering Companion, In TABLEAUX, pp.318-322, 2005.
DOI : 10.1007/11554554_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.5271

I. P. Gent, T. Walsh, and ?. , The SAT phase transition, Proc. of the 11th European Conference on Artificial Intelligence, pp.105-109, 1994.

I. P. Gent, T. Walsh, and ?. , Beyond NP: the QSAT phase transition, pp.648-653, 1999.

. Gentzen, Untersuchungen ???ber das logische Schlie???en. II, Mathematische Zeitschrift, vol.39, issue.1, pp.405-431, 1935.
DOI : 10.1007/BF01201363

E. Giunchiglia, F. Giunchiglia, R. Sebastiani, A. Tacchella, and ?. , More evaluation of decision procedures for modal logics, KR'98: Principles of Knowledge Representation and Reasoning, pp.626-635, 1998.

F. Giunchiglia, R. Sebastiani, and ?. , A sat-based decision procedure for alc, Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning -KR'96, pp.304-314, 1996.

D. Goldin, P. Wegner, and ?. , The Church-Turing Thesis: Breaking the Myth, New Computational Paradigms, pp.152-168, 2005.
DOI : 10.1007/11494645_20

V. Goranko, S. Passy, and ?. , Using the Universal Modality: Gains and Questions, Journal of Logic and Computation, vol.2, issue.1, pp.5-30, 1992.
DOI : 10.1093/logcom/2.1.5

R. Goré, L. A. Nguyen, and ?. , EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies, TABLEAUX '07: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods, pp.133-148, 2007.
DOI : 10.1007/978-3-540-73099-6_12

R. Goré and L. Postniece, An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description), IJCAR '08: Proceedings of the 4th international joint conference on Automated Reasoning, pp.299-305, 2008.
DOI : 10.1007/978-3-540-71070-7_25

R. Goré and F. Widmann, Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse, Lecture Notes in Computer Science, vol.6173, pp.225-239, 2010.
DOI : 10.1007/978-3-642-14203-1_20

D. Gorín and ?. , Automated reasoning techniques for hybrid logics, p.107, 2009.

D. G. ¨-otzmann, M. Kaminski, G. Smolka, and ?. , Spartacus: A tableau prover for hybrid logic, ENTCS, pp.4-6, 2010.

E. Grädel, M. Otto, and E. Rosen, Two-variable logic with counting is decidable, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.306-317, 1997.
DOI : 10.1109/LICS.1997.614957

E. Grädel, P. G. Kolaitis, M. Y. Vardi, and ?. , Abstract, Bulletin of Symbolic Logic, vol.40, issue.01, pp.53-69, 1997.
DOI : 10.1007/BF01449155

V. Haarslev and R. , Description of the Racer System and its Applications, Proceedings of the 2001 International Description Logics Workshop

V. Haarslev and R. , On the Scalability of Description Logic Instance Retrieval, Journal of Automated Reasoning, vol.3, issue.2, pp.99-142, 2008.
DOI : 10.1007/s10817-008-9104-7

V. Haarslev, M. Timmann, and R. , Combining tableaux and algebraic methods for reasoning with qualified number restrictions, Proc. of Description Logics, pp.152-161, 2001.

J. Halpern and Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence, vol.54, issue.3, pp.319-379, 1992.
DOI : 10.1016/0004-3702(92)90049-4

A. Heuerding, S. Schwendimann, ?. , K. , and S. , A benchmark method for the propositional modal logics, p.138, 1996.

J. Hintikka, Form and content in quantification theory, Acta Philosophica Fennica ? Two papers on Symbolic Logic, vol.8, pp.8-55, 1955.

J. Hintikka and ?. , Notes on quantification theory, Societas Scientificarum Fennica Commentationes Physico-Mathematicae, vol.17, p.56, 1955.

G. Hoffmann, C. Areces, and ?. , HTab: a Terminating Tableaux System for Hybrid Logic, Proc. of Method For Modalities 5, pp.3-19, 2007.
DOI : 10.1016/j.entcs.2009.02.026
URL : https://hal.archives-ouvertes.fr/inria-00187300

I. Horrocks, U. Sattler, and ?. , A description logic with transitive and inverse roles and role hierarchies, Journal of Logic and Computation, vol.9, issue.3, pp.385-410, 1999.
DOI : 10.1093/logcom/9.3.385
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8715

U. Horrocks, S. Sattler, and ?. Tobies, Practical Reasoning for Expressive Description Logics, Proc. of the 6th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'99), pp.161-180, 1999.
DOI : 10.1007/3-540-48242-3_11
URL : http://arxiv.org/abs/cs/0005014

I. Horrocks, P. Patel-schneider, R. Sebastiani, and ?. , An analysis of empirical testing for modal decision procedures, Logic Journal of IGPL, vol.8, issue.3, pp.293-323, 2000.
DOI : 10.1093/jigpal/8.3.293

. Horrocks, Ontologies and the semantic web, Communications of the ACM, vol.51, issue.12, pp.58-67, 2008.
DOI : 10.1145/1409360.1409377

I. Horrocks, P. F. Patel-schneider, and ?. , Optimizing description logic subsumption, Journal of Logic and Computation, vol.9, issue.3, pp.267-293, 1999.
DOI : 10.1093/logcom/9.3.267
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.8900

I. Horrocks, U. Sattler, and ?. , A Tableau Decision Procedure for $\mathcal{SHOIQ}$, Journal of Automated Reasoning, vol.12, issue.2, pp.249-276, 2007.
DOI : 10.1007/s10817-007-9079-9

I. Horrocks, U. Sattler, S. Tobies, and ?. , Practical reasoning for description logics with functional restrictions, Proceedings of the 1999 Workshop Methods for Modalities (M4M-1), p.86, 1999.

U. Hustadt, R. Schmidt, and ?. , On evaluating decision procedures for modal logic, Proc. of the 15th IJCAI, pp.202-207, 1997.

U. Hustadt and R. A. Schmidt, A comparison of solvers for propositional dynamic logic, Proceedings of the Second International Workshop on Practical Aspects of Automated Reasoning (PAAR-2010), pp.2010-60, 2010.

M. Kaminski, S. Schneider, G. Smolka, and ?. , Terminating tableaux for graded hybrid logic with global modalities and role hierarchies, LNCS (LNAI), pp.235-249, 2009.
DOI : 10.2168/lmcs-7(1:5)2011
URL : http://arxiv.org/abs/1012.0746

M. Kaminski and G. Smolka, Terminating Tableau Systems for Hybrid Logic with Difference and Converse, Journal of Logic, Language and Information, vol.9, issue.3, pp.437-464, 2009.
DOI : 10.1007/s10849-009-9087-8

M. Kaminski and G. Smolka, A straightforward saturation-based decision procedure for hybrid logic, International Workshop on Hybrid Logic, vol.58, p.77, 2007.

M. Kaminski and G. Smolka, Hybrid Tableaux for the Difference Modality, Electronic Notes in Theoretical Computer Science, vol.231, issue.100, pp.241-257, 2009.
DOI : 10.1016/j.entcs.2009.02.039

M. Kaminski and G. Smolka, Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference, LNCS (AR- CoSS), pp.417-431, 2010.
DOI : 10.1007/978-3-642-16242-8_30

M. Kaminski, G. Smolka, and ?. , Terminating Tableaux for Hybrid Logic with Eventualities, IJCAR 2010, p.114, 2010.
DOI : 10.1007/978-3-642-14203-1_21

M. Kaminski and G. Smolka, Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles, IFIP AICT, pp.213-228, 2010.
DOI : 10.1007/978-3-642-15240-5_16
URL : https://hal.archives-ouvertes.fr/hal-01054458

M. Kaminski, S. Schneider, and G. Smolka, Terminating tableaux for graded hybrid logic with global modalities and role hierarchies, LNCS (LNAI), vol.5607, issue.93, pp.235-249, 2009.

Y. Kazakov and I. Pratt, A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.407-416, 2009.
DOI : 10.1109/LICS.2009.17

Y. Kazakov, U. Sattler, E. Zolin, and ?. , How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited, LPAR, Lecture Notes in Computer Science, vol.4790, pp.303-317, 2007.
DOI : 10.1007/978-3-540-75560-9_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.2126

. Kripke, A completeness theorem in modal logic, The Journal of Symbolic Logic, vol.XIV, issue.01, pp.1-14, 1959.
DOI : 10.2307/2964568

. Kripke, Semantical Considerations on Modal Logic, Acta Philos. Fennica, vol.16, pp.83-94, 1963.
DOI : 10.1007/978-3-0346-0145-0_16

. Ladner, The Computational Complexity of Provability in Systems of Modal Propositional Logic, SIAM Journal on Computing, vol.6, issue.3, pp.467-480, 1977.
DOI : 10.1137/0206033

M. Marx, Narcissists, stepmothers and spies, Proc. of DL'02, p.48, 2002.

. Massacci, Design and results of the Tableaux-99 non-classical (modal) system competition, Proc. Tableaux'99, p.138, 1999.

M. C. Mayer, S. Cerrito, and ?. , Herod and pilate: two tableau provers for basic hybrid logic, pp.2010-255
URL : https://hal.archives-ouvertes.fr/hal-00666655

. Mostowski, On a generalization of quantifiers, Fundamenta Mathematicae, vol.44, issue.89, pp.12-36, 1957.
DOI : 10.1016/S0049-237X(09)70266-6

B. Motik, R. Shearer, I. Horrocks, and ?. , Optimized Reasoning in Description Logics Using Hypertableaux, Proc. of the 21st Int. Conf. on Automated Deduction (CADE- 21), pp.67-83, 2007.
DOI : 10.1007/978-3-540-73595-3_6

A. Mytkowicz, M. Diwan, P. F. Hauswirth, and ?. Sweeney, Producing wrong data without doing anything obviously wrong!, ASPLOS '09: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems, pp.265-276, 2009.
DOI : 10.1145/2528521.1508275
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.8395

R. Nieuwenhuis, A. Oliveras, E. Rodríguez-carbonell, A. Rubio, and ?. , Challenges in Satisfiability Modulo Theories, RTA'07: Proceedings of the 18th international conference on Term rewriting and applications, pp.2-18, 2007.
DOI : 10.1007/978-3-540-73449-9_2

J. Ohlbach and J. Koehler, Modal logics, description logics and arithmetic reasoning, Artificial Intelligence, vol.109, issue.1-2, pp.1-31, 1999.
DOI : 10.1016/S0004-3702(99)00011-9
URL : http://doi.org/10.1016/s0004-3702(99)00011-9

W. Pacholski, L. Szwast, and . Tendera, Complexity of two-variable logic with counting, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.318-327, 1997.
DOI : 10.1109/LICS.1997.614958

W. Pacholski, L. Szwast, and ?. Tendera, Complexity of two-variable logic with counting, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.1083-1117, 2000.
DOI : 10.1109/LICS.1997.614958

E. Pacuit, S. Salame, and ?. , Majority logic, Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference, pp.598-605, 2004.

S. Passy, T. Tinchev, and ?. , Quantifiers in combinatory PDL: Completeness, definability, incompleteness, LNCS, vol.199, pp.512-519, 1985.
DOI : 10.1007/BFb0028835

S. Passy, T. Tinchev, and ?. , PDL with data constants, Information Processing Letters, vol.20, issue.1, pp.35-41, 1985.
DOI : 10.1016/0020-0190(85)90127-9

R. Patel-schneider and ?. Sebastiani, A new general method to generate random modal formulae for testing decision procedures, Journal of Artificial Intelligence Research, vol.18, issue.125, pp.351-389, 2003.

P. F. Patel, DLP system description, Collected Papers from the International Description Logics Workshop (DL'98), pp.87-89, 1998.

. Pratt, Every Prime Has a Succinct Certificate, SIAM Journal on Computing, vol.4, issue.3, pp.214-220, 1975.
DOI : 10.1137/0204018

?. Pratt-hartmann, Complexity of the Two-Variable Fragment with Counting Quantifiers, Journal of Logic, Language and Information, vol.28, issue.4, pp.369-395, 2005.
DOI : 10.1007/s10849-005-5791-1

I. Pratt-hartmann and ?. , Abstract, Bulletin of Symbolic Logic, vol.3229, issue.01, pp.1-28, 2008.
DOI : 10.1305/ndjfl/1153858644

I. Pratt-hartmann and ?. , The Two-Variable Fragment with Counting Revisited, Logic, Language, Information and Computation, pp.42-54, 2010.
DOI : 10.1007/978-3-642-13824-9_4

A. Prior, "Now", No??s, vol.2, issue.2, pp.101-119, 1968.
DOI : 10.2307/2214699

P. Pudí-ak, R. Impagliazzo, and ?. , A lower bound for DLL algorithms for k-SAT, Symposium on Discrete Algorithms, pp.128-136, 2000.

A. Rector, I. Horrocks, and ?. , Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions, Proceedings of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAI'97, p.94, 1997.

J. B. Rosser, An informal exposition of proofs of G??del's theorems and Church's theorem, The Journal of Symbolic Logic, vol.38, issue.02, pp.53-60, 1939.
DOI : 10.1007/BF01565439

. Sattler, A concept language extended with different kinds of transitive roles, Lecture Notes in Computer Science, vol.1137, pp.333-345, 1996.
DOI : 10.1007/3-540-61708-6_74

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X

A. Schaerf, Reasoning with individuals in concept languages, Data & Knowledge Engineering, vol.13, issue.2, pp.141-176, 1994.
DOI : 10.1016/0169-023X(94)90002-7

M. Schmidt-schauß, G. Smolka, and ?. , Attributive concept descriptions with complements, Artificial Intelligence, vol.48, issue.1, pp.1-26, 1991.
DOI : 10.1016/0004-3702(91)90078-X

. Schneider, The complexity of hybrid logics over restricted frame classes, p.70, 2007.

D. Schröderschr¨schröder and ?. Pattinson, How many toes do I have? parthood and number restrictions in description logics, Proc. Knowledge Representation, p.94, 2008.

D. Schröderschr¨schröder and ?. Pattinson, How many toes do I have? parthood and number restrictions in description logics, Proc. Knowledge Representation, p.94, 2008.

E. Sirin, B. C. Grau, B. Parsia, and ?. , Optimizing description logic reasoning with nominals: First results, p.97, 2004.

E. Sirin, B. Parsia, B. C. Grau, A. Kalyanpur, Y. Katz et al., Pellet: A practical OWL-DL reasoner, Software Engineering and the Semantic Web, pp.51-53, 2007.
DOI : 10.1016/j.websem.2007.03.004

. Spaan, Complexity of modal logics, p.42, 1993.

M. Suda, C. Weidenbach, P. Wischnewski, and ?. , On the Saturation of YAGO, Lecture Notes in Computer Science, vol.6173, issue.6, pp.441-456, 2010.
DOI : 10.1007/978-3-642-14203-1_38

C. Sutcliffe and T. Suttner, The TPTP problem library, Proc. of CADE-12 LNAI, pp.252-266, 1994.
DOI : 10.1007/3-540-58156-1_18

B. Cate, Model theory for extended modal languages, ILLC Dissertation Series DS-2005-01, p.45, 2005.

B. Cate and M. Franceschet, On the Complexity of Hybrid Logics with Binders, Proceedings of Computer Science Logic Lecture Notes in Computer Science, vol.3634, issue.50, pp.339-354, 2005.
DOI : 10.1007/11538363_24

?. Tobies, PSPACE Reasoning for Graded Modal Logics, Journal of Logic and Computation, vol.11, issue.1, pp.85-106, 2001.
DOI : 10.1093/logcom/11.1.85
URL : http://arxiv.org/abs/cs/0005009

D. Tsarkov, I. Horrocks, and P. F. Patel, Optimizing Terminological Reasoning for Expressive Description Logics, Journal of Automated Reasoning, vol.6, issue.2, pp.277-316, 2007.
DOI : 10.1007/s10817-007-9077-y

D. Tsarkov and I. Horrocks, FaCT++ Description Logic Reasoner: System Description, Proc. of the Int. Joint Conf. on Automated Reasoning, pp.292-297, 2006.
DOI : 10.1007/11814771_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.2672

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

M. Tzakova and ?. , Tableau Calculi for Hybrid Logics, Proceedings of the Conference on Tableaux Calculi and Related Methods (TABLEAUX), pp.278-292, 1999.
DOI : 10.1007/3-540-48754-9_24
URL : http://hdl.handle.net/11858/00-001M-0000-000F-369E-4

W. Van-der-hoek, M. De-rijke, and ?. , Generalized quantifiers and modal logic, Journal of Logic, Language and Information, vol.57, issue.1, pp.19-58, 1993.
DOI : 10.1007/BF01051767

W. Van-der-hoek and M. De-rijke, Counting Objects, Journal of Logic and Computation, vol.5, issue.3, pp.325-345, 1995.
DOI : 10.1093/logcom/5.3.325

A. Van-gelder and ?. , Problem generator mkcnf, p.122, 1993.

?. Westerståhlwesterst?westerståhl, Quantifiers in formal and natural languages, Dordrecht: Reidel, pp.1-1331, 1989.