scientific article; zbMATH DE number 839556
From MaRDI portal
Publication:4864249
Cited in
(only showing first 100 items - show all)- Structural recursion as a query language on lists and ordered trees
- Magic Sets and their application to data integration
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Deciding confluence for a simple class of relational transducer networks
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems
- 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
- On rules with existential variables: walking the decidability line
- Process-centric views of data-driven business artifacts
- Linking Data to Ontologies
- Ontologies and Databases: The DL-Lite Approach
- Safety, domain independence and translation of complex value database queries
- A Logical Approach to Constraint Satisfaction
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Structure identification of Boolean relations and plain bases for co-clones
- Extending inclusion dependencies with conditions
- Foundations of semantic web databases
- Hypertree decompositions and tractable queries
- 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
- Model-checking games for logics of imperfect information
- Bounded situation calculus action theories
- Querying incomplete information in RDF with SPARQL
- Ontograte: towards automatic integration for relational databases and the semantic web through an ontology-based framework
- Computations by fly-automata beyond monadic second-order logic
- Tractable query answering and rewriting under description logic constraints
- Comparing the succinctness of monadic query languages over finite trees
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Characterisations of multivalued dependency implication over undetermined universes
- Regular path queries with constraints
- A theoretical framework for knowledge-based entity resolution
- Logic programming approach to automata-based decision procedures
- Towards more expressive ontology languages: the query answering problem
- Scalar aggregation in inconsistent databases.
- Dependency-preserving normalization of relational and XML data
- Specification and verification of data-driven Web applications
- Stability theory, permutations of indiscernibles, and embedded finite models
- Multi-shot ASP solving with clingo
- A dichotomy in the complexity of counting database repairs
- On simplification of schema mappings
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Conjunctive-query containment and constraint satisfaction
- Decidable containment of recursive queries
- Relational transducers for electronic commerce
- Conjunctive query containment with respect to views and constraints
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Embedding relational databases in object ontologies: implementation issues
- Verification of relational transducers for electronic commerce
- Strong simulation: capturing topology in graph pattern matching
- World-set decompositions: Expressiveness and efficient algorithms
- Graph-theoretic formalization of hybridization in DNA sticker complexes
- Matching dependencies: semantics and query answering
- The expressive power of stratified logic programs with value invention
- Knowledge base exchange: the case of OWL 2 QL
- Query automata over finite trees
- Converging to the chase -- a tool for finite controllability
- ERBlox: combining matching dependencies with machine learning for entity resolution
- Queries and materialized views on probabilistic databases
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
- Prioritized repairing and consistent query answering in relational databases
- Conceptual Modeling for Data Integration
- Reasoning in description logics by a reduction to disjunctive datalog
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On the complexity of single-rule datalog queries.
- Certain answers as objects and knowledge
- Incorporating cardinality constraints and synonym rules into conditional functional dependencies
- Reactive computing as model generation
- Algebras for querying text regions: Expressive power and optimization
- Order-sorted logic programming with predicate hierarchy
- Relational lattices: from databases to universal algebra
- On matrices and \(K\)-relations
- XML queries and constraints, containment and reformulation
- Magic sets for disjunctive Datalog programs
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Rewriting queries using views with access patterns under integrity constraints
- Minimal-change integrity maintenance using tuple deletions
- A finite axiomatization of conditional independence and inclusion dependencies
- 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
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)
