dr hab. prof. UO Lidia Tendera

Publikacje


    2019
  1. Lidia Tendera, Ian Pratt-Hartmann, FLUTED FRAGMENT WITH TRANSITIVITY, 44th International Symposium on Mathematical Foundations of Computer Science August 26-30, 2019, Aachen (Germany), LIPIcs, MFCS 2019 (2019), 18:1-18:15.
  2. Lidia Tendera, Wiesław Szwast, ON THE SATISFIABILITY PROBLEM FOR FRAGMENTS OF TWO-VARIABLE LOGIC WITH ONE TRANSITIVE RELATION, Journal of Logic and Computation, 29(6) (2019), 881-911.
  3. Lidia Tendera, Wiesław Szwast, Ian Pratt-Hartmann, THE FLUTED FRAGMENT REVISITED, Journal of Symbolic Logic, 84(3) (2019), 1020-1048.

    4. 2018
  4. Lidia Tendera, Emanuel Kieroński, FINITE SATISFIABILITY OF THE TWO-VARIABLE GUARDED FRAGMENT WITH TRANSITIVE GUARDS AND RELATED VARIANTS, ACM Transactions on Computational Logic, 19 (2) (2018), doi: 10.1145/3174805.
  5. Lidia Tendera, DECIDABILITY FRONTIER FOR FRAGMENTS OF FIRST-ORDER LOGIC WITH TRANSITIVITY, Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR) 2018, CEUR-WS.org, 2211 (2018), http://ceur-ws.org/V.
  6. Lidia Tendera, Emanuel Kieroński, Ian Pratt-Hartmann, TWO-VARIABLE LOGICS WITH COUNTING AND SEMANTIC CONSTRAINTS, w: SIGLOG Newsletter, 5(3) (2018), 22-43.

    7. 2017
  7. Lidia Tendera, Ian Pratt-Hartmann, Emanuel Kieroński, EQUIVALENCE CLOSURE IN THE TWO-VARIABLE GUARDED FRAGMENT, Journal of Logic and Computation, 27 (4) (2017), 999--1021.
  8. Lidia Tendera, FINITE MODEL REASONING IN EXPRESSIVE FRAGMENTS OF FIRST-ORDER LOGIC, 9th Workshop on Methods for Modalities (M4M9 2017), IIT Kanpur, India, 8-10 Jan 2017 (2017), referat wygłoszony.
  9. Lidia Tendera, FINITE MODEL REASONING IN EXPRESSIVE FRAGMENTS OF FIRST-ORDER LOGIC, Proceedings of the 9th Workshop on Methods for Modalities (M4M9 2017), IIT Kanpur, India, 8-10 Jan 2017, EPTCS, 243 (2017), 43-57.

    10. 2016
  10. Wiesław Szwast, Ian Pratt-Hartmann, Lidia Tendera, QUINE'S FLUTED FRAGMENT IS NON-ELEMENTARY, w: 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - Septem (red. Jean-Marc Talbot and Laurent Regnier), 978-3-95977-022-4, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016), 39:1--39:21.

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

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

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

    17. 2009
  17. Lidia Tendera, Emanuel Kieroński, 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.
  18. Lidia Tendera, Emanuel Kieroński, 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.
  19. 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.

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

    21. 2007
  21. Lidia Tendera, Emanuel Kieroński, ON FINITE SATISFIABILITY OF THE GUARDED FRAGMENT WITH EQUIVALENCE OR TRANSITIVE GUARDS, Lecture Notes in Artificial Intelligence, 4790 (2007), 318-332.
  22. Lidia Tendera, Emanuel Kieroński, 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.

    23. 2005
  23. Lidia Tendera, COUNTING IN THE TWO VARIABLE GAURDED LOGIC WITH TRANSITIVITY, STACS 2005, Stuttgart, Niemcy, 23-27 luty, (2005), referat wygłoszony.
  24. Lidia Tendera, Carsten Lutz, Ulrike Sattler, THE COMPLEXITY OF FINITE MODEL REASONING IN DESCRIPTION LOGICS, Information and Computation, 199 (2005), 132--171.
  25. 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.
  26. Lidia Tendera, COUNTING IN THE TWO VARIABLE GUARDED LOGIC WITH TRANSITIVITY, Lecture Notes in Computer Science, 3404 (2005), 83-96.
  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
  28. Wiesław Szwast, Lidia Tendera, THE GUARDED FRAGMENT WITH TRANSITIVE GUARDS, Annals of Pure and Applied Logic, 128 (2004), 227-276.

    29. 2003
  29. Lidia Tendera, Carsten Lutz, Ulrike Sattler, 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.
  30. Lidia Tendera, Carsten Lutz, Ulrike Sattler, THE COMPLEXITY OF FINITE MODEL REASONING IN DESCRIPTION LOGICS, CADE 19, Lecture Notes in Artificial Intelligence, 2741 (2003), 60-74.

    31. 2001
  31. 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.

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

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

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