The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lidia Tendera: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    The Complexity of Finite Model Reasoning in Description Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:60-74 [Conf]
  2. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    Finite Model Reasoning in ALCQI is EXPTIME Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2003, pp:- [Conf]
  3. Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
    Complexity of Two-Variable Logic with Counting. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:318-327 [Conf]
  4. Wieslaw Szwast, Lidia Tendera
    On the Decision Problem for the Guarded Fragment with Transitivity. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:147-156 [Conf]
  5. Wieslaw Szwast, Lidia Tendera
    On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:307-321 [Conf]
  6. Lidia Tendera
    Counting in the Two Variable Guarded Logic with Transitivity. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:83-96 [Conf]
  7. Wieslaw Szwast, Lidia Tendera
    The guarded fragment with transitive guards. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:128, n:1-3, pp:227-276 [Journal]
  8. Lidia Tendera
    A Note on Asymptotic Probabilities of Existential Second-Order Minimal Classes - the Last Step. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:20, n:4, pp:277-285 [Journal]
  9. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    The complexity of finite model reasoning in description logics. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:199, n:1-2, pp:132-171 [Journal]
  10. Leszek Pacholski, Wieslaw Szwast, Lidia Tendera
    Complexity Results for First-Order Two-Variable Logic with Counting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1083-1117 [Journal]
  11. Emanuel Kieronski, Lidia Tendera
    On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:318-332 [Conf]

  12. On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002