scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
zbMATH Open0848.68031MaRDI QIDQ4864249FDOQ4864249
Authors: Serge Abiteboul, Richard Hull, Victor Vianu 
Publication date: 30 January 1996
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Database theory (68P15)
Cited In (only showing first 100 items - show all)
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Conjunctive query containment with respect to views and constraints
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- A theoretical framework for knowledge-based entity resolution
- Matching dependencies: semantics and query answering
- Reactive computing as model generation
- Rewriting queries using views with access patterns under integrity constraints
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- Linking Data to Ontologies
- A Logical Approach to Constraint Satisfaction
- Decidable containment of recursive queries
- Conceptual Modeling for Data Integration
- Incorporating cardinality constraints and synonym rules into conditional functional dependencies
- Deciding confluence for a simple class of relational transducer networks
- Highly expressive query languages for unordered data trees
- On the data complexity of consistent query answering
- Structural tractability of counting of solutions to conjunctive queries
- Magic Sets and their application to data integration
- Characterisations of multivalued dependency implication over undetermined universes
- Order-sorted logic programming with predicate hierarchy
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Bounded situation calculus action theories
- Querying incomplete information in RDF with SPARQL
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Safety, domain independence and translation of complex value database queries
- Hypertree decompositions and tractable queries
- Foundations of semantic web databases
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Implication and axiomatization of functional and constant constraints
- Constraint satisfaction with bounded treewidth revisited
- Dependency-preserving normalization of relational and XML data
- Specification and verification of data-driven Web applications
- Relational lattices: from databases to universal algebra
- Algebras for querying text regions: Expressive power and optimization
- A finite axiomatization of conditional independence and inclusion dependencies
- Structure identification of Boolean relations and plain bases for co-clones
- Tractable query answering and rewriting under description logic constraints
- Verification of relational transducers for electronic commerce
- Embedding relational databases in object ontologies: implementation issues
- Knowledge base exchange: the case of OWL 2 QL
- Model-checking games for logics of imperfect information
- Conjunctive-query containment and constraint satisfaction
- Relational transducers for electronic commerce
- Query automata over finite trees
- Converging to the chase -- a tool for finite controllability
- On the complexity of single-rule datalog queries.
- Minimal-change integrity maintenance using tuple deletions
- On rules with existential variables: walking the decidability line
- On matrices and \(K\)-relations
- Magic sets for disjunctive Datalog programs
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Strong simulation
- Prioritized repairing and consistent query answering in relational databases
- Multi-shot ASP solving with clingo
- Structural recursion as a query language on lists and ordered trees
- Process-centric views of data-driven business artifacts
- Computations by fly-automata beyond monadic second-order logic
- Comparing the succinctness of monadic query languages over finite trees
- Ontologies and Databases: The DL-Lite Approach
- Regular path queries with constraints
- ERBlox: combining matching dependencies with machine learning for entity resolution
- Logic programming approach to automata-based decision procedures
- Reasoning in description logics by a reduction to disjunctive datalog
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
- Certain answers as objects and knowledge
- Towards more expressive ontology languages: the query answering problem
- XML queries and constraints, containment and reformulation
- Extending inclusion dependencies with conditions
- Ontograte: towards automatic integration for relational databases and the semantic web through an ontology-based framework
- World-set decompositions: Expressiveness and efficient algorithms
- Stability theory, permutations of indiscernibles, and embedded finite models
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- A dichotomy in the complexity of counting database repairs
- On simplification of schema mappings
- The expressive power of stratified logic programs with value invention
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Scalar aggregation in inconsistent databases.
- Queries and materialized views on probabilistic databases
- Functional dependency restricted insertion propagation
- On the complexity of data disjunctions.
- Foundations of RDF Databases
- DNAQL: a query language for DNA sticker complexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast left Kan extensions using the chase
- Can you answer while you wait?
- On sampling representatives of relational schemas with a functional dependency
- On the expressive power of message-passing neural networks as global feature map transformers
- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules
- Local higher-order fixpoint iteration
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
- The price of query rewriting in ontology-based data access
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results
- The delay and window size problems in rule-based stream reasoning
- On the decidability of the termination problem of active database systems
- Computing queries with higher-order logics
- Enhancing context knowledge repositories with justifiable exceptions
- Maintenance of datalog materialisations revisited
- Solving projected model counting by utilizing treewidth and its limits
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864249)
