The following pages link to (Q4864249):
Displaying 50 items.
- (Q5094118) (← links)
- (Q5094134) (← links)
- (Q5094143) (← links)
- Expressive Power and Succinctness of the Positive Calculus of Relations (Q5098722) (← links)
- Modern Datalog Engines (Q5101659) (← links)
- A Distributed Approach to LARS Stream Reasoning (System paper) (Q5108515) (← links)
- A Logic Framework for P2P Deductive Databases (Q5108527) (← links)
- Making big data small (Q5160666) (← links)
- Multi-shot ASP solving with clingo (Q5197744) (← links)
- CONSTRUCTIVE REFLECTIVITY PRINCIPLES FOR REGULAR THEORIES (Q5207556) (← links)
- Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data (Q5213646) (← links)
- (Q5232905) (← links)
- Grounded fixpoints and active integrity constraints (Q5240214) (← links)
- Zdzisław Pawlak, Databases and Rough Sets (Q5245177) (← links)
- Logic-Based Roughification (Q5245185) (← links)
- Schema Mappings: A Case of Logical Dynamics in Database Theory (Q5249666) (← links)
- The Impact of Active Domain Predicates on Guarded Existential Rules (Q5268437) (← links)
- Negative Knowledge for Certain Query Answers (Q5268438) (← links)
- Effective Interpolation and Preservation in Guarded Logics (Q5277909) (← links)
- Datalog Queries Distributing over Components (Q5278203) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Type Theoretical Databases (Q5283422) (← links)
- Twofold rough approximations under incomplete information (Q5326150) (← links)
- (Q5377468) (← links)
- The Semantics of Datalog for the Evidential Tool Bus (Q5403073) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- Information-Optimal Reflections of View Updates on Relational Database Schemata (Q5445297) (← links)
- On the Existence of Armstrong Instances with Bounded Domains (Q5445299) (← links)
- Towards a Logic for Abstract MetaFinite State Machines (Q5445311) (← links)
- Linking Data to Ontologies (Q5445729) (← links)
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms (Q5452175) (← links)
- Why Sets? (Q5452179) (← links)
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation (Q5458443) (← links)
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context (Q5504585) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- MODELLING UNCERTAINTY IN MULTIMEDIA DATABASE SYSTEMS: AN EXTENDED POSSIBILISTIC APPROACH (Q5697021) (← links)
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data (Q5738985) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- On matrices and \(K\)-relations (Q5918484) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- First-order definable counting-only queries (Q5919275) (← links)
- A framework for comparing query languages in their ability to express Boolean queries (Q5919276) (← links)
- Normal forms for connectedness in categories (Q5935993) (← links)
- On the expressibility and the computability of untyped queries (Q5936000) (← links)
- A variant of Thomason's first-order logic CF based on situations (Q5937807) (← links)
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions (Q5940927) (← links)
- Semantics and expressive power of nondeterministic constructs in deductive databases (Q5943120) (← links)
