Publications

Last update: June 2017.


Below is the list of my papers. When there exist both conference and journal versions of a paper, the former is on the list only if the titles are different.
Here are links to web pages of my co-authors: Rajeev Alur, Shun'ichi Amano, Marcelo Arenas, Pablo Barceló, Michael Benedikt, Rada Chirkova, Marco Console, Claire David, Guozhu Dong, Ron Fagin, Wenfei Fan, Amélie Gheerbrant, Tim Griffin, Martin Grohe, Paolo Guagliardo, Lauri Hella, Andre Hernich, Kousha Etessami, Diego Figueira, Floris Geerts, Neil Immerman, Solmaz Kolahi, Wim Martens, Filip Murlak, Frank Neven, Juha Nurmonen, Antonella Poggi, Juan Reutter, Nicole Schweikardt, Thomas Schwentick,Luc Segoufin, Cristina Sirangelo, Tony Tan, Anthony Widjaja Lin (To), Domagoj Vrgoč, Limsoon Wong. Click here to email me
  1. A formal semantics of SQL queries, its validation, and applications.
  2. Paolo Guagliardo and Leonid Libkin.
    Proceedings of VLDB Endowment (PVLDB), vol 10, No. 11.
  3. On querying incomplete information in databases under bag semantics.
  4. Marco Console, Paolo Guagliardo and Leonid Libkin.
    In (IJCAI'17), to appear.
  5. Schema mappings for data graphs.
  6. Nadime Francis and Leonid Libkin.
    In Proceedings of the 36th Symposium on Principles of Database Systems (PODS'17), pages 389-401.
  7. On the Codd semantics of SQL nulls.
  8. Paolo Guagliardo and Leonid Libkin.
    In Proceedings of the 36th Alberto Mendelzon Workshop (AMW'17).
  9. Querying graphs with data.
  10. Leonid Libkin, Wim Martens, and Domagoj Vrgoč.
    Journal of the ACM, 63(2) (2016).
  11. SQL's three-valued logic and certain answers.
  12. Leonid Libkin.
    ACM Transactions on Database Systems 41(1) (2016).
    (Note: preliminary version in ICDT'15.)
  13. Making SQL queries correct on incomplete databases: a feasibility study.
  14. Paolo Guagliardo and Leonid Libkin.
    In Proceedings of the 35th Symposium on Principles of Database Systems (PODS'16), pages 211-223.
  15. Certain answers as objects and knowledge.
  16. Leonid Libkin.
    Artificial Intelligence 232 (2016), 1-19.
    (Note: preliminary version in 14th International Conference on Principles of Knowledge Representation and Reasoning (KR'14).)
  17. Approximations and refinements of certain answers via many-valued logics.
  18. Marco Console, Paolo Guagliardo, and Leonid Libkin.
    15th International Conference on Principles of Knowledge Representation and Reasoning (KR'16), pages 349-358.
  19. Order-invariant types and their applications.
  20. Pablo Barcelo and Leonid Libkin.
    Logical Methods in Computer Science, 12(1) (2016).
  21. Negative knowledge for certain query answers.
  22. Leonid Libkin.
    10th International Conference on Web Reasoning and Rule Systems (RR'16), pages 111-127.
  23. Data wrangling for big data: challenges and opportunities.
  24. Tim Furche, Georg Gottlob, Leonid Libkin, Giorgio Orsi, and Norman Paton.
    19th International Conference on Extending Database Technology (EDBT'16), pages 473-478.
  25. How to define certain answers.
  26. Leonid Libkin.
    International Joint Conference on Artificial Intelligence (IJCAI'15), pages 4282-4288.
  27. Path logics for querying graphs: combining expressiveness and efficiency.
  28. Diego Figueira and Leonid Libkin.
    Proceedings of the 30th Symposium on Logic in Computer Science (LICS'15), pages 329-340.
  29. Certain answers over incomplete XML documents: extending tractability boundary
  30. Amélie Gheerbrant and Leonid Libkin.
    Theory of Computing Systems, 57(4) (2015), 892-926.
  31. Synchronizing relations on words.
  32. Diego Figueira and Leonid Libkin.
    Theory of Computing Systems, 57(2) (2015), 287-318.
    (Note: preliminary version in Symposium on Theoretical Aspects of Computer Science (STACS'14), pages 518-529.)
  33. Naive evaluation of queries over incomplete databases
  34. Amélie Gheerbrant, Leonid Libkin, and Cristina Sirangelo.
    ACM Transactions on Database Systems, 39(4), 31 (2014).
    (Note: full version of PODS'13.)
  35. Incomplete data: what went wrong, and how to fix it (invited paper).
  36. Leonid Libkin.
    In Proceedings of the 33rd Symposium on Principles of Database Systems (PODS'14), pages 1-13. Slides from the talk are here.
  37. On scale independence for querying big data.
  38. Wenfei Fan, Floris Geerts, and Leonid Libkin.
    In Proceedings of the 33rd Symposium on Principles of Database Systems (PODS'14), pages 51-62.
  39. XML schema mappings: data exchange and metadata management.
  40. Snunichi Amano, Claire David, Leonid Libkin, and Filip Murlak.
    Journal of the ACM, 61(2) (2014).
  41. Querying regular graph patterns.
  42. Pablo Barceló, Leonid Libkin, and Juan Reutter.
    Journal of the ACM, 61(1) (2014).
  43. Efficient approximations of conjunctive queries.
  44. Pablo Barceló, Leonid Libkin, and Miguel Romero.
    SIAM Journal on Computing, 43(3) (2014), 1085-1130.
    (Note: preliminary version in Proceedings of the 31th Symposium on Principles of Database Systems (PODS'12), pages 249-260.)
  45. Pattern logics and auxiliary relations.
  46. Diego Figueira and Leonid Libkin.
    Proceedings of the 29th Symposium on Logic in Computer Science (LICS'14).
  47. Graph logics with rational relations.
  48. Pablo Barceló, Diego Figueira, and Leonid Libkin.
    Logical Methods in Computer Science, 9(3) (2013).
  49. Solutions and query rewriting in data exchange.
  50. Marcelo Arenas, Pablo Barceló, Ronald Fagin, and Leonid Libkin.
    Information and Computation, 228 (2013), 28-61.
  51. When is naive evaluation possible?
  52. Amélie Gheerbrant, Leonid Libkin, and Cristina Sirangelo.
    In Proceedings of the 32nd Symposium on Principles of Database Systems (PODS'13), pages 75-86.
  53. TriAL for RDF: Adapting graph query languages for RDF data.
  54. Leonid Libkin, Juan Reutter and Domagoj Vrgoč.
    In Proceedings of the 32nd Symposium on Principles of Database Systems (PODS'13), pages 201-212.
  55. Reasoning about pattern-based XML queries (invited paper).
  56. Amélie Gheerbrant, Leonid Libkin, and Cristina Sirangelo.
    In Proceedings of the 7th International Conference on Web Reasoning and Rule Systems (RR'13), pages 4-18.
  57. Regular expressions with binding over data words for querying graph databases.
  58. Leonid Libkin, Tony Tan and Domagoj Vrgoč.
    In Proceedings of the 17th International Conference on Developments in Language Theory (DLT'13), pages 325-337.
  59. Parameterized regular expressions and their languages.
  60. Pablo Barceló, Leonid Libkin, and Juan Reutter.
    Theoretical Computer Science 474 (2013), 21-45.
    (Note: preliminary version in Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), pages 351-362.)
  61. Containment of pattern-based queries over data trees.
  62. Claire David, Amélie Gheerbrant, Leonid Libkin, and Wim Martens.
    In Proceedings of the 16th International Conference on Database Theory (ICDT'13), pages 201-212.
  63. Querying graph databases with XPath.
  64. Leonid Libkin, Wim Martens, and Domagoj Vrgoč.
    In Proceedings of the 16th International Conference on Database Theory (ICDT'13), pages 129-140.
  65. On the aggregation problem for synthesized web services.
  66. Ting Deng, Wenfei Fan, Leonid Libkin, and Yinghui Wu.
    Journal of Computer and System Sciences 79(6) (2013), 873-891.
    (Note: preliminary version in Proceedings of the 13th International Conference on Database Theory (ICDT'10))
  67. Static analysis and query answering for incomplete data trees with constraints.
  68. Amélie Gheerbrant, Leonid Libkin, and Juan Reutter.
    In Peter Buneman Festschrift, Springer, 2013, pages 273-290.
  69. Expressive languages for path queries over graph-structured data.
  70. Pablo Barceló, Leonid Libkin, Anthony Widjaja Lin, and Peter Wood.
    ACM Transactions on Database Systems, 37(4): (2012).
    (Note: preliminary version in Proceedings of the 29th Symposium on Principles of Database Systems (PODS'10), pages 3-14.)
  71. Graph logics with rational relations and the generalized intersection problem.
  72. Pablo Barceló, Diego Figueira, and Leonid Libkin.
    In Proceedings of the 27th Symposium on Logic in Computer Science (LICS'12), pages 115-124.
  73. Efficient reasoning about data trees via integer linear programming.
  74. Claire David, Leonid Libkin, and Tony Tan.
    ACM Transactions on Database Systems, 37(3): 19 (2012).
    (Note: preliminary version in Proceedings of the 14th International Conference on Database Theory (ICDT'11)).
  75. On the complexity of query answering over incomplete XML documents.
  76. Amélie Gheerbrant, Leonid Libkin, and Tony Tan.
    In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 169-181.
  77. Regular path queries on graphs with data.
  78. Leonid Libkin and Domagoj Vrgoč.
    In Proceedings of the 15th International Conference on Database Theory (ICDT'12), pages 74-85.
  79. Regular expressions for data words.
  80. Leonid Libkin and Domagoj Vrgoč.
    In Proceedings of the 18th Conferences on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'12), pages 274-288.
  81. On low treewidth approximations of conjunctive queries.
  82. Pablo Barceló, Leonid Libkin, and Miguel Romero.
    In AMW 2012.
  83. Tractable XML data exchange via relations.
  84. Rada Chirkova, Leonid Libkin, and Juan Reutter.
    Frontiers of Computer Science 6 (3) (2012), 243-263.
    (Note: preliminary version in Proceedings of the 20th Conference on Information and Knowledge Management (CIKM'11), pages 1629-1638.)
  85. Incomplete information and certain answers in general data models.
  86. Leonid Libkin.
    In Proceedings of the 30th Symposium on Principles of Database Systems (PODS'11), pages 59-70.
  87. Querying graph patterns.
  88. Pablo Barceló, Leonid Libkin, and Juan Reutter.
    In Proceedings of the 30th Symposium on Principles of Database Systems (PODS'11), pages 199-210.
  89. Closed world data exchange.
  90. Andre Hernich, Leonid Libkin and Nicole Schweikardt.
    ACM Transactions on Database Systems, 36(2): 14 (2011).
  91. Data exchange and schema mappings in open and closed worlds.
  92. Leonid Libkin and Cristina Sirangelo.
    Journal of Computer and System Sciences, 77 (3) (2011), 542-571.
    (Note: extended abstract in Proceedings of the 27th Symposium on Principles of Database Systems (PODS'08), pages 139-148.)
  93. A direct translation from XPath to nondeterministic automata.
  94. Nadime Francis, Claire David, and Leonid Libkin.
    In Proceedings of AMW 2011.
  95. Regular languages of nested words: automata, fixed-points, and synchronization.
  96. Marcelo Arenas, Pablo Barceló, and Leonid Libkin.
    Theory of Computing Systems, 49(3) (2011), 639-670.
    (Note: extended abstract in Proceedings of International Colloquium on Automata, Languages and Programming (ICALP'07), Springer LNCS, vol. 4596, pages 888-900.)
  97. XML with incomplete information.
  98. Pablo Barceló, Leonid Libkin, Antonella Poggi, and Cristina Sirangelo.
    Journal of the ACM, 58(1), December 2010.
  99. Expressive languages for path queries over graph-structured data.
  100. Pablo Barceló, Carlos Hurtado, Leonid Libkin, and Peter Wood.
    In Proceedings of the 29th Symposium on Principles of Database Systems (PODS'10), pages 3-14.
  101. Certain answers for XML queries.
  102. Claire David, Leonid Libkin, and Filip Murlak.
    In Proceedings of the 29th Symposium on Principles of Database Systems (PODS'10), pages 191-202.
  103. On the satisfiability of two-variable logic over data words.
  104. Claire David, Leonid Libkin, and Tony Tan.
    In Proceedings of the 17th Conferences on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'10), pages 248-262.
  105. On the tradeoff between mapping and querying power in XML data exchange.
  106. Shunichi Amano, Claire David, Leonid Libkin, and Filip Murlak.
    In Proceedings of the 13th International Conference on Database Theory (ICDT'10).
  107. Algorithmic metatheorems for decidable LTL model checking over infinite systems.
  108. Anthony Widjaja To and Leonid Libkin.
    In Proceedings of the 13th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'10), pages 221-236.
  109. An information-theoretic analysis of worst-case redundancy in database design.
  110. Solmaz Kolahi and Leonid Libkin.
    ACM Transactions on Database Systems, 35(1): (2010).
  111. Reasoning about XML with temporal logics and automata.
  112. Leonid Libkin and Cristina Sirangelo.
    Journal of Applied Logic, 8 (2) (2010), 210-232.
    (Note: extended abstract in Proceedings of the International Conferences on Logic for Programming, ArtificialIntelligence and Reasoning (LPAR'08), pages 97-112.)
  113. Disjoint pattern matching and implication in strings.
  114. Leonid Libkin and Cristina Sirangelo.
    Information Processing Letters, 110 (4) (2010), 143-147.
  115. On incomplete XML documents with integrity constraints.
  116. Pablo Barceló, Leonid Libkin, and Juan Reutter.
    In AMW 2010.
  117. The finite model theory toolbox of a database theoretician. (invited tutorial)
  118. Leonid Libkin.
    In Proceedings of the 28th Symposium on Principles of Database Systems (PODS'09), pages 65-76.
    Here are the slides. The conference tutorial was a bit shorter, email me if you want to see it.
  119. XML with incomplete information: models, properties, and query answering.
  120. Pablo Barceló, Leonid Libkin, Antonella Poggi, and Cristina Sirangelo.
    In Proceedings of the 28th Symposium on Principles of Database Systems (PODS'09), pages 237-246.
  121. XML schema mappings.
  122. Shunichi Amano, Leonid Libkin and Filip Murlak.
    In Proceedings of the 28th Symposium on Principles of Database Systems (PODS'09), pages 33-42.
  123. Open and closed world assumptions in data exchange (invited paper).
  124. Leonid Libkin and Cristina Sirangelo.
    In Proceedings of the 22nd International Workshop on Description Logics (DL'09), pages 1-6.
  125. First-order and temporal logics for nested words.
  126. Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, and Leonid Libkin.
    In Logical Methods in Computer Science, 4 (4) (2008), paper 11.
    (Note: Extended abstract in Proceedings of IEEE Symposium on Logic in Computer Science (LICS'07), pages 151--160.)
  127. Recurrent reachability analysis in regular model checking.
  128. Anthony Widjaja To and Leonid Libkin.
    In Proceedings of the International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08), pages 198-213.
  129. On the complexity of verifying consistency of XML specifications.
  130. Marcelo Arenas, Wenfei Fan, and Leonid Libkin.
    SIAM Journal on Computing, 38 (3) (2008), 841-880.
    (Note: extended abstract in In Proceedings of the 21th Symposium on Principles of Database Systems (PODS'02), pages 259-270.)
  131. XML data exchange: consistency and query answering.
  132. Marcelo Arenas and Leonid Libkin.
    Journal of the ACM, 52 (2) (2008).
    (Note: extended abstract in Proceedings of the 24nd Symposium on Principles of Database Systems (PODS'05), pages 13-24.)
  133. Game-based notions of locality over finite models.
  134. Marcelo Arenas, Pablo Barceló, and Leonid Libkin.
    Annals of Pure and Applied Logic, 152 (2008), 3-30.
    (Note: extended abstract in Proceedings of Conference for Computer Science Logic (CSL'04), Springer LNCS vol. 3210, pages 175-189.)
  135. Normalization theory for XML (invited paper).
  136. Leonid Libkin.
    In Proceedings of International XML Database Symposium (XSym'07), Springer LNCS, vol. 4704, pages 1-13.
  137. XML design for relational storage.
  138. Solmaz Kolahi and Leonid Libkin.
    In Proceedings of 16th International World Wide Web Conference (WWW'07), pages 1083--1092.
  139. Embedded Finite Models and Constraint Databases.
  140. Leonid Libkin.
    Appeared in a Springer volume based on the Philadelphia Tutorials on finite model theory, 2007, pages 257-337.
  141. Logical definability and query languages over ranked and unranked trees.
  142. Michael Benedikt, Leonid Libkin, and Frank Neven.
    ACM Transactions on Computational Logic (TOCL), 8(2) (2007), 1--62.
    (Note: preliminary version in LICS'02 and LICS'03.)
  143. Combining temporal logics for querying XML documents.
  144. Marcelo Arenas, Pablo Barceló, and Leonid Libkin.
    In Proceedings of International Conference on Database Theory (ICDT'07), Springer LNCS, vol. 4353, pages 359-374.
  145. Embedded finite models (Logic Column).
  146. Leonid Libkin.
    Bulletin of the EATCS, 90 (2006), 134-149.
  147. Data exchange and incomplete information.
  148. Leonid Libkin.
    In Proceedings of the 25nd Symposium on Principles of Database Systems (PODS'06), pages 60-69.
  149. On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF.
  150. Solmaz Kolahi and Leonid Libkin.
    In Proceedings of the 25nd Symposium on Principles of Database Systems (PODS'06), pages 114-123.
  151. Logics over unranked trees: an overview.
  152. Leonid Libkin.
    Logical Methods in Computer Science, 2 (2006).
    (Note: a preliminary version was an invited paper at International Colloquium on Automata, Languages and Programming (ICALP'05), pages 35-50.)
  153. An information-theoretic approach to normal forms for relational and XML data.
  154. Marcelo Arenas and Leonid Libkin.
    Journal of the ACM, 52 (2005), 246-283.
    (Note: preliminary version in PODS'03, pages 15-26.)
  155. Temporal logics over unranked trees.
  156. Pablo Barceló and Leonid Libkin.
    In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'05), pages 31-40.
  157. Locality of queries and transformations (invited paper).
  158. Leonid Libkin.
    In Proceedings of the 12th Workshop on Logic, Language, Information and Computation (WoLLIC'05), pages 109-120.
  159. Consistency of XML specifications.
  160. Marcelo Arenas, Wenfei Fan, and Leonid Libkin.
    In Inconsistency Tolerance, Springer LNCS vol. 3300, 2005, pages 15-41.
  161. Locally consistent transformations and query answering in data exchange.
  162. Marcelo Arenas, Pablo Barceló, Ronald Fagin, and Leonid Libkin.
    In Proceedings of the 23nd Symposium on Principles of Database Systems (PODS'04), pages 229-240.
  163. A normal form for XML documents.
  164. Marcelo Arenas and Leonid Libkin.
    ACM Transactions on Database Systems (TODS), 29 (2004), 195-232.
    (Note: preliminary version in PODS'02, pages 85-96.)
  165. Definable relations and first-order query languages over strings.
  166. Michael Benedikt, Leonid Libkin, Thomas Schwentick, and Luc Segoufin.
    Journal of the ACM, 50 (2003), 694-751.
  167. Logical definability and query languages over unranked trees.
  168. Leonid Libkin and Frank Neven.
    In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'03), pages 178--187.
  169. Expressive power of SQL.
  170. Leonid Libkin.
    Theoretical Computer Science, 296 (2003), 379-404.
    A shorter version was an invited paper at ICDT'01: 8th International Conference on Database Theory (Springer LNCS 1973, pages 1-21).
  171. Reachability and connectivity queries in constraint databases.
  172. Michael Benedikt, Martin Grohe, Leonid Libkin and Luc Segoufin.
    Journal of Computer and System Sciences, 66 (2003), 169-206.
    (Note: preliminary version in PODS'00, pages 104-115.)
  173. Variable independence for first-order definable constraints.
  174. Leonid Libkin.
    ACM Transactions on Computational Logic (TOCL), 4 (2003), 431-451.
    (Note: preliminary version in ICALP'00, pages 260-271.)
  175. Incremental recomputation in local languages.
  176. Guozhu Dong, Leonid Libkin, Limsoon Wong.
    Information and Computation, 181 (2003), 88-98.
  177. A collapse result for constraint queries over structures of small degree.
  178. Leonid Libkin.
    Information Processing Letters, 86 (2003), 277-281.
  179. On XML integrity constraints in the presence of DTDs.
  180. Wenfei Fan and Leonid Libkin.
    Journal of the ACM, 49 (2002), 368-406.
    (Note: preliminary version in PODS'01, pages 114-125.)
  181. Tree extension algebras: logics, automata, and query languages.
  182. Michael Benedikt and Leonid Libkin.
    In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'02), pages 203-212.
  183. On verifying consistency of XML specifications.
  184. Marcelo Arenas, Wenfei Fan and Leonid Libkin.
    In Proceedings of the 21th Symposium on Principles of Database Systems (PODS'02), pages 259-270.
  185. What's hard about XML Schema constraints?
  186. Marcelo Arenas, Wenfei Fan and Leonid Libkin.
    In Proceedings of Database and Expert Systems Applications (DEXA'02), Springer LNCS 2453, pages 269-278.
  187. Aggregate operators in constraint query languages.
  188. Michael Benedikt and Leonid Libkin.
    Journal of Computer and System Sciences, 64 (2002), 628-654.
    (Note: preliminary version in PODS'99, pages 102-113.)
  189. Lower bounds for invariant queries in logics with counting.
  190. Leonid Libkin and Limsoon Wong.
    Theoretical Computer Science, 288 (2002), 153-180.
  191. Logics with aggregate operators.
  192. Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong.
    Journal of the ACM, 48 (2001), 880-907.
    (Note: preliminary version in LICS'99, pages 35-44.)
  193. A model-theoretic approach to regular string relations.
  194. Michael Benedikt, Leonid Libkin, Thomas Schwentick and Luc Segoufin.
    In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'01), pages 431-440.
  195. String operations in query languages.
  196. Michael Benedikt, Leonid Libkin, Thomas Schwentick and Luc Segoufin.
    In Proceedings of the 20th Symposium on Principles of Database Systems (PODS'01), pages 183-194.
  197. On the orthographic dimension of definable sets.
  198. Stavros Cosmadakis, Gabriel Kuper and Leonid Libkin.
    Information Processing Letters, 79 (2001), 141-145.
  199. Logics capturing local properties.
  200. Leonid Libkin.
    ACM Transactions on Computational Logic (TOCL), 2 (2001), 135-153. 
    (Note: preliminary version in STACS'00, pages 217-229.)
  201. Relational queries over interpreted structures.
  202. Michael Benedikt and Leonid Libkin.
    Journal of the ACM, 47 (2000), 644-680.
  203. Variable independence, quantifier elimination, and constraint representations.
  204. Leonid Libkin.
    In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'00), pages 260-271.
  205. Logics with counting and local properties.
  206. Leonid Libkin.
    ACM Transactions on Computational Logic (TOCL), 1 (2000), 33-59.
  207. Safe constraint queries.
  208. Michael Benedikt and Leonid Libkin.
    SIAM Journal on Computing, 29 (2000), 1652-1682.
    (Note: preliminary version in PODS'98, pages 99-108.)
  209. Local properties of query languages.
  210. Guozhu Dong, Leonid Libkin and Limsoon Wong.
    Theoretical Computer Science, 239 (2000), 277-308.
    (Note: preliminary version in ICDT'97, pages 140-154.)
  211. Introduction.
  212. Gabriel Kuper, Leonid Libkin and Jan Paredaens.
    In Constraint Databases, Springer-Verlag, 2000, pages 1-16.
  213. Expressive power: the finite case.
  214. Michael Benedikt and Leonid Libkin.
    In Constraint Databases, Springer-Verlag, 2000, pages 55-87.
  215. Query safety with constraints.
  216. Michael Benedikt and Leonid Libkin.
    In Constraint Databases, Springer-Verlag, 2000, pages 109-129.
  217. Aggregate languages for constraint databases.
  218. Jan Chomicki and Leonid Libkin.
    In Constraint Databases, Springer-Verlag, 2000, pages 131-154.
  219. Counting and locality over finite structures: a survey.
  220. Leonid Libkin and Juha Nurmonen.
    In Generalized Quantifiers and Computation, Springer LNCS 1754, pages 18-50.
  221. Maintaining the transitive closure of graphs in SQL.
  222. Guozhu Dong, Leonid Libkin, Jianwen Su and Limsoon Wong.
    Int. Journal of Information Technology, 5 (1999), 46-78.
  223. Notions of locality and their logical characterizations over finite models.
  224. Lauri Hella, Leonid Libkin and Juha Nurmonen.
    Journal of Symbolic Logic, 64 (1999), 1751-1773.
  225. Query languages with arithmetic and constraint databases.
  226. Leonid Libkin.
    SIGACT News, (Database Theory Column), December 1999, pages 41-50.
  227. Some remarks on variable independence, closure, and orthographic dimension in constraint databases.
  228. Leonid Libkin.
    SIGMOD Record, 28 (1999), pages 24-28.
  229. What you can and cannot say in SQL, or proving folk theorems in database theory (abstract of invited talk).
  230. Leonid Libkin.
    In Proceedings of 15emes Journes Bases de Donnes Avances (BDA'99), p. 425.
  231. On the power of incremental evaluation in SQL-like languages.
  232. Leonid Libkin and Limsoon Wong.
    In Proceedings of Database Programming Languages (DBPL'99).
  233. Logics with counting, auxiliary relations, and lower bounds for invariant queries.
  234. Leonid Libkin.
    In Proceedings of IEEE Symposium on Logic in Computer Science (LICS'99), pages 316-325.
  235. Exact and approximate aggregation in constraint query languages.
  236. Michael Benedikt and Leonid Libkin.
    In Proceedings of the 18th Symposium on Principles of Database Systems (PODS'99), pages 102-113.
  237. Verifiable properties of database transactions.
  238. Michael Benedikt, Timothy Griffin and Leonid Libkin.
    Information and Computation, 147 (1998), 57-88.
    (Note: Preliminary version in PODS'96, pages 117-127.)
  239. On counting logics and local properties.
  240. Leonid Libkin.
    In Proceedings of IEEE Symposium on Logic in Computer Science (LICS'98), pages 501-512.
  241. Relational expressive power of constraint query languages.
  242. Michael Benedikt, Guozhu Dong, Leonid Libkin and Limsoon Wong.
    Journal of the ACM, 45 (1998), 1-34.
    (Note: Preliminary version in PODS'96, pages 5-16.)
  243. Unary quantifiers, transitive closure, and relations of large degree.
  244. Leonid Libkin and Limsoon Wong.
    In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS'98), Springer LNCS 1373, pp. 183-193.
  245. A semantics-based approach to design of query languages for databases with partial information.
  246. Leonid Libkin.
    In Semantics in Databases, Springer LNCS 1358, pp. 170-208.
  247. Models of approximation in databases.
  248. Leonid Libkin.
    Theoretical Computer Science, 190 (1998), 167-210.
  249. On the power of aggregation in relational query languages.
  250. Leonid Libkin and Limsoon Wong.
    In Database Programming Languages (DBPL'97), Springer LNCS 1369, pages 260-280.
  251. Incremental recomputation of recursive queries with nested sets and aggregate functions.
  252. Leonid Libkin and Limsoon Wong.
    In Database Programming Languages (DBPL'97), Springer LNCS 1369, pages 222-238.
  253. Query languages for bags and aggregate functions.
  254. Leonid Libkin and Limsoon Wong.
    Journal of Computer and System Sciences, 55 (2) (1997), 241-272.
  255. On the forms of locality over finite models.
  256. Leonid Libkin.
    In Proceedings of IEEE Symposium on Logic in Computer Science (LICS'97), pages 204-215.
  257. An improved algorithm for incremental recomputation of active relational expressions.
  258. Timothy Griffin, Leonid Libkin and Howard Trickey.
    IEEE Transactions on Knowledge and Data Engineering, 9 (3) (1997), 508-511.
  259. Languages for relational databases over interpreted structures.
  260. Michael Benedikt and Leonid Libkin.
    In Proceedings of the 16th Symposium on Principles of Database Systems (PODS'97), pages 87-98.
  261. Tractable iteration mechanisms for bag languages.
  262. Latha Colby and Leonid Libkin.
    In Proceedings of the 6th International Conference on Database Theory (ICDT'97), Springer LNCS 1186, pp. 461-475.
  263. Query languages for bags: expressive power and complexity.
  264. Stephane Grumbach, Leonid Libkin, Tova Milo and Limsoon Wong.
    SIGACT News, (Database Theory Column), June 1996, pages 30-37.
  265. On the structure of queries in constraint query languages.
  266. Michael Benedikt and Leonid Libkin.
    In Proceedings of IEEE Symposium on Logic in Computer Science (LICS'96), pages 25-34.
  267. A query language for multidimensional arrays: design, implementation and optimization techniques.
  268. Leonid Libkin, Rona Machlin and Limsoon Wong.
    In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'96), pages 228-239.
  269. Algorithms for deferred view maintenance.
  270. Latha Colby, Timothy Griffin, Leonid Libkin, Inderpal Mumick and Howard Trickey.
    In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'96), pages 469-480.
    (Note: reprtinted in Materialized Views, The MIT Press, 1999.)
  271. Query language primitives for programming with incomplete databases.
  272. Leonid Libkin.
    In Proceedings of DBPL'95.
  273. On impossibility of decremental recomputation of recursive queries in relational calculus and SQL.
  274. Guozhu Dong, Leonid Libkin and Limsoon Wong.
    In Proceedings of DBPL'95.
  275. Semantic representations and query languages for or-sets.
  276. Leonid Libkin and Limsoon Wong.
    Journal of Computer and System Sciences, 52 (1) (1996), 125-142. (Note: Preliminary version in PODS'93, pp. 37-48.)
  277. On representation and querying incomplete information in databases with bags.
  278. Leonid Libkin and Limsoon Wong.
    Information Processing Letters, 56 (4) (1995), 209-214.
  279. Trees as semilattices.
  280. Leonid Libkin and Vladimir Gurvich.
    Discrete Mathematics, 145 (1995), 321-327.
  281. Approximation in databases.
  282. Leonid Libkin.
    In Proceedings of the International Conference on Database Theory (ICDT'95), Springer LNCS 893, pp. 411-424.
  283. Normalizing incomplete databases.
  284. Leonid Libkin.
    In Proceedings of the 14th Symposium on Principles of Database Systems (PODS'95), pp. 219-230.
  285. Incremental maintenance of views with duplicates.
  286. Timothy Griffin and Leonid Libkin.
    In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95), pp. 328-339. (Note: reprtinted in Materialized Views, The MIT Press, 1999.)
  287. Interfacing HOL90 with a functional database query language.
  288. Elsa Gunter and Leonid Libkin.
    In Proceedings of the International Workshop on Higher Order Logic Theorem Proving and its Applications, 1995, Springer LNCS 971, pp. 328-339.
  289. Direct decompositions of atomistic algebraic lattices.
  290. Leonid Libkin.
    Algebra Universalis, 33 (1995), 127-135.
  291. n-distributivity, dimension and Caratheodory's theorem.
  292. Leonid Libkin.
    Algebra Universalis, 34 (1995), 72-95.
  293. Conservativity of nested relational calculi with internal generic functions.
  294. Leonid Libkin and Limsoon Wong.
    Information Processing Letters, 49 (1994), 273-280.
  295. Comprehension syntax.
  296. Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen and Limsoon Wong.
    SIGMOD Record, 23 (1994), 87-96.
  297. Some properties of query languages for bags.
  298. Leonid Libkin and Limsoon Wong.
    In Proceedings of the Workshop on Database Programming Languages, Springer Verlag, 1994, pp. 97--114.
  299. Aggregate functions, conservative extension and linear order.
  300. Leonid Libkin and Limsoon Wong.
    In Proceedings of the Workshop on Database Programming Languages, Springer Verlag, 1994, pp. 282--294.
  301. New techniques for studying set languages, bag languages, and aggregate functions.
  302. Leonid Libkin and Limsoon Wong.
    In Proceedings of the 13th Symposium on Principles of Database Systems (PODS'94), pp. 155--166.
  303. OR-SML: A functional database programming language with support for disjunctive information.
  304. Elsa Gunter and Leonid Libkin.
    In Proceedings of the International Conference on Database and Expert Systems Applications, Springer LNCS 856, pp. 641-650.
  305. The lattice of subsemilattices of a semilattice.
  306. Leonid Libkin and Ilya Muchnik.
    Algebra Universalis, 31 (1994), 252--255.
  307. Aspects of Partial Information in Databases (PhD Thesis).
  308. Leonid Libkin. University of Pennsylvania, 1994.
  309. Direct product decompositions of lattices, closures and relation schemes.
  310. Leonid Libkin.
    Discrete Mathematics,
    112 (1993), 119-138.
  311. A remark about algebraicity in complete partial orders.
  312. Leonid Libkin.
    Journal of Pure and Applied Algebra, 86 (1993), 75-77.
  313. On the interaction between closure operations and choice functions with applications to relational databases.
  314. Janos Demetrovics, Gusztav Hencsey, Leonid Libkin and Ilya Muchnik.
    Acta Cybernetica, 10 (3) (1992), 129-139.
  315. Normal form relation schemes: a new characterization.
  316. Janos Demetrovics, Gusztav Hencsey, Leonid Libkin and Ilya Muchnik.
    Acta Cybernetica, 10 (3) (1992), 141-153.
  317. Functional dependencies in relational databases: a lattice point of view.
  318. Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
    Discrete Applied Mathematics, 40 (1992), 155-185. (Note: Preliminary version in MFDBS'89.)
  319. An elementary proof that upper and lower powerdomain constructions commute.
  320. Leonid Libkin.
    Bulletin of the EATCS, 48 (1992), 175-177.
  321. Decomposition of domains.
  322. Achim Jung, Leonid Libkin and Hermann Puhlmann.
    In Proceedings of the Conference on Mathematical Foundations of Programming Semantics (MFPS'91), Springer LNCS 598, pp. 235-258.
  323. Quasiconvex analysis on semilattices and absolutely determined matrices.
  324. Vladimir Gurvich and Leonid Libkin.
    Soviet Mathematics Doklady, 44 (1) (1992), 20-25.
  325. Parallel axiom in convexity lattices.
  326. Leonid Libkin.
    Periodica Mathematica Hungarica, 24 (1) (1992), 1-12.
  327. Separatory sublattices and subsemilattices.
  328. Leonid Libkin and Ilya Muchnik.
    Studia Scientiarum Mathematicarum Hungarica, 27 (1992), 471-477.
  329. A relational algebra for complex objects based on partial information.
  330. Leonid Libkin.
    In Proceedings of the Conference on Mathematical Fundamentals of Database Systems (MFDBS'91), Springer LNCS 495, pp. 29-43.
  331. On relational database schemes having unique minimal key.
  332. Joachim Biskup, Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
    Journal of Information Processing and Cybernetics, 27 (4) (1991), 217-225.
  333. Separability in lattices.
  334. Leonid Libkin.
    In Ordered Sets and Lattices (Russian), Saratov, 1991, pp. 78-88.
  335. Absolutely determined matrices.
  336. Vladimir Gurvich and Leonid Libkin.
    Mathematical Social Science, 20 (1) (1990), 1-18.
  337. Investigations on Armstrong relations, dependency inference and excluded functional dependencies.
  338. Georg Gottlob and Leonid Libkin.
    Acta Cybernetica, 9 (4) (1990), 385-402.
  339. Quasilinear monotone systems.
  340. Leonid Libkin, Ilya Muchnik and Leonid Schvartzer.
    Automation and Remote Control, 50 (9) (1989), 1249-1259.
  341. Quasilinear set-functions and absolute definite matrices.
  342. Vladimir Gurvich and Leonid Libkin.
    Automation and Remote Control, 50 (12) (1989), 1706-1709.
  343. Halfspaces and hyperplanes in convexity lattices.
  344. Leonid Libkin and Ilya Muchnik.
    Institute of Mathematics, Budapest, Hungary, 1989.
  345. Functional dependencies and the semilattice of closed classes.
  346. Janos Demetrovics, Leonid Libkin and Ilya Muchnik.
    In Proceedings of the Conference on Mathematical Fundamentals of Database Systems (MFDBS'89), Springer LNCS 364, pp. 136-147.
  347. Recognition of choice functions.
  348. Leonid Libkin.
    Automation and Remote Control, 49 (10) (1988), 1355-1358.
  349. Minimal sets of choice functions generating the basic classes.
  350. Leonid Libkin.
    Automation and Remote Control, 49 (12) (1988), 1662-1665.
  351. Separatory subsemilattices and their properties.
  352. Leonid Libkin and Ilya Muchnik.
    MTA SZTAKI Kozlemenyek, 39 (1988), 83-92.
  353. Separation theorems for lattices.
  354. Leonid Libkin.
    MTA SZTAKI Kozlemenyek, 39 (1988), 93-100.
  355. On a subsemilattice-lattice of a semilattice.
  356. Leonid Libkin and Ilya Muchnik.
    MTA SZTAKI Kozlemenyek, 39 (1988), 101-110.
  357. Pseudocriteria induced by set-functions.
  358. Leonid Libkin and Ilya Muchnik.
    In Proceedings of the Conference on Decision-Making (Russian), Moscow, 1988, pp. 124-125.
  359. Algebraic methods for construction and analysis of the choice function classes.
  360. Leonid Libkin.
    In Fuzzy Sets and Individual Choice (Russian), Moscow, 1987, pp. 46-53.