ACM SIGACT News
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Conjunctive queries over trees
Journal of the ACM (JACM)
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Recognizability, hypergraph operations, and logical types
Information and Computation
The first order definability of graphs: upper bounds for quantifier depth
Discrete Applied Mathematics
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Alternative Logics: a book review: SIGACT news logic column 18
ACM SIGACT News
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Controlled query evaluation with open queries for a decidable relational submodel
Annals of Mathematics and Artificial Intelligence
Arity and alternation: a proper hierarchy in higher order logics
Annals of Mathematics and Artificial Intelligence
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
Electronic Notes in Theoretical Computer Science (ENTCS)
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Homomorphism preservation theorems
Journal of the ACM (JACM)
Expressive power and abstraction in Essence
Constraints
Ehrenfeucht--Fraïssé games in finite set theory
Information Processing Letters
Muller message-passing automata and logics
Information and Computation
Expressiveness and complexity of XML publishing transducers
ACM Transactions on Database Systems (TODS)
On Complexity of Ehrenfeucht-Fraïssé Games
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On the Descriptive Complexity of Linear Algebra
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On Counting Generalized Colorings
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
When Is Reachability Intrinsically Decidable?
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
ACM Computing Surveys (CSUR)
The Relational Polynomial-Time Hierarchy and Second-Order Logic
Semantics in Data and Knowledge Bases
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Consistent query answering under primary keys: a characterization of tractable queries
Proceedings of the 12th International Conference on Database Theory
Query languages for data exchange: beyond unions of conjunctive queries
Proceedings of the 12th International Conference on Database Theory
A compositional query algebra for second-order logic and uncertain databases
Proceedings of the 12th International Conference on Database Theory
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
Unary automatic graphs: An algorithmic perspective
Mathematical Structures in Computer Science
Analysing Complexity in Classes of Unary Automatic Structures
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
From Hilbert's program to a logic tool box
Annals of Mathematics and Artificial Intelligence
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the consistent rewriting of conjunctive queries under primary key constraints
Information Systems
Ehrenfeucht-Fraïssé Games on Random Structures
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Linear Functional Fixed-points
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Recursive Definitions and Fixed-Points
Electronic Notes in Theoretical Computer Science (ENTCS)
A logical framework for configuration software
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
Logical queries over views: Decidability and expressiveness
ACM Transactions on Computational Logic (TOCL)
Declarative programming of search problems with built-in arithmetic
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Journal of Logic, Language and Information
Destructive Rule-Based Properties and First-Order Logic
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizability, hypergraph operations, and logical types
Information and Computation
Constraint processing in relational database systems: from theory to implementation
Proceedings of the 2010 ACM Symposium on Applied Computing
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Properties of Almost All Graphs and Generalized Quantifiers
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Views and queries: Determinacy and rewriting
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the parameterised intractability of monadic second-order logic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Composition and inversion of schema mappings
ACM SIGMOD Record
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
A remark on the complexity of consistent conjunctive query answering under primary key violations
Information Processing Letters
Journal of Automated Reasoning
XML with incomplete information
Journal of the ACM (JACM)
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Database theory: query languages
Algorithms and theory of computation handbook
Application of logic to integer sequences: a survey
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
SXPath: extending XPath towards spatial querying on web documents
Proceedings of the VLDB Endowment
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
PBINT, a logic for modelling search problems involving arithmetic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Value joins are expensive over (probabilistic) XML
Proceedings of the 4th International Workshop on Logic in Databases
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
Definability of combinatorial functions and their linear recurrence relations
Fields of logic and computation
Parallel evaluation of conjunctive queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive power of query languages for constraint complex value databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Answer set programming's contributions to classical logic: an analysis of ASP methodology
Logic programming, knowledge representation, and nonmonotonic reasoning
Recursive definitions and fixed-points on well-founded structures
Theoretical Computer Science
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Automatic verification of data-centric business processes
BPM'11 Proceedings of the 9th international conference on Business process management
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Invariants of automatic presentations and semi-synchronous transductions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Preservation under extensions on well-behaved finite structures
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model-checking hierarchical structures
Journal of Computer and System Sciences
First-Order queries over one unary function
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Complete problems for higher order logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A relationship-based approach to model integration
Innovations in Systems and Software Engineering
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The expressive power of two-variable least fixed-point logics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Random databases and threshold for monotone non-recursive datalog
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Controlled query evaluation with open queries for a decidable relational submodel
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Closure properties of weak systems of bounded arithmetic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On the model-checking of monadic second-order formulas with edge set quantifications
Discrete Applied Mathematics
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The implication problem for 'closest node' functional dependencies in complete XML documents
Journal of Computer and System Sciences
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Datalog as a query language for data exchange systems
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Certain conjunctive query answering in first-order logic
ACM Transactions on Database Systems (TODS)
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Highly expressive query languages for unordered data trees
Proceedings of the 15th International Conference on Database Theory
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Proceedings of the 15th International Conference on Database Theory
Computer Science Review
Experimental descriptive complexity
Logic and Program Semantics
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Non-definability of Languages by Generalized First-order Formulas over (N,+)
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
A toolkit for proving limitations of the expressive power of logics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
Certain conjunctive query answering in SQL
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Tractable cases of clean query answering under entity resolution via matching dependencies
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
Subshifts as models for MSO logic
Information and Computation
Relational Hidden Variables and Non-Locality
Studia Logica
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Expressiveness and static analysis of extended conjunctive regular path queries
Journal of Computer and System Sciences
The language of plain SO-tgds: Composition, inversion and structural properties
Journal of Computer and System Sciences
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
Solutions and query rewriting in data exchange
Information and Computation
On the connections between relational and XML probabilistic data models
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
Temporal description logic for ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
A representation theorem for (q-)holonomic sequences
Journal of Computer and System Sciences
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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
Two-Variable Logic with Counting and Trees
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |