Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Verifiable properties of database transactions
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Querying spatial databases via topological invariants
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
Logics with aggregate operators
Journal of the ACM (JACM)
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Counting and Locality over Finite Structures: A Survey
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On the Power of Incremental Evaluation in SQL-Like Languages
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Logics Capturing Local Properties
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Incremental recomputation in local languages
Information and Computation
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
Theoretical Computer Science - Database theory
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Counting Modulo Quantifiers on Finite Linearly Ordered Trees
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Role of Decidability in First Order Separations over Classes of Finite Structures
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Existential heap abstraction entailment is undecidable
SAS'03 Proceedings of the 10th international conference on Static analysis
Easy problems for grid-structured graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Proceedings of the forty-second ACM symposium on Theory of computing
Extensions of MSO and the monadic counting hierarchy
Information and Computation
An algorithmic account of ehrenfeucht games on labeled successor structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Local transformations and conjunctive-query equivalence
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Solutions and query rewriting in data exchange
Information and Computation
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |