Search the dblp DataBase
Leonid Libkin :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Timothy Griffin , Leonid Libkin Incremental Maintenance of Views with Duplicates. [Citation Graph (37, 25)][DBLP ] SIGMOD Conference, 1995, pp:328-339 [Conf ] Peter Buneman , Leonid Libkin , Dan Suciu , Val Tannen , Limsoon Wong Comprehension Syntax. [Citation Graph (20, 0)][DBLP ] SIGMOD Record, 1994, v:23, n:1, pp:87-96 [Journal ] Latha S. Colby , Timothy Griffin , Leonid Libkin , Inderpal Singh Mumick , Howard Trickey Algorithms for Deferred View Maintenance. [Citation Graph (17, 21)][DBLP ] SIGMOD Conference, 1996, pp:469-480 [Conf ] Leonid Libkin , Limsoon Wong Some Properties of Query Languages for Bags. [Citation Graph (15, 24)][DBLP ] DBPL, 1993, pp:97-114 [Conf ] Michael Benedikt , Guozhu Dong , Leonid Libkin , Limsoon Wong Relational Expressive Power of Constraint Query Languages. [Citation Graph (15, 18)][DBLP ] PODS, 1996, pp:5-16 [Conf ] Leonid Libkin , Limsoon Wong Aggregate Functions, Conservative Extensions, and Linear Orders. [Citation Graph (12, 23)][DBLP ] DBPL, 1993, pp:282-294 [Conf ] Leonid Libkin , Limsoon Wong New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions. [Citation Graph (11, 18)][DBLP ] PODS, 1994, pp:155-166 [Conf ] Michael Benedikt , Leonid Libkin Languages for Relational Databases over Interpreted Structures. [Citation Graph (9, 24)][DBLP ] PODS, 1997, pp:87-98 [Conf ] Leonid Libkin , Rona Machlin , Limsoon Wong A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques. [Citation Graph (9, 20)][DBLP ] SIGMOD Conference, 1996, pp:228-239 [Conf ] Leonid Libkin , Limsoon Wong Query Languages for Bags and Aggregate Functions. [Citation Graph (9, 0)][DBLP ] J. Comput. Syst. Sci., 1997, v:55, n:2, pp:241-272 [Journal ] Leonid Libkin , Limsoon Wong Semantic Representations and Query Languages for Or-sets. [Citation Graph (8, 12)][DBLP ] PODS, 1993, pp:37-48 [Conf ] Leonid Libkin , Limsoon Wong Conservativity of Nested Relational Calculi with Internal Generic Functions. [Citation Graph (8, 0)][DBLP ] Inf. Process. Lett., 1994, v:49, n:6, pp:273-280 [Journal ] Michael Benedikt , Leonid Libkin On the Structure of Queries in Constraint Query Languages. [Citation Graph (7, 0)][DBLP ] LICS, 1996, pp:25-34 [Conf ] Michael Benedikt , Leonid Libkin Safe Constraint Queries. [Citation Graph (6, 21)][DBLP ] PODS, 1998, pp:99-108 [Conf ] Guozhu Dong , Leonid Libkin , Limsoon Wong On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL. [Citation Graph (5, 12)][DBLP ] DBPL, 1995, pp:7- [Conf ] Leonid Libkin A Relational Algebra for Complex Objects Based on Partial Information. [Citation Graph (5, 16)][DBLP ] MFDBS, 1991, pp:29-43 [Conf ] Michael Benedikt , Leonid Libkin Exact and Approximate Aggregation in Constraint Query. [Citation Graph (5, 25)][DBLP ] PODS, 1999, pp:102-113 [Conf ] Michael Benedikt , Guozhu Dong , Leonid Libkin , Limsoon Wong Relational Expressive Power of Constraint Query Languages. [Citation Graph (5, 0)][DBLP ] J. ACM, 1998, v:45, n:1, pp:1-34 [Journal ] Gabriel M. Kuper , Leonid Libkin , Jan Paredaens Introduction. [Citation Graph (4, 0)][DBLP ] Constraint Databases, 2000, pp:1-16 [Conf ] Elsa L. Gunter , Leonid Libkin OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications. [Citation Graph (4, 0)][DBLP ] DEXA, 1994, pp:641-650 [Conf ] Timothy Griffin , Leonid Libkin , Howard Trickey An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions. [Citation Graph (4, 2)][DBLP ] IEEE Trans. Knowl. Data Eng., 1997, v:9, n:3, pp:508-511 [Journal ] Leonid Libkin , Limsoon Wong Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions. [Citation Graph (3, 18)][DBLP ] DBPL, 1997, pp:222-238 [Conf ] Guozhu Dong , Leonid Libkin , Limsoon Wong Local Properties of Query Languages. [Citation Graph (3, 20)][DBLP ] ICDT, 1997, pp:140-154 [Conf ] Leonid Libkin Approximation in Databases. [Citation Graph (3, 19)][DBLP ] ICDT, 1995, pp:411-424 [Conf ] Leonid Libkin , Limsoon Wong On the Power of Aggregation in Relational Query Languages. [Citation Graph (2, 14)][DBLP ] DBPL, 1997, pp:260-280 [Conf ] Leonid Libkin On the Forms of Locality over Finite Models. [Citation Graph (2, 0)][DBLP ] LICS, 1997, pp:204-215 [Conf ] Michael Benedikt , Timothy Griffin , Leonid Libkin Verifiable Properties of Database Transactions. [Citation Graph (2, 23)][DBLP ] PODS, 1996, pp:117-127 [Conf ] Leonid Libkin Normalizing Incomplete Databases. [Citation Graph (2, 20)][DBLP ] PODS, 1995, pp:219-230 [Conf ] Leonid Libkin , Limsoon Wong On Representation and Querying Incomplete Information in Databases with Bags. [Citation Graph (2, 0)][DBLP ] Inf. Process. Lett., 1995, v:56, n:4, pp:209-214 [Journal ] Lauri Hella , Leonid Libkin , Juha Nurmonen , Limsoon Wong Logics with Aggregate Operators. [Citation Graph (1, 0)][DBLP ] LICS, 1999, pp:35-44 [Conf ] János Demetrovics , Leonid Libkin , Ilya B. Muchnik Functional Dependencies and the Semilattice of Closed Classes. [Citation Graph (1, 10)][DBLP ] MFDBS, 1989, pp:136-147 [Conf ] Michael Benedikt , Martin Grohe , Leonid Libkin , Luc Segoufin Reachability and Connectivity Queries in Constraint Databases. [Citation Graph (1, 18)][DBLP ] PODS, 2000, pp:104-115 [Conf ] Michael Benedikt , Leonid Libkin Relational queries over interpreted structures. [Citation Graph (1, 0)][DBLP ] J. ACM, 2000, v:47, n:4, pp:644-680 [Journal ] Leonid Libkin , Limsoon Wong Semantic Representations and Query Labguages for Or-Sets. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:52, n:1, pp:125-142 [Journal ] Michael Benedikt , Leonid Libkin Safe Constraint Queries. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 2000, v:29, n:5, pp:1652-1682 [Journal ] Guozhu Dong , Leonid Libkin , Limsoon Wong Local properties of query languages. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 2000, v:239, n:2, pp:277-308 [Journal ] Leonid Libkin Logics with counting and local properties. [Citation Graph (1, 0)][DBLP ] ACM Trans. Comput. Log., 2000, v:1, n:1, pp:33-59 [Journal ] Leonid Libkin What you can and cannot say in SQL or proving folk theorems in database theory. [Citation Graph (0, 0)][DBLP ] Proc. 15èmes Journées Bases de Données Avancées, BDA, 1999, pp:425- [Conf ] Michael Benedikt , Leonid Libkin Expressive Power: The Finite Case. [Citation Graph (0, 0)][DBLP ] Constraint Databases, 2000, pp:55-87 [Conf ] Michael Benedikt , Leonid Libkin Query Safety with Constraints. [Citation Graph (0, 0)][DBLP ] Constraint Databases, 2000, pp:109-129 [Conf ] Jan Chomicki , Leonid Libkin Aggregate Languages for Constraint Databases. [Citation Graph (0, 0)][DBLP ] Constraint Databases, 2000, pp:131-154 [Conf ] Marcelo Arenas , Pablo Barceló , Leonid Libkin Game-Based Notions of Locality Over Finite Models. [Citation Graph (0, 0)][DBLP ] CSL, 2004, pp:175-189 [Conf ] Marcelo Arenas , Wenfei Fan , Leonid Libkin Consistency of XML Specifications. [Citation Graph (0, 0)][DBLP ] Inconsistency Tolerance, 2005, pp:15-41 [Conf ] Leonid Libkin Query Language Primitives for Programming with Incomplete Databases. [Citation Graph (0, 14)][DBLP ] DBPL, 1995, pp:6- [Conf ] Leonid Libkin , Limsoon Wong On the Power of Incremental Evaluation in SQL-Like Languages. [Citation Graph (0, 0)][DBLP ] DBPL, 1999, pp:17-30 [Conf ] Marcelo Arenas , Wenfei Fan , Leonid Libkin What's Hard about XML Schema Constraints? [Citation Graph (0, 0)][DBLP ] DEXA, 2002, pp:269-278 [Conf ] Leonid Libkin , Juha Nurmonen Counting and Locality over Finite Structures: A Survey. [Citation Graph (0, 0)][DBLP ] ESSLLI, 1997, pp:18-50 [Conf ] Leonid Libkin Variable Independence, Quantifier Elimination, and Constraint Representations. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:260-271 [Conf ] Leonid Libkin Logics for Unranked Trees: An Overview. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:35-50 [Conf ] Denilson Barbosa , Alberto O. Mendelzon , Leonid Libkin , Laurent Mignet , Marcelo Arenas Efficient Incremental Validation of XML Documents. [Citation Graph (0, 0)][DBLP ] ICDE, 2004, pp:671-682 [Conf ] Latha S. Colby , Leonid Libkin Tractable Iteration Mechanisms for Bag Languages. [Citation Graph (0, 16)][DBLP ] ICDT, 1997, pp:461-475 [Conf ] Leonid Libkin Expressive Power of SQL. [Citation Graph (0, 19)][DBLP ] ICDT, 2001, pp:1-21 [Conf ] Marcelo Arenas , Pablo Barceló , Leonid Libkin Combining Temporal Logics for Querying XML Documents. [Citation Graph (0, 0)][DBLP ] ICDT, 2007, pp:359-373 [Conf ] Pablo Barceló , Leonid Libkin Temporal Logics over Unranked Trees. [Citation Graph (0, 0)][DBLP ] LICS, 2005, pp:31-40 [Conf ] Michael Benedikt , Leonid Libkin Tree Extension Algebras: Logics, Automata, and Query Languages. [Citation Graph (0, 0)][DBLP ] LICS, 2002, pp:203-0 [Conf ] Michael Benedikt , Leonid Libkin , Thomas Schwentick , Luc Segoufin A Model-Theoretic Approach to Regular String Relations. [Citation Graph (0, 0)][DBLP ] LICS, 2001, pp:431-0 [Conf ] Leonid Libkin On Counting Logics and Local Properties. [Citation Graph (0, 0)][DBLP ] LICS, 1998, pp:501-512 [Conf ] Leonid Libkin Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:316-325 [Conf ] Leonid Libkin , Frank Neven Logical Definability and Query Languages over Unranked Trees. [Citation Graph (0, 0)][DBLP ] LICS, 2003, pp:178-187 [Conf ] Achim Jung , Leonid Libkin , Hermann Puhlmann Decomposition of Domains. [Citation Graph (0, 0)][DBLP ] MFPS, 1991, pp:235-258 [Conf ] Michael Benedikt , Leonid Libkin , Thomas Schwentick , Luc Segoufin String Operations in Query Languages. [Citation Graph (0, 0)][DBLP ] PODS, 2001, pp:- [Conf ] Marcelo Arenas , Pablo Barceló , Ronald Fagin , Leonid Libkin Locally Consistent Transformations and Query Answering in Data Exchange. [Citation Graph (0, 0)][DBLP ] PODS, 2004, pp:229-240 [Conf ] Marcelo Arenas , Wenfei Fan , Leonid Libkin On Verifying Consistency of XML Specifications. [Citation Graph (0, 0)][DBLP ] PODS, 2002, pp:259-270 [Conf ] Marcelo Arenas , Leonid Libkin A Normal Form for XML Documents. [Citation Graph (0, 0)][DBLP ] PODS, 2002, pp:85-96 [Conf ] Marcelo Arenas , Leonid Libkin An information-theoretic approach to normal forms for relational and XML data. [Citation Graph (0, 0)][DBLP ] PODS, 2003, pp:15-26 [Conf ] Marcelo Arenas , Leonid Libkin XML data exchange: consistency and query answering. [Citation Graph (0, 0)][DBLP ] PODS, 2005, pp:13-24 [Conf ] Wenfei Fan , Leonid Libkin On XML Integrity Constraints in the Presence of DTDs. [Citation Graph (0, 0)][DBLP ] PODS, 2001, pp:- [Conf ] Solmaz Kolahi , Leonid Libkin On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. [Citation Graph (0, 0)][DBLP ] PODS, 2006, pp:114-123 [Conf ] Leonid Libkin Data exchange and incomplete information. [Citation Graph (0, 0)][DBLP ] PODS, 2006, pp:60-69 [Conf ] Leonid Libkin A Semantics-based Approach to Design of Query Languages for Partial Information. [Citation Graph (0, 0)][DBLP ] Semantics in Databases, 1995, pp:170-208 [Conf ] Leonid Libkin Logics Capturing Local Properties. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:217-229 [Conf ] Leonid Libkin , Limsoon Wong Unary Quantifiers, Transitive Closure, and Relations of Large Degree. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:183-193 [Conf ] Elsa L. Gunter , Leonid Libkin Interfacing HOL90 with a Functional Database Query Language. [Citation Graph (0, 0)][DBLP ] TPHOLs, 1995, pp:170-185 [Conf ] János Demetrovics , G. Hencsey , Leonid Libkin , Ilya B. Muchnik On the Interaction Between Closure Operations and Choice Functions with Applications to Relational Database. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1992, v:10, n:3, pp:129-140 [Journal ] János Demetrovics , G. Hencsey , Leonid Libkin , Ilya B. Muchnik Normal Form Relation Schemes: A New Characterization. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1992, v:10, n:3, pp:141-164 [Journal ] Georg Gottlob , Leonid Libkin Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. [Citation Graph (0, 0)][DBLP ] Acta Cybern., 1990, v:9, n:4, pp:385-402 [Journal ] János Demetrovics , Leonid Libkin , Ilya B. Muchnik Functional Dependencies in Relational Databases: A Lattice Point of View. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:40, n:2, pp:155-185 [Journal ] Leonid Libkin An elementary proof that upper and lower powerdomain constructions commute. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1992, v:48, n:, pp:175-177 [Journal ] Joachim Biskup , János Demetrovics , Leonid Libkin , Ilya B. Muchnik On Relational Database Schemes Having Unique Minimal Key. [Citation Graph (0, 0)][DBLP ] Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:4, pp:217-225 [Journal ] Leonid Libkin Locality of Queries and Transformations. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:115-127 [Journal ] Michael Benedikt , Timothy Griffin , Leonid Libkin Verifiable Properties of Database Transactions. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1998, v:147, n:1, pp:57-88 [Journal ] Guozhu Dong , Leonid Libkin , Limsoon Wong Incremental recomputation in local languages. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:181, n:2, pp:88-98 [Journal ] Stavros S. Cosmadakis , Gabriel M. Kuper , Leonid Libkin On the orthographic dimension of definable sets. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2001, v:79, n:3, pp:141-145 [Journal ] Leonid Libkin A collapse result for constraint queries over structures of small degree. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:86, n:5, pp:277-281 [Journal ] Marcelo Arenas , Leonid Libkin An information-theoretic approach to normal forms for relational and XML data. [Citation Graph (0, 0)][DBLP ] J. ACM, 2005, v:52, n:2, pp:246-283 [Journal ] Michael Benedikt , Leonid Libkin , Thomas Schwentick , Luc Segoufin Definable relations and first-order query languages over strings. [Citation Graph (0, 0)][DBLP ] J. ACM, 2003, v:50, n:5, pp:694-751 [Journal ] Wenfei Fan , Leonid Libkin On XML integrity constraints in the presence of DTDs. [Citation Graph (0, 0)][DBLP ] J. ACM, 2002, v:49, n:3, pp:368-406 [Journal ] Lauri Hella , Leonid Libkin , Juha Nurmonen , Limsoon Wong Logics with aggregate operators. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:4, pp:880-907 [Journal ] Michael Benedikt , Martin Grohe , Leonid Libkin , Luc Segoufin Reachability and connectivity queries in constraint databases. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2003, v:66, n:1, pp:169-206 [Journal ] Michael Benedikt , Leonid Libkin Aggregate Operators in Constraint Query Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:64, n:3, pp:628-654 [Journal ] Lauri Hella , Leonid Libkin , Juha Nurmonen Notions of Locality and Their Logical Characterizations over Finite Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1999, v:64, n:4, pp:1751-1773 [Journal ] Leonid Libkin Logics for Unranked Trees: An Overview. [Citation Graph (0, 0)][DBLP ] Logical Methods in Computer Science, 2006, v:2, n:3, pp:- [Journal ] Leonid Libkin Some Remarks on Variable Independence, Closure, and Orthographic Dimension in Constraint Databases. [Citation Graph (0, 6)][DBLP ] SIGMOD Record, 1999, v:28, n:4, pp:24-28 [Journal ] Leonid Libkin Database Principles Column - Introduction. [Citation Graph (0, 0)][DBLP ] SIGMOD Record, 1999, v:28, n:4, pp:29- [Journal ] Kenneth A. Ross , Stefano Ceri , Luis Gravano , Per-Åke Larson , Leonid Libkin , Tova Milo Reminiscences on Influential Papers. [Citation Graph (0, 0)][DBLP ] SIGMOD Record, 2001, v:30, n:1, pp:55-57 [Journal ] Leonid Libkin Expressive power of SQL. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:3, n:296, pp:379-404 [Journal ] Leonid Libkin Models of Approximation in Databases. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:190, n:2, pp:167-210 [Journal ] Leonid Libkin , Limsoon Wong Lower bounds for invariant queries in logics with counting. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:288, n:1, pp:153-180 [Journal ] Thomas Eiter , Leonid Libkin Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:371, n:3, pp:147- [Journal ] Martín Abadi , Leonid Libkin , Frank Pfenning Editorial. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2002, v:3, n:3, pp:335-335 [Journal ] Leonid Libkin Logics capturing local properties. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2001, v:2, n:1, pp:135-153 [Journal ] Leonid Libkin Variable independence for first-order definable constraints. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2003, v:4, n:4, pp:431-451 [Journal ] Marcelo Arenas , Leonid Libkin A normal form for XML documents. [Citation Graph (0, 0)][DBLP ] ACM Trans. Database Syst., 2004, v:29, n:, pp:195-232 [Journal ] Thomas Eiter , Leonid Libkin Introduction to special ICDT section. [Citation Graph (0, 0)][DBLP ] ACM Trans. Database Syst., 2006, v:31, n:3, pp:769- [Journal ] Marcelo Arenas , Pablo Barceló , Leonid Libkin Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:888-900 [Conf ] Rajeev Alur , Marcelo Arenas , Pablo Barceló , Kousha Etessami , Neil Immerman , Leonid Libkin First-Order and Temporal Logics for Nested Words. [Citation Graph (0, 0)][DBLP ] LICS, 2007, pp:151-160 [Conf ] Solmaz Kolahi , Leonid Libkin XML design for relational storage. [Citation Graph (0, 0)][DBLP ] WWW, 2007, pp:1083-1092 [Conf ] Leonid Libkin Normalization Theory for XML. [Citation Graph (0, 0)][DBLP ] XSym, 2007, pp:1-13 [Conf ] Leonid Libkin Logics for Unranked Trees: An Overview [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Leonid Libkin Direct product decompositions of lattices, closures and relation schemes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:112, n:1-3, pp:119-138 [Journal ] Leonid Libkin , Vladimir Gurvich Trees as semilattices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:145, n:1-3, pp:321-327 [Journal ] Michael Benedikt , Leonid Libkin , Frank Neven Logical definability and query languages over ranked and unranked trees. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:2, pp:- [Journal ] Open and Closed World Assumptions in Data Exchange. [Citation Graph (, )][DBLP ] Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. [Citation Graph (, )][DBLP ] On the aggregation problem for synthesized web services. [Citation Graph (, )][DBLP ] On the tradeoff between mapping and querying power in XML data exchange. [Citation Graph (, )][DBLP ] Recurrent Reachability Analysis in Regular Model Checking. [Citation Graph (, )][DBLP ] Reasoning about XML with Temporal Logics and Automata. [Citation Graph (, )][DBLP ] The finite model theory toolbox of a database theoretician. [Citation Graph (, )][DBLP ] XML schema mappings. [Citation Graph (, )][DBLP ] Data exchange and schema mappings in open and closed worlds. [Citation Graph (, )][DBLP ] XML with incomplete information: models, properties, and query answering. [Citation Graph (, )][DBLP ] Certain answers for XML queries. [Citation Graph (, )][DBLP ] Expressive languages for path queries over graph-structured data. [Citation Graph (, )][DBLP ] On Incomplete XML Documents with Integrity Constraints. [Citation Graph (, )][DBLP ] Game-based notions of locality over finite models. [Citation Graph (, )][DBLP ] First-Order and Temporal Logics for Nested Words [Citation Graph (, )][DBLP ] Algorithmic metatheorems for decidable LTL model checking over infinite systems [Citation Graph (, )][DBLP ] Search in 0.046secs, Finished in 0.051secs