default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLidia Tendera
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Dariusz Marzec, Lidia Tendera:
On Two-variable First-order Logic with a Partial Order. CILC 2024- 2023
- [c18]Ian Pratt-Hartmann
, Lidia Tendera:
Adding Transitivity and Counting to the Fluted Fragment. CSL 2023: 32:1-32:22 - 2022
- [j11]Ian Pratt-Hartmann, Lidia Tendera:
The fluted fragment with transitive relations. Ann. Pure Appl. Log. 173(1): 103042 (2022) - 2021
- [c17]Lidia Tendera:
On the Fluted Fragment (Invited Talk). STACS 2021: 3:1-3:1 - 2020
- [i5]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitive Relations. CoRR abs/2006.11169 (2020)
2010 – 2019
- 2019
- [j10]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
The Fluted Fragment Revisited. J. Symb. Log. 84(3): 1020-1048 (2019) - [j9]Wieslaw Szwast, Lidia Tendera:
On the satisfiability problem for fragments of two-variable logic with one transitive relation. J. Log. Comput. 29(6): 881-911 (2019) - [c16]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitivity. MFCS 2019: 18:1-18:15 - [i4]Ian Pratt-Hartmann, Lidia Tendera:
The Fluted Fragment with Transitivity. CoRR abs/1906.09131 (2019) - 2018
- [j8]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Two-variable logics with counting and semantic constraints. ACM SIGLOG News 5(3): 22-43 (2018) - [j7]Emanuel Kieronski, Lidia Tendera:
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. ACM Trans. Comput. Log. 19(2): 8:1-8:34 (2018) - [c15]Lidia Tendera:
Decidability Frontier for Fragments of First-Order Logic with Transitivity. Description Logics 2018 - [i3]Wieslaw Szwast, Lidia Tendera:
On the satisfiability problem for fragments of the two-variable logic with one transitive relation. CoRR abs/1804.09447 (2018) - [i2]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment Revisited. CoRR abs/1812.06440 (2018) - 2017
- [j6]Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
Equivalence closure in the two-variable guarded fragment. J. Log. Comput. 27(4): 999-1021 (2017) - [c14]Lidia Tendera:
Finite Model Reasoning in Expressive Fragments of First-Order Logic. M4M@ICLA 2017: 43-57 - 2016
- [c13]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment is Non-Elementary. CSL 2016: 39:1-39:21 - [i1]Emanuel Kieronski, Lidia Tendera:
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. CoRR abs/1611.03267 (2016) - 2014
- [j5]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. SIAM J. Comput. 43(3): 1012-1063 (2014) - 2013
- [c12]Lidia Tendera:
Means and Limits of Decision (Invited Talk). CSL 2013: 28-29 - [c11]Georg Gottlob, Andreas Pieris, Lidia Tendera:
Querying the Guarded Fragment with Transitivity. ICALP (2) 2013: 287-298 - [c10]Wieslaw Szwast, Lidia Tendera:
FO^2 with one transitive relation is decidable. STACS 2013: 317-328 - 2012
- [c9]Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera:
Two-Variable First-Order Logic with Equivalence Closure. LICS 2012: 431-440
2000 – 2009
- 2009
- [c8]Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. LICS 2009: 123-132 - 2007
- [c7]Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. LPAR 2007: 318-332 - 2005
- [j4]Carsten Lutz, Ulrike Sattler, Lidia Tendera:
The complexity of finite model reasoning in description logics. Inf. Comput. 199(1-2): 132-171 (2005) - [c6]Wieslaw Szwast, Lidia Tendera:
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. LPAR 2005: 307-321 - [c5]Lidia Tendera:
Counting in the Two Variable Guarded Logic with Transitivity. STACS 2005: 83-96 - 2004
- [j3]Wieslaw Szwast, Lidia Tendera:
The guarded fragment with transitive guards. Ann. Pure Appl. Log. 128(1-3): 227-276 (2004) - 2003
- [c4]Carsten Lutz, Ulrike Sattler, Lidia Tendera:
The Complexity of Finite Model Reasoning in Description Logics. CADE 2003: 60-74 - [c3]Carsten Lutz, Ulrike Sattler, Lidia Tendera:
Finite Model Reasoning in ALCQI is EXPTIME Logics. Description Logics 2003 - 2001
- [c2]Wieslaw Szwast, Lidia Tendera:
On the Decision Problem for the Guarded Fragment with Transitivity. LICS 2001: 147-156 - 2000
- [j2]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity Results for First-Order Two-Variable Logic with Counting. SIAM J. Comput. 29(4): 1083-1117 (2000)
1990 – 1999
- 1997
- [c1]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity of Two-Variable Logic with Counting. LICS 1997: 318-327 - 1994
- [j1]Lidia Tendera:
A Note on Asymptotic Probabilities of Existential Second-Order Minimal Classes - the Last Step. Fundam. Informaticae 20(4): 277-285 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-27 17:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
