The following pages link to (Q4864249):
Displayed 50 items.
- 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)
- 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)
- 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)
- A representation independent language for planar spatial databases with Euclidean distance (Q2641864) (← links)
- Multi-modal nonmonotonic logics of minimal knowledge (Q2642626) (← links)
- A Generalisation of Entity and Referential Integrity in Relational Databases (Q2771491) (← links)
- (Q2844062) (← links)
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying (Q2900513) (← links)
- Exact Query Reformulation with First-Order Ontologies and Databases (Q2915072) (← links)
- Strong simulation (Q2943564) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)