Skip to content

Extensional Reasoning with Complete View Definitions and Incomplete Data: a Transformation-based Approach

· 0 citations · 13 references

TL;DR

This paper introduces a novel transformation-based approach to this task that is broadly applicable across many classes of programs and formalizes this approach, proves its correctness and shows that it runs in polynomial time.

View source

Similar papers

#small language model Open access Aug 2026

MGQL: An Executable, Small-Step Semantics of GQL

MGQL is presented, the first mechanized, small-step operational semantics for a substantial read-only fragment of GQL that is grounded in the ISO/IEC 39075 standard, and it is proved that the type system is sound, ensuring an end-to-end guarantee of well-formed queries yielding results that conform to their declared sc...

Aditya Thimmaiah, Tong-Tong Lin, Milos Gligoric · 1 citation
#machine learning Preprint Aug 2026

ClosureBench: A Constructive Benchmark for Compositional Graph Reasoning

ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...

S. Goria · 0 citations
Book Open access Aug 2026

Extending Triple Graph Grammars to Formalize Complex View Definitions on Families of Models

This work continues previous work of equipping the NeoJoin view definition language with a formal semantics that is based on triple graph grammars (TGGs), and introduces a skip semantics for TGG rules, i.e., allowing to skip certain actions a rule prescribes, depending on the application context.

L. König, Jens Kosiol · 0 citations

Crimps: Indexical Separation Logics for Order-Invariant Specifications

Crimp is introduced, a generic higher-order function formalised over a non-standard separation algebra that can be instantiated to capture diverse order-invariant properties of varied imperative data structures and gives rise to a natural separation logic, indexical separation logic, for localising and reflecting state...

Unknown authors · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.