The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On accessing object-oriented databases: expressive power, complexity, and restrictions
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of query processing in databases with OR-objects
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the first-order expressibility of recursive queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Expressibility of bounded-arity fixed-point query hierarchies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics of aggregation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semi-determinism (extended abstract)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GENOA: a customizable language- and front-end independent code analyzer
ICSE '92 Proceedings of the 14th international conference on Software engineering
The parallel complexity of simple logic programs
Journal of the ACM (JACM)
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
On the expressive power of query languages
ACM Transactions on Information Systems (TOIS)
Will I be pretty, will I be rich?: some thoughts on theory vs. practice in systems engineering
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs
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
A query language for list-based complex objects
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Functional database query languages as typed lambda calculi of fixed order (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database querying and constraint programming
ACM SIGACT News
Sequences, Datalog and transducers
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dense-order constraint databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth 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
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Perspectives on database theory
ACM SIGACT News
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Querying spatial databases via topological invariants
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
On the expressive power of datalog: tools and a case study
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth 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
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GENOA—a customizable, front-end-retargetable source code analysis framework
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Existential second-order logic over strings
Journal of the ACM (JACM)
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)
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth 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)
Adding for-loops to first-order logic
Information and Computation
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Toupie: The µ-calculus over Finite Domains as a Constraint Language
Journal of Automated Reasoning
ACM SIGMOD Record
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
The Power of Methods With Parallel Semantics
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Efficient Reasoning Using the Local Closed-World Assumption
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
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
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, an Introduction
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
On Complexity of Updates through Integrity Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
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
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Handbook of automated reasoning
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of variable-confined logics
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
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
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
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
Describing parameterized complexity classes
Information and Computation
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Logic-based web information extraction
ACM SIGMOD Record
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Expressive power and abstraction in Essence
Constraints
On the Descriptive Complexity of Linear Algebra
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-Point Quantifiers in Higher Order Logics
Proceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII
Expressiveness of concept expressions in first-order description logics
Artificial Intelligence
Choiceless Polynomial Time, Counting and the Cai--Fürer--Immerman Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Fields of logic and computation
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Choiceless computation and symmetry
Fields of logic and computation
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
Quantum finite automata and logics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Nested constraints and application conditions for high-level structures
Formal Methods in Software and Systems Modeling
The expressive power of two-variable least fixed-point logics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
SOF: a semantic restriction over second-order logic and its polynomial-time hierarchy
Conceptual Modelling and Its Theoretical Foundations
Datalog for security, privacy and trust
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Pebble games with algebraic rules
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Meta-Queries on Deductive Databases
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |