LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
hub
Codd , title =
13 Pith papers cite this work. Polarity classification is still indexing.
13
Pith papers citing it
hub tools
representative citing papers
Scion is a new DSL and compiler that decouples BVH data layouts from traversal algorithms, enabling architecture-agnostic layout optimizations and a novel Pareto-optimal ray tracing layout.
LMs store facts in task-specific parameter subsets, shown by inconsistent emergence across tasks during training and distinct localized parameters for the same fact.
OpenRFM combines a relational transformer backbone with a batch-level ICL layer and homophily-aware synthetic-plus-real pre-training to improve relational in-context learning by ~30% over prior open models and surpass KumoRFMv1.
DDS introduces typed contracts at intent, operator DAG, skills, and runtime layers to bound agentic search for data system compositions, achieving convergence on a trading workload where unbounded iteration fails.
Novel optimization techniques for navigational graph queries achieve orders of magnitude performance gains over prior methods on diverse real-world workloads.
The MatBase algorithm translates (E)MDM schemes into E-R data models and is proven linear, sound, complete, and semi-optimal.
Object orientation's partitioning of functionality into domain-corresponding objects is neither natural nor straightforward and inevitably produces fragmentation and conflation, so software engineering should abandon it for an approach that decouples domain individuals from functional modules.
Introduces a cross-paradigm database selection framework based on nine dimensions, analyzes thirteen paradigms to identify three evolution patterns, and demonstrates hybrid architectures via a financial fraud detection case study.
A structured comparison of three data warehousing methodologies concludes that the best choice depends on organizational factors like scale and regulatory needs.
A pseudocode algorithm converts mathematical database schemes into relational ones with non-relational constraints, claimed to be fast, solid, complete, and optimal, demonstrated on genealogical trees with SQL and VBA examples.
citing papers explorer
-
Deciding the Common Fragment of CTL with Past and LTL
LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
-
Decoupling Data Layouts from Bounding Volume Hierarchies
Scion is a new DSL and compiler that decouples BVH data layouts from traversal algorithms, enabling architecture-agnostic layout optimizations and a novel Pareto-optimal ray tracing layout.
-
LMs as Task-Specific Knowledge Bases: An Interpretability Analysis
LMs store facts in task-specific parameter subsets, shown by inconsistent emergence across tasks during training and distinct localized parameters for the same fact.
-
OpenRFM: Dissecting Relational In-Context Learning
OpenRFM combines a relational transformer backbone with a batch-level ICL layer and homophily-aware synthetic-plus-real pre-training to improve relational in-context learning by ~30% over prior open models and surpass KumoRFMv1.
-
Declarative Data Services: Structured Agentic Discovery for Composing Data Systems
DDS introduces typed contracts at intent, operator DAG, skills, and runtime layers to bound agentic search for data system compositions, achieving convergence on a trading workload where unbounded iteration fails.
-
Optimizing Navigational Graph Queries
Novel optimization techniques for navigational graph queries achieve orders of magnitude performance gains over prior methods on diverse real-world workloads.
-
MatBase algorithm for translating (E)MDM schemes into E-R data models
The MatBase algorithm translates (E)MDM schemes into E-R data models and is proven linear, sound, complete, and semi-optimal.
-
Beyond Objects
Object orientation's partitioning of functionality into domain-corresponding objects is neither natural nor straightforward and inevitably produces fragmentation and conflation, so software engineering should abandon it for an approach that decouples domain individuals from functional modules.
-
Architectural Evolution and Selection Framework for Database Systems in AI-Ready Data Platforms
Introduces a cross-paradigm database selection framework based on nine dimensions, analyzes thirteen paradigms to identify three evolution patterns, and demonstrates hybrid architectures via a financial fraud detection case study.
-
Enterprise Data Modelling Methodologies: A Comparative Analysis of Inmon, Kimball, and Data Vault
A structured comparison of three data warehousing methodologies concludes that the best choice depends on organizational factors like scale and regulatory needs.
-
Translating database mathematical schemes into relational database software applications with MatBase
A pseudocode algorithm converts mathematical database schemes into relational ones with non-relational constraints, claimed to be fast, solid, complete, and optimal, demonstrated on genealogical trees with SQL and VBA examples.
- KnowledgeBerg: Evaluating Systematic Knowledge Coverage and Compositional Reasoning in Large Language Models
- Bonsai: Compiling Queries to Pruned Tree Traversals