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...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 7; no. OOPSLA2; pp. 1394 - 1417
Main Authors:	Thakkar, Aalok, Sands, Nathaniel, Petrou, George, Alur, Rajeev, Naik, Mayur, Raghothaman, Mukund
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 16.10.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!