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)
- 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
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- The data complexity of ontology-mediated queries with closed predicates
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Reconciling communication delays and negation
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Modular materialisation of Datalog programs
- Characterizing functional dependencies in formal concept analysis with pattern structures
- On the expressive power of query languages for matrices
- SOME MODEL THEORY OF GUARDED NEGATION
- Consistent query answering for primary keys in Datalog
- Semi-oblivious chase termination: the sticky case
- Title not available (Why is that?)
- Regular queries on graph databases
- Active integrity constraints for general-purpose knowledge bases
- Reasoning and query answering in description logics
- Algebraic data integration
- Pruning external minimality checking for answer set programs using semantic dependencies
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- ASP-Core-2 input language format
- Answering regular path queries in expressive description logics via alternating tree-automata
- Containment of queries for graphs with data
- Logic-based argumentation with existential rules
- Situation calculus for controller synthesis in manufacturing systems with first-order state representation
- A progression semantics for first-order logic programs
- Certifying standard and stratified Datalog inference engines in SSReflect
- Twofold rough approximations under incomplete information
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning
- Default logic and bounded treewidth
- Why Sets?
- A logic-based approach to incremental reasoning on multi-agent systems
- Expressive Power and Succinctness of the Positive Calculus of Relations
- Taming primary key violations to query large inconsistent data via ASP
- Logical separability of labeled data examples under ontologies
- The fine-grained complexity of multi-dimensional ordering properties
- On the complexity and approximability of repair position selection problem
- Counting Answers to Existential Questions
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Inf-datalog, Modal Logic and Complexities
- A Generalization of the Inference Rules for Join Dependencies in Databases
- Model checking hybrid logics (with an application to semistructured data)
- Relational completeness of query languages for annotated databases
- Expressive power and succinctness of the positive calculus of binary relations
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- An inductive database system based on virtual mining views
- Normal forms for connectedness in categories
- The Kolmogorov expressive power of Boolean query languages
- View-based query answering in description logics: semantics and complexity
- Uniform Constraint Satisfaction Problems and Database Theory
- On the complexity of deciding typability in the relational algebra
- On reasoning about structural equality in XML: a description logic approach
- Expressiveness of concept expressions in first-order description logics
- Functional queries in datalog
- Aggregate operators in constraint query languages
- Repairing XML functional dependency violations
- Appropriate inferences of data dependencies in relational databases
- Information-based distance measures and the canonical reflection of view updates
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- Reachability and connectivity queries in constraint databases
- Introduction to constraint databases
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- Tight lower bounds for query processing on streaming and external memory data
- Reasoning about XML update constraints
- Numerical constraints on XML data
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- Algebraic rewritings for optimizing regular path queries.
- Comparison of expressive power of some query languages for databases
- Multi-modal nonmonotonic logics of minimal knowledge
- Probabilistic query answering over inconsistent databases
- On the complexity of hard enumeration problems
- Distance-based paraconsistent logics
- Propagating XML constraints to relations
- Monitoring metric first-order temporal properties
- Correspondence and translation for heterogeneous data
- Controlled query evaluation with open queries for a decidable relational submodel
- Maintaining distributed logic programs incrementally
- From orthogonal projections to a generalized quantum search
- Database query languages and functional logic programming
- Itemset frequency satisfiability: complexity and axiomatization
- On the complexity of existential positive queries
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)
