The following pages link to (Q4864249):
Displaying 50 items.
- 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)
- Codes that attain minimum distance in every possible direction (Q2425557) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Reasoning about functional and full hierarchical dependencies over partial relations (Q2446453) (← links)
- On the primitivity of operators in SPARQL (Q2448857) (← links)
- Positive Dedalus programs tolerate non-causality (Q2453541) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family (Q2462646) (← links)
- Reasoning in description logics by a reduction to disjunctive datalog (Q2462648) (← links)
- A paraconsistent logic programming approach for querying inconsistent databases (Q2463646) (← links)
- Characterising nested database dependencies by fragments of propositional logic (Q2478548) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Constructibility and decidability versus domain independence and absoluteness (Q2482456) (← links)
- STEP implementation of imperfect EXPRESS model in fuzzy object-oriented databases (Q2495464) (← links)
- About the processing of possibilistic queries involving a difference operation (Q2495466) (← links)
- The complexity of embedded axiomatization for a class of closed database views (Q2502159) (← links)
- Functional and multivalued dependencies in nested databases generated by record and list constructor (Q2502161) (← links)
- Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- The semijoin algebra and the guarded fragment (Q2567344) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
