Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Horn clauses and the fixpoint query hierarchy
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
A framework for choosing a database query language
ACM Computing Surveys (CSUR)
Logic and databases: a critique
ACM SIGACT News
On the integrity of databases with incomplete information
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Logic and databases: a critique
ACM SIGPLAN Notices
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the representation and querying of sets of possible worlds
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
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
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
Horn tables-an efficient tool for handling incomplete information in databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypothetical datalog negation and linear recursion
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
IDLOG: extending the expressive power of deductive database languages
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
ACM SIGACT News
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On the power of rule-based languages with sets
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
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
Semi-determinism (extended abstract)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
The parallel complexity of simple logic programs
Journal of the ACM (JACM)
Reflective programming in the relational algebra
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finding nonrecursive envelopes for Datalog predicate
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards a unified visual database access
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Interpreting a reconstructed relational calculus (extended abstract)
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
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
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bonded arity Datalog (≠) queries on graphs
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
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
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
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reasoning about strings in databases
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database querying and constraint programming
ACM SIGACT News
Declarative updates of relational databases
ACM Transactions on Database Systems (TODS)
Query evaluation in deductive databases with alternating fixpoint semantics
ACM Transactions on Database Systems (TODS)
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
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
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)
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth 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
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Polynomial time query processing in temporal deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Workflow, transactions and datalog
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the expressive power of database queries with intermediate types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal deductive databases and infinite objects
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
Querying temporal constraint networks in PTIME
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
On the expressive power of the logical data model: prelimiary report
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Existential second-order logic over strings
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-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
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational properties of metaquerying problems
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
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Representing and querying XML with incomplete information
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logics with aggregate operators
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Adding for-loops to first-order logic
Information and Computation
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
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
Knowledge compilation = query rewriting + view synthesis
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)
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
On the complexity analysis of static analyses
Journal of the ACM (JACM)
On the complexity and axiomatizability of consistent database states
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
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
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
SLT-Resolution for the Well-Founded Semantics
Journal of Automated Reasoning
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Linear time and the power of one first-order universal quantifier
Information and Computation
ACM SIGMOD Record
Protecting deductive databases from unauthorized retrieval and update requests
Data & Knowledge Engineering - Data and applications security
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Lower bounds for invariant queries in logics with counting
Theoretical Computer Science - Complexity and logic
Foundations of Secure Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Parameterized complexity for the database theorist
ACM SIGMOD Record
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Scalar Aggregation in FD-Inconsistent Databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th 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
Query Languages for Real Number Databases Based on Descriptive Complexity over R
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The Power of Methods With Parallel Semantics
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Language Constructs for Programming Active Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Capturing LOGSPACE over Hereditarily-Finite Sets
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Describing Parameterized Complexity Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking over Locally Tree-Decomposable Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Well-Founded Optimism: Inheritance in Frame-Based Knowledge Bases
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
TRBAC: A Temporal Authorization Model
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
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
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
On Complexity of Updates through Integrity Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Meta-complexity Theorems: Talk Abstract
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint 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
Partial Fixed-Point Logic on Infinite Structures
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New Generation Computing
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
Scalar aggregation in inconsistent databases
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
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
View-Based Query Processing and Constraint Satisfaction
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
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
The description logic handbook
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation - TACS 2001
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Reasoning on regular path queries
ACM SIGMOD Record
Describing parameterized complexity classes
Information and Computation
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation
IEEE Transactions on Knowledge and Data Engineering
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
Minimal founded semantics for disjunctive logic programs and deductive databases
Theory and Practice of Logic Programming
Declarative semantics for active rules
Theory and Practice of Logic Programming
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Logic-based web information extraction
ACM SIGMOD Record
Information and Computation
Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time
Journal of Logic, Language and Information
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finite structure query: a tool for querying syntactically annotated corpora
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Query answering exploiting structural properties
ACM SIGMOD Record
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Interconnection semantics for keyword search in XML
Proceedings of the 14th ACM international conference on Information and knowledge management
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
Conjunctive queries over trees
Journal of the ACM (JACM)
Representing and querying XML with incomplete information
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
The complexity of data exchange
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Combining relational algebra, SQL, constraint modelling, and local search
Theory and Practice of Logic Programming
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A crash course on database queries
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
Arity and alternation: a proper hierarchy in higher order logics
Annals of Mathematics and Artificial Intelligence
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Outlier detection by logic programming
ACM Transactions on Computational Logic (TOCL)
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Survey of graph database models
ACM Computing Surveys (CSUR)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
Efficiently enumerating results of keyword search over data graphs
Information Systems
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning with recursive loops under the PLP framework
ACM Transactions on Computational Logic (TOCL)
ACM SIGACT News
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
Expressive power and abstraction in Essence
Constraints
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
Expressiveness and complexity of XML publishing transducers
ACM Transactions on Database Systems (TODS)
Outlier detection using default reasoning
Artificial Intelligence
Parameterized Complexity and Logic
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
25 Years of Model Checking
Efficient Handling of Relational Database Combinatorial Queries Using CSPs
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
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
Reasoning about Conditions and Exceptions to Laws in Regulatory Conformance Checking
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
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
One Useful Logic That Defines Its Own Truth
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Generating XML structure using examples and constraints
Proceedings of the VLDB Endowment
ACM Computing Surveys (CSUR)
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
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
Mathematical logic and quantum finite state automata
Theoretical Computer Science
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Running tree automata on probabilistic XML
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
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Tractable reasoning in first-order knowledge bases with disjunctive information
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
DL-lite in the light of first-order logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A tractability result for reasoning with incomplete first-order knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Consistent query answers in the presence of universal constraints
Information Systems
Computational linguistics and generative linguistics: the triumph of hope over experience
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
The trichotomy of HAVING queries on a probabilistic database
The VLDB Journal — The International Journal on Very Large Data Bases
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Artificial Intelligence
Discovering functional dependencies for multidimensional design
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Controlled Aggregate Tree Shaped Questions over Ontologies
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Ontology-Driven Provenance Management in eScience: An Application in Parasite Research
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Choiceless Polynomial Time, Counting and the Cai--Fürer--Immerman Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Minimal-change integrity maintenance using tuple deletions
Information and Computation
The DL-lite family and relations
Journal of Artificial Intelligence Research
Reconciling description logics and rules
Journal of the ACM (JACM)
Consistent query answering over description logic ontologies
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Polynomial time queries over inconsistent databases with functional dependencies and foreign keys
Data & Knowledge Engineering
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Journal on data semantics X
Synthesizing view definitions from data
Proceedings of the 13th International Conference on Database Theory
Pillars of computer science
Towards a logical reconstruction of a theory for locally closed databases
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On probabilistic fixpoint and Markov chain query languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-point definability and polynomial time
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
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
Machine models for query processing
ACM SIGMOD Record
Composition and inversion of schema mappings
ACM SIGMOD Record
Disjunctive databases for representing repairs
Annals of Mathematics and Artificial Intelligence
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Terminological cycles in KL-ONE-based knowledge representation languages
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
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
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
Controlled English ontology-based data access
CNL'09 Proceedings of the 2009 conference on Controlled natural language
The data complexity of the syllogistic fragments of English
Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Complexity of higher-order queries
Proceedings of the 14th International Conference on Database Theory
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
From polynomial time queries to graph structure theory
Communications of the ACM
Queries and materialized views on probabilistic databases
Journal of Computer and System Sciences
Foundations of Semantic Web databases
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Fields of logic and computation
Existential fixed-point logic, universal quantifiers, and topoi
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
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying semantic web data with SPARQL
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Score-consistent algebraic optimization of full-text search queries with GRAFT
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management
Querying the fragments of english
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Generic expression hardness results for primitive positive formula comparison
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
Polynomial conjunctive query rewriting under unary inclusion dependencies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Query evaluation on a database given by a random graph
ICDT'07 Proceedings of the 11th international conference on Database Theory
The limits of querying ontologies
ICDT'07 Proceedings of the 11th international conference on Database Theory
Towards top-k query answering in description logics: the case of DL-Lite
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
Model-checking hierarchical structures
Journal of Computer and System Sciences
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Expressiveness and performance of full-text search languages
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
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
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
The expressive power of two-variable least fixed-point logics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Arity and alternation: a proper hierarchy in higher order logics
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
Frameworks for logically classifying polynomial-time optimisation problems
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Preference-driven querying of inconsistent relational databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Inheritance in rule-based frame systems: semantics and inference
Journal on Data Semantics VII
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
SOF: a semantic restriction over second-order logic and its polynomial-time hierarchy
Conceptual Modelling and Its Theoretical Foundations
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Equivalence between extended datalog programs -- a brief 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
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
Proceedings of the 21st international conference on World Wide Web
ACM Transactions on Database Systems (TODS)
Top-k retrieval for ontology mediated access to relational databases
Information Sciences: an International Journal
On the complexity of package recommendation problems
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
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the decidability and complexity of identity knowledge representation
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
P-top-k queries in a probabilistic framework from information extraction models
Computers & Mathematics with Applications
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
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
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Proceedings of the VLDB Endowment
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
On the complexity of ontological reasoning under disjunctive existential rules
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)
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
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
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd 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
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Generic expression hardness results for primitive positive formula comparison
Information and Computation
Querying Semantic Data on the Web?
ACM SIGMOD Record
Query processing under GLAV mappings for relational and graph databases
Proceedings of the VLDB Endowment
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
Data exchange beyond complete data
Journal of the ACM (JACM)
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Conjunctive queries with negation over DL-Lite: a closer look
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
On the complexity of query result diversification
Proceedings of the VLDB Endowment
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
Reasoning about explanations for negative query answers in DL-lite
Journal of Artificial Intelligence Research
| Hi-index | 0.02 |
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of evaluating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical languages - relational calculus and its extensions by transitive closure, fixpoint and second order existential quantification - and algebraic languages - relational algebra and its extensions by bounded and unbounded looping. The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness in some complexity class.