Lidia Tendera

According to our database, Lidia Tendera authored at least 28 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Adding Transitivity and Counting to the Fluted Fragment.

Ian Pratt-Hartmann, Lidia Tendera

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

The fluted fragment with transitive relations.

Ian Pratt-Hartmann, Lidia Tendera

Ann. Pure Appl. Log., 2022

2021

On the Fluted Fragment (Invited Talk).

Lidia Tendera

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2019

On the satisfiability problem for fragments of two-variable logic with one transitive relation.

Wieslaw Szwast, Lidia Tendera

J. Log. Comput., 2019

The Fluted Fragment Revisited.

Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera

J. Symb. Log., 2019

The Fluted Fragment with Transitivity.

Ian Pratt-Hartmann, Lidia Tendera

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants.

Emanuel Kieronski, Lidia Tendera

ACM Trans. Comput. Log., 2018

Two-variable logics with counting and semantic constraints.

Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera

ACM SIGLOG News, 2018

Quine's Fluted Fragment Revisited.

Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera

CoRR, 2018

Decidability Frontier for Fragments of First-Order Logic with Transitivity.

Lidia Tendera

Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27th - to, 2018

2017

Equivalence closure in the two-variable guarded fragment.

Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera

J. Log. Comput., 2017

Finite Model Reasoning in Expressive Fragments of First-Order Logic.

Lidia Tendera

Proceedings of the Ninth Workshop on Methods for Modalities, 2017

2016

Quine's Fluted Fragment is Non-Elementary.

Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2014

Two-Variable First-Order Logic with Equivalence Closure.

Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera

SIAM J. Comput., 2014

2013

FO^2 with one transitive relation is decidable.

Wieslaw Szwast, Lidia Tendera

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Querying the Guarded Fragment with Transitivity.

Georg Gottlob, Andreas Pieris, Lidia Tendera

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Means and Limits of Decision (Invited Talk).

Lidia Tendera

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2009

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations.

Emanuel Kieronski, Lidia Tendera

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2007

On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.

Emanuel Kieronski, Lidia Tendera

Proceedings of the Logic for Programming, 2007

2005

The complexity of finite model reasoning in description logics.

Carsten Lutz, Ulrike Sattler, Lidia Tendera

Inf. Comput., 2005

Counting in the Two Variable Guarded Logic with Transitivity.

Lidia Tendera

Proceedings of the STACS 2005, 2005

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity.

Wieslaw Szwast, Lidia Tendera

Proceedings of the Logic for Programming, 2005

2004

The guarded fragment with transitive guards.

Wieslaw Szwast, Lidia Tendera

Ann. Pure Appl. Log., 2004

2003

Finite Model Reasoning in ALCQI is EXPTIME Logics.

Carsten Lutz, Ulrike Sattler, Lidia Tendera

Proceedings of the 2003 International Workshop on Description Logics (DL2003), 2003

2001

On the Decision Problem for the Guarded Fragment with Transitivity.

Wieslaw Szwast, Lidia Tendera

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000

Complexity Results for First-Order Two-Variable Logic with Counting.

Leszek Pacholski, Wieslaw Szwast, Lidia Tendera

SIAM J. Comput., 2000

1997

Complexity of Two-Variable Logic with Counting.

Leszek Pacholski, Wieslaw Szwast, Lidia Tendera

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1994

A Note on Asymptotic Probabilities of Existential Second-Order Minimal Classes - the Last Step.

Lidia Tendera

Fundam. Informaticae, 1994