Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates

Synthesizing relational queries from data is challenging in the presence of recursion and invented predicates. We propose a fully automated approach to synthesize such queries. Our approach comprises of two steps: it first synthesizes a non-recursive query consistent with the given data, and then id...

Celý popis

Podrobná bibliografie

Vydáno v:	Proceedings of ACM on programming languages Ročník 7; číslo OOPSLA2; s. 1394 - 1417
Hlavní autoři:	Thakkar, Aalok, Sands, Nathaniel, Petrou, George, Alur, Rajeev, Naik, Mayur, Raghothaman, Mukund
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 16.10.2023
Témata:	Automatic programming Constraint and logic programming Information systems Programming by example Relational database query languages Software and its engineering Theory of computation example-guided synthesis recursive program synthesis Programming by example
ISSN:	2475-1421, 2475-1421
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!