The complexity of evaluating relational queries
Information and Control
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational queries computable in polynomial time
Information and Control
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Expressibility and parallel complexity
SIAM Journal on Computing
Definability with bounded number of bound variables
Information and Computation
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Inductive definitions over finite structures
Information and Computation
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
A note on model checking the model &ngr;-calculus
Selected papers of the 16th international colloquium on Automata, languages, and programming
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Model checking and boolean graphs
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Infinitary Logic for Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automata, Tableaux and Temporal Logics (Extended Abstract)
Proceedings of the Conference on Logic of Programs
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Verification of relational tranducers for electronic commerce
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relational queries over interpreted structures
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Games and Model Checking for Guarded Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Inflationary Fixed Points in Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
On the expressive power of variable-confined logics
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic (TOCL)
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An incremental algorithm for computing ranked full disjunctions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
An incremental algorithm for computing ranked full disjunctions
Journal of Computer and System Sciences
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Navigational XPath: calculus and algebra
ACM SIGMOD Record
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
ACM Computing Surveys (CSUR)
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on 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
Tractable reasoning in first-order knowledge bases with disjunctive information
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Complexity of rule redundancy in non-ground answer-set programming over finite domains
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On p-optimal proof systems and logics for PTIME
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Database theory: query languages
Algorithms and theory of computation handbook
On slicewise monotone parameterized problems and optimal proof systems for TAUT
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Extensions of MSO and the monadic counting hierarchy
Information and Computation
Redundancy elimination on RDF graphs in the presence of rules, constraints, and queries
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Query answering under expressive entity-relationship schemata
ER'10 Proceedings of the 29th international conference on Conceptual modeling
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
Polynomial conjunctive query rewriting under unary inclusion dependencies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Ontological query answering via rewriting
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Semantic data markets: a flexible environment for knowledge management
Proceedings of the 20th ACM international conference on Information and knowledge management
A logical toolbox for ontological reasoning
ACM SIGMOD Record
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
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
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
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
On the complexity of hybrid logics with binders
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Efficient reasoning in proper knowledge bases with unknown individuals
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the complexity of ontological reasoning under disjunctive existential rules
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Proceedings of the 32nd symposium on Principles of database systems
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |