Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New techniques for studying set languages, bag languages and aggregate functions
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Verifiable properties of database transactions
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Existential second-order logic over strings
Journal of the ACM (JACM)
Reachability and connectivity queries in constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logics with aggregate operators
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
Distributed computation of web queries using automata
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational complexity of some problems involving congruences on algebras
Theoretical Computer Science
Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
ACM SIGMOD Record
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
UPSILON: universal programming system with incomplete lazy object notation
Fundamenta Informaticae
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Capturing LOGSPACE over Hereditarily-Finite Sets
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Describing Parameterized Complexity Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Perspective on Lindström Quantifiers and Oracles
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Generalized Quantifiers in Logic Programs
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Generalized Quantifiers, an Introduction
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
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
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Logspace Reducibility via Abstract State Machines
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Automatic Verification of Abstract State Machines
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Capture Complexity by Partition
CSL '01 Proceedings of the 15th International Workshop 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
Declarative specification of Web sites with S
The VLDB Journal — The International Journal on Very Large Data Bases
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental recomputation in local languages
Information and Computation
An n! lower bound on formula size
ACM Transactions on Computational Logic (TOCL)
New Generation Computing
Handbook of massive data sets
A note on first-order projections and games
Theoretical Computer Science
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
A generalization of Fagin's theorem
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computational Complexity of Some Problems Involving Congruences on Algebras
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences - Special issue on PODS 2000
Note: a descriptive complexity approach to the linear hierarchy
Theoretical Computer Science
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
Describing parameterized complexity classes
Information and Computation
Graph properties checkable in linear time in the number of vertices
Journal of Computer and System Sciences
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
The Polynomial and Linear Hierarchies in V0
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical logic and quantum finite state automata
Theoretical Computer Science
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
Finding reductions automatically
Fields of logic and computation
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A logic of reachable patterns in linked data-structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Second-order principles in specification languages for object-oriented programs
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Query languages for graph databases
ACM SIGMOD Record
Proceedings of the 15th International Conference on Database Theory
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
Experimental descriptive complexity
Logic and Program Semantics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.01 |