scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
Cited in
(only showing first 100 items - show all)- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications
- Query containment for data integration systems
- A more general theory of static approximations for conjunctive queries
- Distribution policies for Datalog
- A more general theory of static approximations for conjunctive queries
- Distribution policies for Datalog
- LARS: a logic-based framework for analytic reasoning over streams
- Semantic acyclicity for conjunctive queries: approximations and constraints
- scientific article; zbMATH DE number 7566062 (Why is no real title available?)
- Complexity results for answer set programming with bounded predicate arities and implications
- Finitely representable databases
- Weighted hypertree decompositions and optimal query plans
- MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH
- 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
- Path constraints in semistructured databases
- Datalog queries distributing over components
- A probabilistic view of Datalog parallelization
- Queries with arithmetical constraints
- Query answering with DBoxes is hard
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- An incremental algorithm for DLO quantifier elimination via constraint propagation
- On database query languages for K-relations
- A complete axiomatization of fuzzy functional dependencies using fuzzy function
- A safe relational calculus for functional logic deductive databases
- The semijoin algebra and the guarded fragment
- Instance-level update in DL-Lite ontologies through first-order rewriting
- Axiomatizing the logical core of XPath 2.0
- Automated reformulation of specifications by safe delay of constraints
- On the complexity of sampling query feedback restricted database repair of functional dependency violations
- Deciding implication for functional dependencies in complex-value databases
- A semantic approach to optimize linear datalog programs
- Parameterized complexity of completeness reasoning for conjunctive queries
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- Abstract state machines and computationally complete query languages
- Logical foundations of information disclosure in ontology-based data integration
- Monitoring of temporal first-order properties with aggregations
- Approximate databases: a support tool for approximate reasoning
- Inclusion dependencies and their interaction with functional dependencies in SQL
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- Temporal connectives versus explicit timestamps to query temporal databases
- On functional dependencies in advanced data models
- Binary equality implication constraints, normal forms and data redundancy
- Tractability and intractability of controlled languages for data access
- The navigational power of web browsers
- Refinements of complexity results on type consistency for object-oriented databases
- Inherent complexity of recursive queries
- An Experimental Study of the Treewidth of Real-World Graph Data
- Towards an algebraic theory of information integration
- Games and total Datalog\(^{\lnot}\) queries
- Inseparability and conservative extensions of description logic ontologies: a survey
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
- Representing ontologies using description logics, description graphs, and rules
- Querying spatial databases via topological invariants
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Logic-Based Roughification
- Numerical constraints on XML data
- Integrity constraints for XML
- Database querying under changing preferences
- Expressive probabilistic description logics
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- Functional queries in datalog
- Aggregate operators in constraint query languages
- Propagating XML constraints to relations
- Combining Consistency and Confidentiality Requirements in First-Order Databases
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Itemset frequency satisfiability: complexity and axiomatization
- Functional and approximate dependency mining: database and FCA points of view
- The Kolmogorov expressive power of Boolean query languages
- A Generalization of the Inference Rules for Join Dependencies in Databases
- From orthogonal projections to a generalized quantum search
- On reasoning about structural equality in XML: a description logic approach
- Repairing XML functional dependency violations
- Appropriate inferences of data dependencies in relational databases
- Information-based distance measures and the canonical reflection of view updates
- On the content of materialized aggregate views
- Expressive power and succinctness of the positive calculus of binary relations
- Monitoring metric first-order temporal properties
- View-based query answering in description logics: semantics and complexity
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Well-definedness and semantic type-checking for the nested relational calculus
- An inductive database system based on virtual mining views
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Computing with infinitary logic
- Proving semantical equivalence of data specifications
- Making big data small
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- Reconcilable differences
- Inf-datalog, Modal Logic and Complexities
- Normal forms for connectedness in categories
- Reachability and connectivity queries in constraint databases
- Expressiveness of concept expressions in first-order description logics
- On the complexity of existential positive queries
- Comparison of expressive power of some query languages for databases
- Model checking hybrid logics (with an application to semistructured data)
- Introduction to constraint databases
- On the complexity of database queries
- Multi-modal nonmonotonic logics of minimal knowledge
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)
