scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
zbMath0848.68031MaRDI QIDQ4864249
Serge Abiteboul, Victor Vianu, Richard Hull
Publication date: 30 January 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Related Items
The delay and window size problems in rule-based stream reasoning, On the decidability of the termination problem of active database systems, Expressive power and succinctness of the positive calculus of binary relations, A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\), Modular materialisation of Datalog programs, A tetrachotomy of ontology-mediated queries with a covering axiom, LARS: a logic-based framework for analytic reasoning over streams, Inference-proof updating of a weakened view under the modification of input parameters, Finitely representable databases, A query language for NC, Containment of queries for graphs with data, Logic-based argumentation with existential rules, Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints, A progression semantics for first-order logic programs, Ontology-based semantic search on the web and its combination with the power of inductive reasoning, A first step towards implementing dynamic algebraic dependences, Models of approximation in databases, A probabilistic view of Datalog parallelization, The Kolmogorov expressive power of Boolean query languages, A corrected 5NF definition for relational database design, Queries with arithmetical constraints, Bounded fixpoints for complex objects, Query containment for data integration systems, Verification of relational transducers for electronic commerce, On the content of materialized aggregate views, Reachability and connectivity queries in constraint databases, Integrity constraints for XML, Certifying standard and stratified Datalog inference engines in SSReflect, From orthogonal projections to a generalized quantum search, Expressive power of SQL., Scalar aggregation in inconsistent databases., Algebraic rewritings for optimizing regular path queries., On temporal logic versus Datalog, Incremental recomputation in local languages., On the complexity of single-rule datalog queries., Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width., On the complexity of equational problems in CNF, First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus, On the impact of regular functional dependencies when moving to a possibilistic database framework., Logical foundations of information disclosure in ontology-based data integration, Counting subset repairs with functional dependencies, Chance discovery in medicine -- detection of rare risky events in chronic diseases, Heterogeneous active agents. III: Polynomially implementable agents, Open-world probabilistic databases: semantics, algorithms, complexity, The descriptive complexity of decision problems through logics with relational fixed-point and capturing results, Functional dependency restricted insertion propagation, Enhancing context knowledge repositories with justifiable exceptions, Answering regular path queries in expressive description logics via alternating tree-automata, Characterizing functional dependencies in formal concept analysis with pattern structures, Constructing Armstrong tables for general cardinality constraints and not-null constraints, The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs, Functional dependencies on extended relations defined by regular languages, Functional dependencies are helpful for partial materialization of data cubes, Magic sets for disjunctive Datalog programs, Matching dependencies: semantics and query answering, A complete axiomatization of fuzzy functional dependencies using fuzzy function, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Distance-based paraconsistent logics, Minimal-change integrity maintenance using tuple deletions, Structural recursion as a query language on lists and ordered trees, On the complexity of deciding typability in the relational algebra, Active integrity constraints for general-purpose knowledge bases, Semi-oblivious chase termination: the sticky case, Consistent query answering for primary keys in Datalog, Pruning external minimality checking for answer set programs using semantic dependencies, A technique for proving decidability of containment and equivalence of linear constraint queries, On the complexity and approximability of repair position selection problem, Situation calculus for controller synthesis in manufacturing systems with first-order state representation, Sequences, datalog, and transducers, Algebras for querying text regions: Expressive power and optimization, Arity bounds in first-order incremental evaluation and definition of polynomial time database queries, Semantics and expressiveness issues in active databases, The expressive power of stratified logic programs with value invention, Games and total Datalog\(^{\lnot}\) queries, Local properties of query languages, A logic-based approach to incremental reasoning on multi-agent systems, Logical separability of labeled data examples under ontologies, The fine-grained complexity of multi-dimensional ordering properties, Path constraints in semistructured databases, Relational transducers for electronic commerce, Querying spatial databases via topological invariants, Conjunctive-query containment and constraint satisfaction, Temporal connectives versus explicit timestamps to query temporal databases, On the complexity of data disjunctions., On the complexity of database queries, Regular path queries with constraints, Adding for-loops to first-order logic, Abstract state machines and computationally complete query languages, Fast left Kan extensions using the chase, On sampling representatives of relational schemas with a functional dependency, On the expressive power of message-passing neural networks as global feature map transformers, Can you answer while you wait?, Optimizing multiset relational algebra queries using weak-equivalent rewrite rules, Local higher-order fixpoint iteration, Functional queries in datalog, Rewriting queries using views over monadic database schemas, Correspondence and translation for heterogeneous data, Expressiveness of concept expressions in first-order description logics, Query automata over finite trees, The expressiveness of DAC, Reactive computing as model generation, On the data complexity of consistent query answering, Highly expressive query languages for unordered data trees, Deciding confluence for a simple class of relational transducer networks, Structural tractability of counting of solutions to conjunctive queries, Querying incomplete information in RDF with SPARQL, Bounded situation calculus action theories, Maintaining transitive closure in first order after node-set and edge-set deletions, Implication and axiomatization of functional and constant constraints, Relational lattices: from databases to universal algebra, Representing ontologies using description logics, description graphs, and rules, Embedding relational databases in object ontologies: implementation issues, Knowledge base exchange: the case of OWL 2 QL, Binary equality implication constraints, normal forms and data redundancy, Converging to the chase -- a tool for finite controllability, Constraint satisfaction with bounded treewidth revisited, A semantic approach to optimize linear datalog programs, Deciding implication for functional dependencies in complex-value databases, Logic programming approach to automata-based decision procedures, Database query languages and functional logic programming, Towards more expressive ontology languages: the query answering problem, Well-definedness and semantic type-checking for the nested relational calculus, Rewriting queries using views with access patterns under integrity constraints, An Ehrenfeucht-Fraïssé game approach to collapse results in database theory, Propagating XML constraints to relations, Specification and verification of data-driven Web applications, Weighted hypertree decompositions and optimal query plans, Circumscribing DATALOG: expressive power and complexity, An equational logic based approach to the security problem against inference attacks on object-oriented databases, Question answering and database querying: bridging the gap with generalized quantification, On the complexity of division and set joins in the relational algebra, Magic Sets and their application to data integration, Dependency-preserving normalization of relational and XML data, Extending inclusion dependencies with conditions, On simplification of schema mappings, A dichotomy in the complexity of counting database repairs, Model-checking games for logics of imperfect information, Monitoring of temporal first-order properties with aggregations, A theoretical framework for knowledge-based entity resolution, A relation-algebraic approach to the ``Hoare logic of functional dependencies, An inductive database system based on virtual mining views, On the complexity of sampling query feedback restricted database repair of functional dependency violations, View-based query answering in description logics: semantics and complexity, Repairing XML functional dependency violations, Appropriate inferences of data dependencies in relational databases, Information-based distance measures and the canonical reflection of view updates, Characterisations of multivalued dependency implication over undetermined universes, Query languages for data exchange: beyond unions of conjunctive queries, Querying data sources that export infinite sets of views, Reconcilable differences, On rules with existential variables: walking the decidability line, Prioritized repairing and consistent query answering in relational databases, Probabilistic query answering over inconsistent databases, Maintaining distributed logic programs incrementally, Reasoning about XML update constraints, Practical algorithms for MSO model-checking on tree-decomposable graphs, Restricted default theories: expressive power and outlier detection tasks, Inexact and exact quantum searches with a preparation state in a three-dimensional subspace, Computing with infinitary logic, The complexity of higher-order queries, Conjunctive query containment with respect to views and constraints, World-set decompositions: Expressiveness and efficient algorithms, RQL: a query language for rule discovery in databases, Proving semantical equivalence of data specifications, Structure identification of Boolean relations and plain bases for co-clones, ERBlox: combining matching dependencies with machine learning for entity resolution, First-order under-approximations of consistent query answers, Relative expressive power of navigational querying on graphs, Tractability and intractability of controlled languages for data access, The navigational power of web browsers, Queries and materialized views on probabilistic databases, Relational completeness of query languages for annotated databases, Foundations of semantic web databases, On the finite controllability of conjunctive query answering in databases under open-world assumption, Numerical constraints on XML data, Inherent complexity of recursive queries, Hypertree decompositions and tractable queries, Aggregate operators in constraint query languages, Towards an algebraic theory of information integration, On database query languages for K-relations, Tractable query answering and rewriting under description logic constraints, Decidable containment of recursive queries, XML queries and constraints, containment and reformulation, On reasoning about structural equality in XML: a description logic approach, On the complexity of entailment in existential conjunctive first-order logic with atomic negation, Incorporating cardinality constraints and synonym rules into conditional functional dependencies, Inclusion dependencies and their interaction with functional dependencies in SQL, Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications, I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration, Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions, Axiomatizing functional dependencies in the higher-order entity-relationship model, Expressive power and complexity of partial models for disjunctive deductive databases, Modeling virtual worlds in databases, Reasoning about nondeterministic and concurrent actions: A process algebra approach, Safety, domain independence and translation of complex value database queries, A more general theory of static approximations for conjunctive queries, Distribution policies for Datalog, Graph-theoretic formalization of hybridization in DNA sticker complexes, Order-sorted logic programming with predicate hierarchy, An incremental algorithm for DLO quantifier elimination via constraint propagation, Effective Interpolation and Preservation in Guarded Logics, Datalog Queries Distributing over Components, On Monotonic Determinacy and Rewritability for Recursive Queries and Views, The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems, Type Theoretical Databases, On Tree Substitution Grammars, Enumeration for FO Queries over Nowhere Dense Graphs, Computing Dependencies Using FCA, A Generalization of the Inference Rules for Join Dependencies in Databases, Certified Graph View Maintenance with Regular Datalog, Scaling-up reasoning and advanced analytics on BigData, A datalog-based computational model for coordination-free, data-parallel systems, Rough Sets in Incomplete Information Systems with Order Relations Under Lipski’s Approach, Twofold rough approximations under incomplete information, Unnamed Item, Algebraic data integration, Unnamed Item, On the relation between SPARQL1.1 and Answer Set Programming, Expressive Power and Succinctness of the Positive Calculus of Relations, Modern Datalog Engines, Unnamed Item, Taming primary key violations to query large inconsistent data via ASP, Putting logic-based distributed systems on stable grounds, Consistency and trust in peer data exchange systems, A Distributed Approach to LARS Stream Reasoning (System paper), A Logic Framework for P2P Deductive Databases, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH, The Semantics of Datalog for the Evidential Tool Bus, SOME MODEL THEORY OF GUARDED NEGATION, Reasoning and Query Answering in Description Logics, Datalog and Its Extensions for Semantic Web Databases, Making big data small, On the complexity of existential positive queries, Comparing the succinctness of monadic query languages over finite trees, Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data, On Functional Dependencies in Advanced Data Models, Normal forms for connectedness in categories, On the expressibility and the computability of untyped queries, A variant of Thomason's first-order logic CF based on situations, Unnamed Item, Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions, Unnamed Item, Semantics and expressive power of nondeterministic constructs in deductive databases, Functional and approximate dependency mining: database and FCA points of view, Refinements of complexity results on type consistency for object-oriented databases, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Information-Optimal Reflections of View Updates on Relational Database Schemata, On the Existence of Armstrong Instances with Bounded Domains, Towards a Logic for Abstract MetaFinite State Machines, Default logic and bounded treewidth, Linking Data to Ontologies, Multi-shot ASP solving with clingo, First-order definable counting-only queries, A framework for comparing query languages in their ability to express Boolean queries, Using acceptors as transducers, A Framework for Formalizing Set Theories Based on the Use of Static Set Terms, Why Sets?, Incremental reasoning on monadic second-order logics with logic programming, Computations by fly-automata beyond monadic second-order logic, ASP-Core-2 Input Language Format, Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation, Characterizing Boundedness in Chase Variants, CONSTRUCTIVE REFLECTIVITY PRINCIPLES FOR REGULAR THEORIES, Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation, Unnamed Item, On matrices and \(K\)-relations, Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data, Unnamed Item, Ontologies and Databases: The DL-Lite Approach, Fragments of Bag Relational Algebra: Expressiveness and Certain Answers, A Formal Framework for Complex Event Processing, An Experimental Study of the Treewidth of Real-World Graph Data, Counting Answers to Existential Questions, A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties, Datalog: Bag Semantics via Set Semantics, Approximate databases: a support tool for approximate reasoning, Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting, HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results, Combining Description Logics, Description Graphs, and Rules, Zdzisław Pawlak, Databases and Rough Sets, Logic-Based Roughification, Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context, A Logical Approach to Constraint Satisfaction, Uniform Constraint Satisfaction Problems and Database Theory, Schema Mappings: A Case of Logical Dynamics in Database Theory, The Impact of Active Domain Predicates on Guarded Existential Rules, Stability theory, permutations of indiscernibles, and embedded finite models, First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries, Negative Knowledge for Certain Query Answers, Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, Computing queries with higher-order logics, Containment of Monadic Datalog Programs via Bounded Clique-Width, On the Interaction of Existential Rules and Equality Constraints in Ontology Querying, Tight lower bounds for query processing on streaming and external memory data, A finite axiomatization of conditional independence and inclusion dependencies, Certain answers as objects and knowledge, On Enumerating Query Plans Using Analytic Tableau, Unnamed Item, Controlled query evaluation with open queries for a decidable relational submodel, Database querying under changing preferences, Deductive databases for computing certain and consistent answers from mediated data integration systems, Exact Query Reformulation with First-Order Ontologies and Databases, A representation independent language for planar spatial databases with Euclidean distance, Multi-modal nonmonotonic logics of minimal knowledge, Expressive probabilistic description logics, On the expressive power of semijoin queries, Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation, An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases, Process-centric views of data-driven business artifacts, Answering conjunctive queries with inequalities, Regular queries on graph databases, Parameterized complexity of completeness reasoning for conjunctive queries, Descriptive complexity of deterministic polylogarithmic time and space, Covers of Query Results, Strong simulation, Distribution Policies for Datalog., A More General Theory of Static Approximations for Conjunctive Queries, On the Expressive Power of Query Languages for Matrices, Eliminating Recursion from Monadic Datalog Programs on Trees, Complexity results on register context-free grammars and related formalisms, Some Remarks on Relational Database Schemes Having Few Minimal Keys, Checking causal consistency of distributed databases, SPT(q, k, n)-Codes, Solving projected model counting by utilizing treewidth and its limits, Vertex cover in conflict graphs, Codes that attain minimum distance in every possible direction, Complexity results for answer set programming with bounded predicate arities and implications, SHACL: a description logic in disguise, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Navigational and Rule-Based Languages for Graph Databases, Recent Advances in Datalog$$^\pm $$, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Reasoning about functional and full hierarchical dependencies over partial relations, On the primitivity of operators in SPARQL, Positive Dedalus programs tolerate non-causality, The price of query rewriting in ontology-based data access, Inf-datalog, Modal Logic and Complexities, Automated reformulation of specifications by safe delay of constraints, In defense of PDDL axioms, Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Reasoning in description logics by a reduction to disjunctive datalog, A paraconsistent logic programming approach for querying inconsistent databases, Unnamed Item, Characterising nested database dependencies by fragments of propositional logic, Itemset frequency satisfiability: complexity and axiomatization, Constructibility and decidability versus domain independence and absoluteness, ONTOGRATE: TOWARDS AUTOMATIC INTEGRATION FOR RELATIONAL DATABASES AND THE SEMANTIC WEB THROUGH AN ONTOLOGY-BASED FRAMEWORK, Database Theory, Yuri, and Me, A Generalisation of Entity and Referential Integrity in Relational Databases, STEP implementation of imperfect EXPRESS model in fuzzy object-oriented databases, About the processing of possibilistic queries involving a difference operation, Modulo constraints and the complexity of typechecking XML views, Axiomatizing the logical core of XPath 2.0, A complexity theory for hard enumeration problems, A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries, The complexity of embedded axiomatization for a class of closed database views, Functional and multivalued dependencies in nested databases generated by record and list constructor, Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations, On the Complexity of Query Result Diversification, Model checking hybrid logics (with an application to semistructured data), The hardness of resilience for nested aggregation query, Monitoring Metric First-Order Temporal Properties, Comparison of expressive power of some query languages for databases, Conjunctive query pattern structures: a relational database model for formal concept analysis, Monadic Datalog Tree Transducers, On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases, Repetitions and permutations of columns in the semijoin algebra, On the Complexity of Insertion Propagation with Functional Dependency Constraints, WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER, HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems, Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints, Conceptual Modeling for Data Integration, Characterization of Optimal Complements of Database Views Defined by Projection, Coding Theory Motivated by Relational Databases, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes, Foundations of RDF Databases, Query Answering with DBoxes is Hard, Combining Consistency and Confidentiality Requirements in First-Order Databases, Calculi for symmetric queries, Maintenance of datalog materialisations revisited, Foundations of ontology-based data access under bag semantics, How many variables are needed to express an existential positive query?, Evaluating Datalog via tree automata and cycluits, The semijoin algebra and the guarded fragment, Computing possible and certain answers over order-incomplete data, Minimal and consistent evolution of knowledge bases, \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets, Algebraic Databases, The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies, Orbital concept lattices, Linear constraint query languages expressive power and complexity, Logics capturing relativized complexity classes uniformly, Answer Counting under Guarded TGDs, The notion of abstraction in ontology-based data management, Languages generated by conjunctive query fragments of FC[REG], DNAQL: a query language for DNA sticker complexes, On the k-Boundedness for Existential Rules, Inductive definitions in logic versus programs of real-time cellular automata, Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic, Efficient Evaluation of Arbitrary Relational Calculus Queries, From DB-nets to Coloured Petri Nets with Priorities, Three views on dependency covers from an FCA perspective, Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments, Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests, Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions, A simple logic of concepts, A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases, Reconciling communication delays and negation, Early detection of temporal constraint violations, Rewriting with Acyclic Queries: Mind Your Head, On Barwise and Cooper’s “Generalized Quantifiers and Natural Language”, Correctness Notions for Petri Nets with Identifiers, Efficient edit rule implication for nominal and ordinal data, POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND, Metafinite model theory
Uses Software
