The following pages link to (Q4864249):
Displayed 50 items.
- Functional dependency restricted insertion propagation (Q1986557) (← links)
- Semi-oblivious chase termination: the sticky case (Q2035470) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- Situation calculus for controller synthesis in manufacturing systems with first-order state representation (Q2060723) (← links)
- The delay and window size problems in rule-based stream reasoning (Q2124457) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Inference-proof updating of a weakened view under the modification of input parameters (Q2167727) (← links)
- Counting subset repairs with functional dependencies (Q2221807) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- Constructing Armstrong tables for general cardinality constraints and not-null constraints (Q2254637) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Functional dependencies on extended relations defined by regular languages (Q2254640) (← links)
- Functional dependencies are helpful for partial materialization of data cubes (Q2254643) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Distance-based paraconsistent logics (Q2270429) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Axiomatizing the logical core of XPath 2.0 (Q2272223) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries (Q2274499) (← links)
- Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations (Q2278100) (← links)
- The hardness of resilience for nested aggregation query (Q2283020) (← links)
- Conjunctive query pattern structures: a relational database model for formal concept analysis (Q2286397) (← links)
- HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems (Q2304532) (← links)
- Calculi for symmetric queries (Q2316929) (← links)
- Maintenance of datalog materialisations revisited (Q2321273) (← links)
- Foundations of ontology-based data access under bag semantics (Q2321309) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies (Q2352492) (← links)
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets (Q2369012) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Controlled query evaluation with open queries for a decidable relational submodel (Q2385449) (← links)
- Database querying under changing preferences (Q2385451) (← links)
- Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)
- Process-centric views of data-driven business artifacts (Q2396822) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Vertex cover in conflict graphs (Q2424881) (← links)