The following pages link to (Q4864249):
Displayed 50 items.
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- Navigational and Rule-Based Languages for Graph Databases (Q2970302) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Algebraic Databases (Q2981748) (← links)
- Characterization of Optimal Complements of Database Views Defined by Projection (Q3092323) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- Minimal and consistent evolution of knowledge bases (Q3128368) (← links)
- An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases (Q3192964) (← links)
- Some Remarks on Relational Database Schemes Having Few Minimal Keys (Q3223995) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- (Q3305351) (← links)
- On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
- Covers of Query Results (Q3305362) (← links)
- Distribution Policies for Datalog. (Q3305363) (← links)
- WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER (Q3386608) (← links)
- Combining Consistency and Confidentiality Requirements in First-Order Databases (Q3399206) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- On Enumerating Query Plans Using Analytic Tableau (Q3455780) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- SPT(q, k, n)-Codes (Q3503498) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- ONTOGRATE: TOWARDS AUTOMATIC INTEGRATION FOR RELATIONAL DATABASES AND THE SEMANTIC WEB THROUGH AN ONTOLOGY-BASED FRAMEWORK (Q3583068) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- Monadic Datalog Tree Transducers (Q3618586) (← links)
- Repetitions and permutations of columns in the semijoin algebra (Q3625687) (← links)
- Conceptual Modeling for Data Integration (Q3637334) (← links)
- Foundations of RDF Databases (Q3638999) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Approximate databases: a support tool for approximate reasoning (Q3647257) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- Combining Description Logics, Description Graphs, and Rules (Q3655191) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Stability theory, permutations of indiscernibles, and embedded finite models (Q4505906) (← links)
- Certified Graph View Maintenance with Regular Datalog (Q4559800) (← links)
- Scaling-up reasoning and advanced analytics on BigData (Q4559832) (← links)
- A datalog-based computational model for coordination-free, data-parallel systems (Q4559834) (← links)
- Algebraic data integration (Q4577809) (← links)
- (Q4580237) (← links)
- On the relation between SPARQL1.1 and Answer Set Programming (Q4583314) (← links)
- Taming primary key violations to query large inconsistent data via ASP (Q4593009) (← links)
- Putting logic-based distributed systems on stable grounds (Q4593035) (← links)
- Consistency and trust in peer data exchange systems (Q4593083) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- Datalog and Its Extensions for Semantic Web Databases (Q4647813) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- On Functional Dependencies in Advanced Data Models (Q4924533) (← links)
- ASP-Core-2 Input Language Format (Q4957196) (← links)