dr hab. prof. UO Lidia Tendera

Publikacje


    2016
  1. Ian Pratt-Hartmann, Wiesław Szwast, Lidia Tendera, QUINE'S FLUTED FRAGMENT IS NON-ELEMENTARY, CSL, Computer Science Logic, LIPIcs, 62 (2016), 39:1--39:21.

  2. 2015
  3. Emanuel Kieroński, Ian Pratt-Hartmann, Lidia Tendera, EQUIVALENCE CLOSURE IN THE TWO-VARIABLE GUARDED FRAGMENT, Journal of Logic and Computation, doi: 10.1093/logcom/exv075 (2015), online.

  4. 2014
  5. Emanuel Kieroński, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera, TWO-VARIABLE FIRST-ORDER LOGIC WITH EQUIVALENCE CLOSURE, SIAM Journal on Computing, 43 (2014), 1012–1063.

  6. 2013
  7. Georg Gottlob, Andreas Pieris, Lidia Tendera, QUERYING THE GUARDED FRAGMENT WITH TRANSITIVITY, ICALP 2013, Riga, Latvia, July 8-12 (2013), referat wygłoszony.
  8. Wiesław Szwast, Lidia Tendera, FO2 WITH ONE TRANSITIVE RELATION IS DECIDABLE, 30th Annual Symposium on Theoretical Aspects of Computer Science, LIPIcs (2013), 317-328.
  9. Georg Gottlob, Andreas Pieris, Lidia Tendera, QUERYING THE GUARDED FRAGMENT WITH TRANSITIVITY, Lecture Notes in Computer Science, 7966 (2013), pp. 293--304. .
  10. Lidia Tendera, MEANS AND LIMITS OF DECISION (INVITED TALK), CSL, Computer Science Logic (2013), 28-29.

  11. 2012
  12. Emanuel Kieroński, Jakub Michaliszyn, Lidia Tendera, TWO-VARIABLE FIRST-ORDER LOGIC WITH EQUIVALENCE CLOSURE, Proc. Annual IEEE Symposium on Logic in Computer Science, LICS, 27 (2012), 431-440.

  13. 2009
  14. Emanuel Kieroński, Lidia Tendera, ON FINITE SATISFIABILITY OF THE TWO-VARIABLE FIRST-ORDER LOGIC WITH EQUIVALENCE RELATIONS, Proc. Annual IEEE Symposium on Logic in Computer Science, LICS, 24 (2009), 123-132.
  15. Emanuel Kieroński, Lidia Tendera, ON FINITE SATISFIABILITY OF THE TWO-VARIABLE FIRST-ORDER LOGIC WITH EQUIVALENCE RELATIONS, LICS 2009, Los Angeles, USA, 11-14 sierpnia 2009 (2009), referat wygłoszony.
  16. Lidia Tendera, O ZŁOŻONOŚCI OBLICZENIOWEJ, "Logika i jej zastosowania w filozofii i podstawach matematyki", Szklarska Poręba, 20-24 kwietnia 2009r. (2009), referat wygłoszony.

  17. 2008
  18. Małgorzata Haładewicz-Grzelak, Lidia Tendera, LOGIC IN OPTIMAL PLACES: LINGUISTIC PLATONISM, Beyond Philology, 5 (2008), 23-53.

  19. 2007
  20. Emanuel Kieroński, Lidia Tendera, ON FINITE SATISFIABILITY OF THE GUARDED FRAGMENT WITH EQUIVALENCE OR TRANSITIVE GUARDS, Lecture Notes in Artificial Intelligence, 4790 (2007), 318-332.
  21. Emanuel Kieroński, Lidia Tendera, ON FINITE SATISFIABILITY OF THE GUARDED FRAGMENT WITH EQUIVALENCE OR TRANSITIVE GUARDS, LPAR 2007, Erewań, Armenia, 15-19 października 2007 (2007), referat wygłoszony.

  22. 2005
  23. Carsten Lutz, Ulrike Sattler, Lidia Tendera, THE COMPLEXITY OF FINITE MODEL REASONING IN DESCRIPTION LOGICS, Information and Computation, 199 (2005), 132--171.
  24. Lidia Tendera, COUNTING IN THE TWO VARIABLE GUARDED LOGIC WITH TRANSITIVITY, Lecture Notes in Computer Science, 3404 (2005), 83-96.
  25. Lidia Tendera, COUNTING IN THE TWO VARIABLE GAURDED LOGIC WITH TRANSITIVITY, STACS 2005, Stuttgart, Niemcy, 23-27 luty, (2005), referat wygłoszony.
  26. Wiesław Szwast, Lidia Tendera, ON THE FINITE SATISFIABILITY PROBLEM FOR THE GUARDED FRAGMENT WITH TRANSITIVITY, Lecture Notes in Artificial Intelligence, 3835 (2005), 307-321.
  27. Lidia Tendera, ON THE FINITE SATISFIABILITY PROBLEM FOR THE GUARDED FRAGMENT WITH TRANSITIVITY, LPAR 2005, Montego Bay, Jamajka (2005), referat wygłoszony.

  28. 2004
  29. Wiesław Szwast, Lidia Tendera, THE GUARDED FRAGMENT WITH TRANSITIVE GUARDS, Annals of Pure and Applied Logic, 128 (2004), 227-276.

  30. 2003
  31. Carsten Lutz, Ulrike Sattler, Lidia Tendera, THE COMPLEXITY OF FINITE MODEL REASONING IN DESCRIPTION LOGICS, CADE 19, Lecture Notes in Artificial Intelligence, 2741 (2003), 60-74.
  32. Carsten Lutz, Ulrike Sattler, Lidia Tendera, FINITE MODEL REASONING IN ALCQI IS EXPTIME-COMPLETE, Proceedings of the 2003 International Workshop on Description Logics (DL2003),, CEUR Workshop Proceedings, CEUR-WS/Vol-81/ (2003), online.

  33. 2001
  34. Wiesław Szwast, Lidia Tendera, ON THE DECISION PROBLEM FOR THE GUARDED FRAGMENT WITH TRANSITIVITY, Proc. Annual IEEE Symposium on Logic in Computer Science, LICS, 16 (2001), 147-156.

  35. 2000
  36. Leszek Pacholski, Wiesław Szwast, Lidia Tendera, COMPLEXITY RESULTS FOR FIRST-ORDER TWO-VARIABLE LOGIC WITH COUNTING, SIAM Journal on Computing, Vol. 29, No 4 (2000), 1083-1117.

  37. 1997
  38. Leszek Pacholski, Wiesław Szwast, Lidia Tendera, COMPLEXITY OF TWO-VARIABLE LOGIC WITH COUNTING, Proc. 12-th Annual IEEE Symposium on Logic in Computer Science, Los Alamitos (1997), 318-327.

  39. 1994
  40. Lidia Tendera, A NOTE ON ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL CLASSES - THE LAST STEP, Fundamenta Informaticae, 20 (1994), 277-285.