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
- 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
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)
