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?)
- A tetrachotomy of ontology-mediated queries with a covering axiom
- 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
- 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
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH
- Monitoring of temporal first-order properties with aggregations
- Parameterized complexity of completeness reasoning for conjunctive queries
- Tractability and intractability of controlled languages for data access
- The navigational power of web browsers
- Inherent complexity of recursive queries
- Representing ontologies using description logics, description graphs, and rules
- On database query languages for K-relations
- Temporal connectives versus explicit timestamps to query temporal databases
- Binary equality implication constraints, normal forms and data redundancy
- Towards an algebraic theory of information integration
- LARS: a logic-based framework for analytic reasoning over streams
- A semantic approach to optimize linear datalog programs
- Abstract state machines and computationally complete query languages
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- Finitely representable databases
- A probabilistic view of Datalog parallelization
- Queries with arithmetical constraints
- Automated reformulation of specifications by safe delay of constraints
- Inseparability and conservative extensions of description logic ontologies: a survey
- Path constraints in semistructured databases
- Instance-level update in DL-Lite ontologies through first-order rewriting
- Deciding implication for functional dependencies in complex-value databases
- Inclusion dependencies and their interaction with functional dependencies in SQL
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Refinements of complexity results on type consistency for object-oriented databases
- Weighted hypertree decompositions and optimal query plans
- 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
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- Query answering with DBoxes is hard
- Axiomatizing the logical core of XPath 2.0
- Query containment for data integration systems
- On functional dependencies in advanced data models
- Games and total Datalog\(^{\lnot}\) queries
- Querying spatial databases via topological invariants
- A complete axiomatization of fuzzy functional dependencies using fuzzy function
- On the complexity of sampling query feedback restricted database repair of functional dependency violations
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Logical foundations of information disclosure in ontology-based data integration
- An Experimental Study of the Treewidth of Real-World Graph Data
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)
