scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
Cited in
(only showing first 100 items - show all)- 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
- Querying data sources that export infinite sets of views
- Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
- Reasoning about XML update constraints
- Scaling-up reasoning and advanced analytics on BigData
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- First-order under-approximations of consistent query answers
- Correspondence and translation for heterogeneous data
- The complexity of higher-order queries
- Database query languages and functional logic programming
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Restricted default theories: expressive power and outlier detection tasks
- Relative expressive power of navigational querying on graphs
- RQL: a query language for rule discovery in databases
- Relational completeness of query languages for annotated databases
- Tight lower bounds for query processing on streaming and external memory data
- Probabilistic query answering over inconsistent databases
- In defense of PDDL axioms
- Distance-based paraconsistent logics
- Controlled query evaluation with open queries for a decidable relational submodel
- On the complexity of deciding typability in the relational algebra
- Uniform Constraint Satisfaction Problems and Database Theory
- Algebraic rewritings for optimizing regular path queries.
- Characterising nested database dependencies by fragments of propositional logic
- scientific article; zbMATH DE number 176242 (Why is no real title available?)
- Query languages for data exchange: beyond unions of conjunctive queries
- Maintaining distributed logic programs incrementally
- A framework for comparing query languages in their ability to express Boolean queries
- The complexity of embedded axiomatization for a class of closed database views
- 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
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)
